Algorithmic properties of QK4.3 and QS4.3
M. Rybakov, D. Shkatov
TL;DR
This paper proves that the predicate modal logics QK4.3 and QS4.3 are undecidable when limited to two individual variables, one modal predicate, and one propositional letter.
Contribution
It establishes the undecidability of QK4.3 and QS4.3 under specific language restrictions, advancing understanding of their computational complexity.
Findings
QK4.3 and QS4.3 are undecidable with two variables and minimal predicate and propositional letters.
The proof involves logical reductions demonstrating undecidability.
Results impact the study of modal logic decidability boundaries.
Abstract
We prove that predicate modal logics QK4.3 and QS4.3 are undecidable in languages with two individual variables, one modandic predicate letter, and one proposition letter.
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
TopicsNatural Language Processing Techniques · Logic, Reasoning, and Knowledge · Logic, programming, and type systems