A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5
In this paper, we present a simple sequent calculus for the modal propositional logic S5. We prove that this sequent calculus is theoremwise equivalent to the Hilbert-style system S5, that it is contraction-free and cut-free, and finally that it is decidable. All results are proved in a purely synta...
Gespeichert in:
Veröffentlicht in: | The review of symbolic logic 2008-06, Vol.1 (1), p.3-15 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this paper, we present a simple sequent calculus for the modal propositional logic S5. We prove that this sequent calculus is theoremwise equivalent to the Hilbert-style system S5, that it is contraction-free and cut-free, and finally that it is decidable. All results are proved in a purely syntactic way. |
---|---|
ISSN: | 1755-0203 1755-0211 |
DOI: | 10.1017/S1755020308080040 |