Artificial intelligence

Scientific journal

ISSN 2710-1673

ONLINE: ISSN 2710-1681

Search by:

Year of publication
Author name
Paper title

Renominative logics with extended renomination, equality and predicate complement

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

Full text (PDF)

UDC: 004.42:510.69
Publication Language: Ukrainian
Stuc. intelekt. 2019; 24(1-2):34-48

Abstract: A new class of program-oriented logical formalisms is investigated – renominative logics with extended renominations, equality predicates, and predicate complement composition. Composition algebras and languages of such logics are described; their semantic properties are investigated. For these logics, a number of logical consequence relations are proposed and investigated, in particular, the logical consequence relations with undefinedness conditions. Properties of these relations form the semantic basis for further construction of sequent-type calculi for the proposed logics.

Keywords: logic, predicate, composition algebra, renomination, equality, logical consequence

References:

  1. Abramsky, S., Gabbay, D., Maibaum, T. (editors) (1993–2000) Handbook of Logic in Computer Science. Oxford University Press, Vol. 1–5.
  2. Nikitchenko, M., Shkilniak, О, Shkilniak, S (2016) Chysti pershoporiadkovi logiky kvaziarnyh pre-dykativ. Problemy programuvannia, 2–3, 73–86.
  3. Hoare, C. (1969) An axiomatic basis for computer programming. Comm. ACM, 12(10), 576–580.
  4. Apt, K. (1981) Ten years of Hoare’s logic: a survey – part I. ACM Trans. Program. Lang. Syst., 3(4), 431–483.
  5. Blass, A., Gurevich, Y. (2001) The underlying logic of Hoare logic, Current Trends in Theoretical Computer Science. Entering the 21st Century, World Scientific, 409–436.
  6. Ivanov, I., Nikitchenko, M. (2018). On the sequence rule for the Floyd-Hoare logic with partial pre- and post- conditions. In Proc. of the 14 th Int. Conf. on ICT, vol. 2104 of CEUR Workshop Proc., 716–724.
  7. Nikitchenko, M.,Shkilniak, O.,Shkilniak, S., Mamedov, T. (2019) Propozytsiini logiky czastkovyh predykativ z kompozytzieyu predykatnoho dopovnennia. Problemy programuvannia, 1, 3–13.
  8. Shkilniak, O. (2019) Vidnoshennia logicznoho naslidku v logikah czastkovyh predykativ zkompozytsieiu predykatnoho dopovnennia. Problemy programuvannia, 3, 11–27.
  9. Shkilniak, S. (2019) Pershoporiadkovi kompozytsiino-nominatyvni logiky z predykatamy slabkoi tastrohoi rivnosti. Problemy programuvannia, 3, 28–44.
  10. Kleene, S.C. (1952) Introductions to Metamathematics. Van Nostrand, Princeton.
  11. Kleene, S.C. (1967) Mathematical Logic. NewYork.

View full text (PDF)