Correcting the tableau procedure for S4 (Q761443)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Correcting the tableau procedure for S4 |
scientific article; zbMATH DE number 3885868
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Correcting the tableau procedure for S4 |
scientific article; zbMATH DE number 3885868 |
Statements
Correcting the tableau procedure for S4 (English)
0 references
1984
0 references
The tableau procedure for normal modal logic is given by Kripke's semantics. S4, which defines the accessibility relation as reflexive and transitive, raises a special problem (infinite tree and then blocked tree). In this paper, the author attempts to correct shortcomings in this procedure. A modified restriction on blockade and equivalence class membership is stated.
0 references
possible world
0 references
tableau procedure
0 references
normal modal logic
0 references
S4
0 references
accessibility
0 references
blocked tree
0 references
0.7854940295219421
0 references
0.7728331685066223
0 references
0.7647304534912109
0 references
0.7613580226898193
0 references
