Complexity and expressivity of propositional dynamic logics with finitely many variables
DOI10.1093/jigpal/jzy014zbMath1492.03013arXiv1901.06407OpenAlexW2806921937WikidataQ129795911 ScholiaQ129795911MaRDI QIDQ5095651
Dmitry Shkatov, Mikhail Rybakov
Publication date: 10 August 2022
Published in: Logic Journal of the IGPL (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.06407
computational complexityundecidabilityfinite-variable fragmentssatisfiabilityexpressivitypropositional dynamic logic
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
This page was built for publication: Complexity and expressivity of propositional dynamic logics with finitely many variables