Artificial intelligence

Scientific journal

ISSN 2710-1673

ONLINE: ISSN 2710-1681

Select your language


Properties of logical consequence relations in logics of quasi-ary predicates

Shkilniak S.1
1 Taras Shevchenko National University of Kyiv

Full text (PDF)

UDC: 004.42:510.69
Publication Language: Ukrainian
Stuc. intelekt. 2013; 18(1):67–78

Abstract: Logical consequence relation for sets of formulas is studied for pure first-order composition-nominative logics of partial single-valued, total and partial multiple-valued predicates. We focus on the properties of relations concerned with quantifier elimination. Special variable definedness predicates are used for description of such properties.

Keywords: logic, predicate, quantifier, logical consequence

References:

  1. Handbook of Logic in Computer Science: In 5 vol. / [Eds. Abramsky S., Gabbay D. and Maibaum T.S.E.]. –Oxford: Clarendon Press, 1994–2000.
  2. Nikitchenko M.S. Matematychna lohika ta teoria algorytmiv. К.: VPC Kyivskyi universytet, 2008. –528 p.
  3. Shkilniak S.S. Vidnoshennia lohichnogo naslidku v komposytsijno-nominatyvnyh lohikah. Probl.programuvannia. 2010. № 1. S. 15–38.
  4. Shkilniak S.S. Kibernetika i systemnyi analiz. 2010. № 6. S. 32-49.
  5. Nikitchenko M.S. Visnyk Kyiv. un-tu. Ser.: phiz.-mat. nauky. 2011. Vyp. 4. S. 176-185.
  6. Shkilniak S.S. Shtucznyj іntelekt. 2012. № 1. S. 307-319.
  7. Nikitchenko M. Satisfability and Validity Problems in Many-sorted Composition-Nominative Pure PredicateLogics / M.Nikitchenko, V.Tymofieiev // Comm. in Comp. and Inf. Science. Vol. 0137. Springer, 2012.

View full text (PDF)