Varieties of pure first-order logics of partial quasiary predicates
DOI:
https://doi.org/10.17721/1812-5409.2024/2.13Keywords:
logic, partial predicate, equality, logical consequenceAbstract
Classical predicate logic typically lies at the basis of various logical systems successfully used in computer science and programming. However, classical logic has fundamental limitations that complicate its application. Therefore, the task of developing new, program-oriented logics becomes important; this highlights the relevance of the proposed research. In this work we study new program-oriented logical formalisms – pure first-order composition-nominative logics of partial quasiary predicates, PCNL. Depending on the presence and type of special predicates-indicators, and equality predicates (weak or strong), the use of traditional or extended renomination, in this paper we specify a number of classes of PCNL. Special predicates-indicators determine the presence of components with the corresponding subject name in the input data, which is necessary to consider for the quantifier elimination in the logics of non-monotonic predicates. Two types of these predicates can be distinguished: total, which determine the presence or absence of a component with a given name, and partial, which only detect the presence of such a component. We propose partial predicates-indicators and the corresponding classes of PCNL. The basic compositions of these logics are described, and their properties are presented. The languages of the introduced classes of logics are specified, and a number of logical consequence relations for these languages are defined. The characteristics of these relations are investigated, and the relationships between them are provided.
Pages of the article in the issue: 80 - 88
Language of the article: English
References
Abramsky, S., Gabbay, D. M., & Maibaum, T. S. E. (Eds). (1993–2000). Handbook of Logic in Computer Science (Vol. 1–5). Oxford University Press.
Barwise, J. (Ed). (1977). Handbook of Mathematical Logic (Part 1–4). North-Holland Publishing Company.
Bjorner, D., & Henson, M. C. (Eds). (2008). Logics of Specification Languages, EATCS Series. Springer.
Huth, M., and Ryan, M. (2004). Logic in Computer Science. Second Edition. Cambridge University Press.
Kleene, S. C. (2013). Mathematical Logic. Dower Publications.
Nikitchenko, M., Shkilniak, O., & Shkilniak, S. (2016). Pure first-order logics of quasiary predicates. Problems in Programming, 2–3, 73–86
[in Ukrainian].
Shoenfield, J. (1967). Mathematical Logic. Addison-Wesley Publishing company.
Shkilniak, S. (2019). First-order composition-nominative logics with predicates of weak equality and of strong equality. Problems in Programming, 3, 28–44. [in Ukrainian].
Shkilniak, O., & Shkilniak, S. (2023). First-Order Sequent Calculi of Logics of Quasiary Predicates with Extended Renominations and Equality.
Proceedings of UkrPROG'2022, Kyiv, Ukraine. CEUR Workshop Proceedings (CEUR-WS.org), 3–18.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Stepan Shkilnyak

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).