Composition-nominative logics of free-quantifier levels
Композиційно-номінативні логіки безкванторних рівнів

S.S. Shkilniak, Kiev Taras Shevchenko National University, D.B. Volkovytskyi, Kiev Taras Shevchenko National University
2016 PROBLEMS IN PROGRAMMING  
Free-quantifier composition nominative logics of partial quasiary predicates are considered. We specify the following levels of these logics: renominative, renominative with predicates of weak equality, renominative with predicates of strong equality, free-quantifier, free-quantifier with composition of weak equality, free-quantifier with composition of strong equality. The paper is mainly dedicated to investigation ofNlogics of free-quantifier levels with equality. Languages and semantic
more » ... of such logics are described, their semantic properties are studied, in particular the properties of relations of logical consequence.
doi:10.15407/pp2016.02-03.038 fatcat:fx7ynnf7h5antj73h3dfiwszuu