Complexity of finite-variable fragments of propositional modal logics of symmetric frames

DOI10.1093/jigpal/jzy018zbMath1494.03053arXiv1910.02257OpenAlexW3102047415WikidataQ129597966 ScholiaQ129597966MaRDI QIDQ5241916

Mikhail Rybakov, Dmitry Shkatov

Publication date: 4 November 2019

Published in: Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.02257

zbMATH Keywords

computational complexityfinite-variable fragmentspropositional modal logicsymmetric frames

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

Undecidability of QLTL and QCTL with two variables and one monadic predicate letter ⋮ Complexity of finite-variable fragments of propositional temporal and modal logics of computation ⋮ Computational complexity of the word problem in modal and Heyting algebras with a small number of generators ⋮ Unnamed Item ⋮ Computational complexity for bounded distributive lattices with negation ⋮ Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter

This page was built for publication: Complexity of finite-variable fragments of propositional modal logics of symmetric frames