Algorithmic properties of QK4.3 and QS4.3
We prove that predicate modal logics QK4.3 and QS4.3 are undecidable in languages with two individual variables, one modandic predicate letter, and one proposition letter.
math.LO↗
arXiv subjects
D. Shkatov
Publications and source records attributed to D. Shkatov.
Kripke trick and decidability of monadic fragments of modal and superintuitionistic logics
We discuss the modifications of the Kripke trick simulating binary predicate letters of classical first-order formulas with monadic modal first-order formulas and the situations where the trick does not work. As a result, we obtain results on algorithmic upper bounds for monadic fragments of some modal and superintuitionistic first-order logics.
math.LO↗
On algorithmic expressivity of finite-variable fragments of intuitionistic modal logics
We obtain poly-time embeddings of the intuitionistic modal logics FS and MIPC into their positive one-variable fragments.
math.LO↗
Algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames
The paper investigates algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames or classes of finite Kripke frames. Precise complexity bounds for monadic logics of classes of Kripke frames with finitely many possible worlds are obtained.
math.LO↗
Computational complexity of one-variable fragments of products with T
We show that products of propositional modal logics containing the logic of reflexive frames T as a factor are embeddable into their single-variable fragments. The proof is a simplified version of the proof, to appear, of a similar result for products and expanding relativized products containing as a factor the logic KTB of reflexive and symmetric Kripke frames.
math.LO↗