Indexed systems of sequents and cut-elimination (Q1372944)
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: Indexed systems of sequents and cut-elimination |
scientific article; zbMATH DE number 1083184
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Indexed systems of sequents and cut-elimination |
scientific article; zbMATH DE number 1083184 |
Statements
Indexed systems of sequents and cut-elimination (English)
0 references
15 April 1998
0 references
The author presents a detailed proof of cut-elimination applied to systems of indexed sequents for all propositional modal logics obtained from the smallest normal modal logic by adding the reflexivity, symmetry and transitivity axioms. Moreover, it is shown how these systems of indexed sequents can be translated into theorem-wise equivalent display sequent calculi as developed by \textit{N. D. Belnap} [see, e.g., Notre Dame J. Formal Logic 31, 14-25 (1990; Zbl 0706.03043); H. Wansing (ed.), Proof theory of modal logic, Proc. Workshop, Hamburg 1993, Appl. Log. Ser. 2, 79-92 (1996; Zbl 0867.03017)].
0 references
indexed tableaux
0 references
display logic
0 references
cut-elimination
0 references
modal logic
0 references
systems of indexed sequents
0 references
0.9106251
0 references
0 references
0.8889878
0 references
0.88535774
0 references
0.8849945
0 references
0.8837166
0 references
0.8786543
0 references
0.87533534
0 references