3 papers
math.LO2023
Algorithmic properties of QK4.3 and QS4.3
M. Rybakov, D. Shkatov
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.LO2023
On algorithmic expressivity of finite-variable fragments of intuitionistic modal logics
M. Rybakov, D. Shkatov
We obtain poly-time embeddings of the intuitionistic modal logics FS and MIPC into their positive one-variable fragments.
math.LO2023
Algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames
I. Agadzhanian, M. Rybakov, D. Shkatov
The paper investigates algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames or classes of finite Kripke frames. Precise complexity…