Pure first-order logics of quasiary predicates
PROBLEMS IN PROGRAMMING · 2016
DOI: 10.15407/pp2016.02-03.073 ↗Kurz gefasst
Fachartikel in der Zeitschrift PROBLEMS IN PROGRAMMING, 2016. Verfasst von M.S. Nikitchenko und 2 weiteren Autor:innen. Die Arbeit wurde bisher 8-mal zitiert (Crossref) und nennt 11 Literaturangaben.
Abstract (Originalsprache)
Pure first-order logics of partial and total, single-valued and multi-valued quasiary predicates are investigated. For these logics we describe semantic models and languages, giving special attention in our research to composition algebras of predicates and interpretation classes (sematics), and logical consequence relations for sets of formulas. For the defined relations a number of sequent type calculi is constructed; their characteristic features are extended conditions for sequent closure and original forms for quantifier elimination.
Zitieren
APA
Nikitchenko, M., Shkilniak, О., & Shkilniak, S. (2016). Pure first-order logics of quasiary predicates. PROBLEMS IN PROGRAMMING. https://doi.org/10.15407/pp2016.02-03.073
Vancouver
Nikitchenko M, Shkilniak О, Shkilniak S. Pure first-order logics of quasiary predicates. PROBLEMS IN PROGRAMMING. 2016. doi:10.15407/pp2016.02-03.073
BibTeX
@article{Nikitchenko2016,
author = {Nikitchenko, M.S. and Shkilniak, О.S. and Shkilniak, S.S.},
title = {Pure first-order logics of quasiary predicates},
journal = {PROBLEMS IN PROGRAMMING},
year = {2016},
doi = {10.15407/pp2016.02-03.073}
}
EUVIMED