A simple propositional S5 tableau system
From MaRDI portal
Publication:1295438
The paper presents a `remarkably simple' tableau system for the modal logic S5 and proves it soundness and weak completeness. The latter means that it captures S5-validity but not logical consequence. Using this tableau system, it is easy to understand why satisfiability in S5 is NP-complete. Also the author hopes that a similar system for first-order S5 could be constructed.
Recommendations
Cites work
Cited in
(11)- Efficient SAT-based minimal model generation methods for modal logic S5
- Dugundji's theorem revisited
- A deep inference system for the modal logic S5
- Modal logic S5 in answer set programming with lazy creation of worlds
- scientific article; zbMATH DE number 94918 (Why is no real title available?)
- Tautology elimination, cut elimination, and S5
- A simple tableau system for the logic of elsewhere
- scientific article; zbMATH DE number 4116497 (Why is no real title available?)
- Modal logic S5 satisfiability in answer set programming
- A simple embedding of T into double S5
- Realizations and LP
This page was built for publication: A simple propositional \(\text{S}5\) tableau system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1295438)