Artificial intelligence

Abstract: In this paper we construct sequent calculi for pure first-order composition nominative modal logics of partial non-monotone predicates. We specify various variants of the introduced calculi, their basic sequent forms and sequent closure conditions. The proof of the completeness theorem is based on the theorem about existence of a counter-model for a non-closed path in a sequent tree; the counter-model is obtained using the Hintikka sets method.

Keywords: modal logic, sequent calculus, soundness, completeness

References:

1. Cocchiarella N.B. Modal logic / N.B. Cocchiarella, M.A. Freund. – Oxford University Press, 2008. –267p.
2. Nikitchenko M.S. Matematychna lohika ta teoriya alhorytmiv / M.S. Nikitchenko, S.S. Shkil'nyak. – K.: VPTs Kyyivs'kyy universytet, 2008. – 528 s.
3. Nikitchenko M.S. Prykladna lohika /M.S.Nikitchenko, S.S.Shkil'nyak.–K.:VPTs Kyyivs'kyy universytet, 2013.–278s.
4. Nikitchenko M. S. Chysti pershoporyadkovi lohiky kvaziarnykh predykativ / M. S. Nikitchenko, O. S. Shkil'nyak, S. S. Shkil'nyak // Probl. prohramuvannya. – 2016. – # 2–3. – C. 73–86.
5. Shkil'nyak O.S. Tranzytsiyni modal'ni lohiky nemonotonnykh kvaziarnykh predykativ / O.S. Shkil'nyak // Komp'yuternaya matematyka. – 2014. – V. 2. – C. 99–110.
6. Shkil'nyak O.S. Modal'ni lohiky nemonotonnykh chastkovykh predykativ / O.S. Shkil'nyak // Visnyk Kyyivs'koho un-tu. Seriya: fiz.-mat. nauky. – 2015. – Vyp. 3. – C. 141–147.
7. Shkilniak O. Modal Logics of Partial Predicates without Monotonicity Restriction / O. Shkilniak // Workshop on Foundations of Informatics: Proceedings FOI-2015. August 24–29, 2015, Chisinau, Moldova. – P. 198–211.