29 citations · 90 across the 13 of their papers we have counts for
13 papers
Semantics for the minimal well-determined logic
Igor Gorbunov, Mikhail Rybakov
The minimal well-determined logic in the language with conjunction and implication is investigated. A calculus for this logic, in which the modus ponens rule is not postulated, is…
Kripke trick and decidability of monadic fragments of modal and superintuitionistic logics
M. Rybakov, D. Shkatov
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 wh…
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.
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.
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…
Computational complexity of one-variable fragments of products with T
K. Aleksandrov, M. Rybakov, D. Shkatov
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 simpl…