Cut-free systems for three-valued modal logics (Q1203764)
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: Cut-free systems for three-valued modal logics |
scientific article; zbMATH DE number 120371
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cut-free systems for three-valued modal logics |
scientific article; zbMATH DE number 120371 |
Statements
Cut-free systems for three-valued modal logics (English)
0 references
22 February 1993
0 references
\textit{O. Morikawa} introduced [ibid. 30, 130-137 (1989; Zbl 0665.03013)] (the three-valued version of) the sequent calculi for the three-valued modal propositional logics 3-K\(_ 3\), 3-K\(_ 2\), 3-M\(_ 3\), 3-M\(_ 2\), 3-S4\(_ 3\), 3-S4\(_ 2\), 3-S5\(_ 3\), and 3-S5\(_ 2\). But, as he showed, none of them enjoys the cut-elimination property. So we formulate, in this paper, other sequent calculi (for those logics) which admit elimination of cuts.
0 references
sequent calculi
0 references
cut-elimination
0 references
0 references
0.89391875
0 references
0.8860613
0 references
0.88376766
0 references
0.88320494
0 references
0.88254535
0 references
0.88122565
0 references