29 citations · 109 across the 15 of their papers we have counts for
6 papers · 1 filter
Some prospects for semiproducts and products of modal logics
Valentin Shehtman, Dmitry Shkatov
We consider products and semiproducts of propositional modal logics L with S5 and present new examples of product and semiproduct logics axiomatized in the minimal way and enjoying…
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…
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…
Recursive enumerability and elementary frame definability in predicate modal logic
Mikhail Rybakov, Dmitry Shkatov
We investigate the relationship between recursive enumerability and elementary frame definability in first-order predicate modal logic. On the one hand, it is well-known that every…
Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids
Dmitry Shkatov, C. J. Van Alten
We prove that the universal theory and the quasi-equational theory of bounded residuated distributive lattice-orderegroupoids are both EXPTIME-complete. Similar results areproven f…
Complexity of finite-variable fragments of propositional modal logics of symmetric frames
Mikhail Rybakov, Dmitry Shkatov
While finite-variable fragments of the propositional modal logic S5--complete with respect to reflexive, symmetric and transitive frames--are polynomial-time decidable, the restric…