Artificial intelligence

Scientific journal

ISSN 2710-1673

ONLINE: ISSN 2710-1681

Search by:

Year of publication
Author name
Paper title

Semantic properties of logics of general non-deterministic predicates

Nikitchenko M.1, Shkilniak O.1, Shkilniak S.1
1 Taras Shevchenko National University of Kyiv

Full text (PDF)

UDC: 004.42:510.69
Publication Language: Ukrainian
Stuc. intelekt. 2017; 22(3-4):116-126

Abstract: A new class of program-oriented logical formalisms - the logics of general non-deterministic quasiary predicates (GND-predicates) – is proposed and investigated. Such predicates are a generalization of partial non-deterministic predicates of relational type. The relationship between GND-predicates and 7-valued total deterministic predicates is shown. Compositions of GND-predicates are considered; their characteristic properties are presented. The languages of pure first-order logics of GND-predicates and their interpretations are described. The G-consequence relation is defined, its monotonicity is investigated, and the properties of the formulas decompositions are proved.

Keywords: logic, predicate, quasiary predicate, non-deterministic predicate, logical consequence

References:

  1. Handbook of Logic in Computer Science / Edited by S. Abramsky, Dov M. Gabbay and T.S.E. Maibaum. – Oxford University Press, Vol. 1–5, 1993–2000.
  2. Nikitchenko M.S. Prykladna logika / M.S. Nikitchenko, S.S. Shkilniak. – К.: VPC Kyivskyi universytet, 2013. – 278 p.
  3. Nikitchenko M.S. Chysti pershoporiadkovi logiky kvaziarnyh predykativ / M.S. Nikitchenko, S.S. Shkilniak // Probl. programuvannia. – 2016. – No 2–3. – Р. 73–86.
  4. Мykola Nikitchenko and Stepan Shkilniak. Algebras and logics of partial quasiary predicates // Algebra and Discrete Mathematics, Volume 23 (2017). Number 2, pp. 263–278.
  5. Hähnle, R. Many-valued logic, partiality, and abstraction in formal specification languages. Logic Journal of the IGPL, 13 (2005). P. 415–433.
  6. Jones, C. Reasoning about partial functions in the formal development of programs. In: Proceedings of AVoCS’05. Vol. 145. Elsevier, Electronic Notes in Theoretical Computer Science (2006). P. 3–25.
  7. Gries, D., Schneider, F. Avoiding the undefined by underspecification. Technical report, Ithaca, NY, USA (1995).
  8. Duzi, M. Do we have to deal with partiality? Miscellanea Logica, 5 (2003). P. 45–76.
  9. A. Avron, A. Zamansky. Non-deterministic semantics for logical systems, in Handbook of Philosophical Logic, D.M. Gabbay, F. Guenthner (eds.), 2nd ed. Vol. 16 (2011). Springer Netherlands. P. 227–304.
  10. Béziau, J.-Y. 13 questions about universal logic. Bulletin of the Section of Logic, 35(2/3) (2006). P. 133– 150
  11. Béziau, J.-Y. (ed.). Universal Logic: an Anthology. Studies in Universal Logic. Springer Basel (2012).
  12. М.S. Nikitchenko, O.S. Shkilniak and S.S. Shkilniak. Logics of partial non-deterministic predicates // PDMU-2017: international conference: abstracts. – Vilnius, Lithuania, pp. 94–95.

View full text (PDF)