Complexity of the variable-free fragment of the weak Grzegorczyk logic
Irina Agadzhanian, Mikhail Rybakov
TL;DR
This paper establishes that the variable-free fragments of all logics between K and wGrz are PSPACE-hard, highlighting their computational complexity.
Contribution
It proves PSPACE-hardness for variable-free fragments of a range of modal logics, extending known complexity results.
Findings
Variable-free fragments are PSPACE-hard
Results apply to all logics between K and wGrz
Highlights complexity challenges in modal logic fragments
Abstract
The paper proves PSPACE-hardness of variable-free fragments of all logics between K and wGrz.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · semigroups and automata theory · Logic, Reasoning, and Knowledge