Composition nominative modal logics of partial non-monotone predicates and their calculi

O.S. Shkilniak, V.S. Kasianiuk, L.M. Malutenko

Abstract


We consider new program-oriented logical formalisms of modal type – pure first-order composition nominative modal logics of partial predicates without monotonicity restriction. For such logics we specify semantic models and languages and investigate interactions of modal compositions with renominations and quantifiers. A consequence relation for two formulas in a given state is introduced and generalized to a logical consequence relation for two sets of formulas specified with states. We describe properties of a logical consequence relation for sets of formulas specified with states and properties of modalities elimination for various reachability relations. Sequent type calculi are proposed for general transitional and temporal modal logics of non-monotone predicates. We define various types of the calculi for different reachability relations and specify their basic sequent forms and sequent closure conditions. We give a step-by-step description of a deriving process (building of a sequent tree) by the introduced calculi. For these calculi we prove the soundness theorem and 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. The proof of the completeness theorem is based on the theorem about existence of a counter-model.

Problems in programming 2017; 2: 24-39


Keywords


modal logic; partial predicate; logical consequence sequent calculus

Full Text:

PDF (Ukrainian)

References


NIKITCHENKO M. and SHKILNIAK S. (2013). Applied logic. Кyiv: VPC Кyivskyi Universytet (in ukr).

COCCHIARELLA N. and FREUND M. (2008). Modal logic. Oxford University Press.

NIKITCHENKO M., SHKILNIAK O. and SHKILNIAK, S. (2016). Pure first-order logics of quasiary predicates. In Problems in Progamming. N 2–3, P. 73–86 (in ukr).

SHKILNIAK O. (2009). Semantic properties of composition nominative modal logics. In Problems in Progamming. N 4, P. 11–23 (in ukr).

SHKILNIAK, O. (2010). Composition nominative modal logics of functional-equational level. Problems in Progamming. N 2–3, P. 42–47 (in ukr).

SHKILNIAK O. (2013). Transitional composition-nominative modal logics and their calculi. In Scientific Notes of NaUKMA. Series: Computer sciences. 151, P. 99–110 (in ukr).

SHKILNIAK O. (2014). Transitional modal logics of non-monotone quasiary predicates. In Computer mathematics. 2, P. 99–110 (in ukr).

SHKILNIAK O. (2015). Modal logics of non-monotone partial predicates. In Bulletin of Taras Shevchenko National University of Kyiv. Series: Physics & Mathematics. 3, P. 141–147 (in ukr).

SHKILNIAK O. (2015). Modal Logics of Partial Predicates without Monotonicity Restriction. In Workshop on Foundations of Informatics: Proceedings FOI-2015. Chisinau, Moldova. P. 198–211.


Refbacks

  • There are currently no refbacks.