Library

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.

Logic, Reasoning, and KnowledgeFormal Methods in VerificationLogic, programming, and type systems
Source

Paper

Similar papers

Polytime embedding of intuitionistic modal logics into their one-variable fragmentsMikhail Rybakov, Dmitry Shkatov2024 · Journal of Logic and Computation In Library
Complexity of finite-variable fragments of products with non-transitive modal logicsMikhail Rybakov, Dmitry Shkatov2021 · Journal of Logic and Computation In Library
Fragments of Some Subintuitionistic LogicsFatemeh Maleki, Dick de Jongh2025 · arXiv (Cornell University) In Library
Modelling of logical systems by means of their fragmentsMikhail Nikolayevich Rybakov2025 · arXiv (Cornell University) In Library
Computational complexity of one-variable fragments of products with TK. Aleksandrov, Mikhail Rybakov, Dmitry Shkatov2021 · arXiv (Cornell University) In Library
Monadic Intuitionistic and Modal Logics Admitting Provability InterpretationsGuram Bezhanishvili, Kristina Brantley, Julia Ilin2021 · arXiv (Cornell University) In Library
Modal Logics with Composition on Finite Forests: Expressivity and Complexity (Extra Material)Bartosz Bednarczyk, Stéphane Demri, Raul Fervari et al.2020 · arXiv (Cornell University) In Library
Complexity of finite-variable fragments of products with<b>K</b>Mikhail Rybakov, Dmitry Shkatov2020 · Journal of Logic and Computation In Library
Towards a Model Theory of Ordered Logics: Expressivity and InterpolationBartosz Bednarczyk, Reijo Jaakkola2022 · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) In Library
Algebraic Semantics for a Mixed Type Fragment of IPCEryk Lipka, Katarzyna Słomczyńska2024 · Studia Logica In Library
© 2026 NYSGPT2525 LLC