A simple propositional \(\text{S}5\) tableau system (Q1295438)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1308110
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple propositional \(\text{S}5\) tableau system |
scientific article; zbMATH DE number 1308110 |
Statements
A simple propositional \(\text{S}5\) tableau system (English)
0 references
9 November 2001
0 references
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.
0 references
modal logic
0 references
tableau system
0 references
S5
0 references
0.8047555088996887
0 references
0.7735627293586731
0 references
