Composition-nominative logics of free-quantifier levels

S.S. Shkilniak, D.B. Volkovytskyi

Abstract


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 models of such logics are described, their semantic properties are studied, in particular the properties of relations of logical consequence.

Problems in programming 2016; 2-3: 38-47


Keywords


free-quantifier logic; predicate; renomination; superposition; equality; logical consequence

Full Text:

PDF (Ukrainian)

References


NIKITCHENKO, M. and SHKILNIAK, S. (2008). Mathematical logic and theory of algorithms. Кyiv: VPC Кyivskyi Universytet (in ukr).

NIKITCHENKO, M. and SHKILNIAK, S. (2013). Applied logic. Кyiv: VPC Кyivskyi Universytet (in ukr).

SHKILNIAK, S. (2012). Sequent calculi of renominative logics of quasiary predicates. In Scientific Notes of NaUKMA. Series: Computer Sciences. 138, p. 23–29 (in ukr).

SHKILNIAK, S. and VOLKOVYTSKYI, D. (2014). Renominative composition-nominative logics with predicates of equality. In Bulletin of Taras Shevchenko National University of Kyiv. Series: Physics & Mathematics. No 3. P. 198–205 (in ukr).

SHKILNIAK, S. and VOLKOVYTSKYI, D. (2015). Free-quantifier functional logics of partial quasi-ary predicates. In Bulletin of Taras Shevchenko National University of Kyiv. Series: Physics & Mathematics. No 3. P. (in ukr).

NIKITCHENKO, M. and SHKILNIAK, S. (2015). Semantic Properties of Logics of Quasiary Predicates. In Workshop on Foundations of Informatics: Proceedings FOI-2015. Chisinau, Moldova. P. 180–197.


Refbacks

  • There are currently no refbacks.