论文信息 - A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5

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 syntactic way.

Francesca Poggiolesi | F. Poggiolesi

[1] Kosta Dosen,et al. Sequent-systems for modal logic , 1985, Journal of Symbolic Logic.

[2] Torben Braüner,et al. A Cut-Free Gentzen Formulation of the Modal Logic S5 , 2000, Log. J. IGPL.

[3] Sara Negri,et al. Proof Analysis in Modal Logic , 2005, J. Philos. Log..

[4] A. Avron. The method of hypersequents in the proof theory of propositional non-classical logics , 1996 .

[5] Kazuo Matsumoto,et al. Gentzen method in modal calculi. II , 1957 .

[6] Kai Brünnler,et al. Deep sequent systems for modal logic , 2009, Arch. Math. Log..

[7] Andrzej Indrzejczak. Generalised sequent calculus for propositional modal logics , 1997 .

[8] Andrzej Indrzejczak,et al. SEQUENT CALCULI FOR MONOTONIC MODAL LOGICS , 2005 .

[9] Claudio Cerrato. Cut-free modal sequents for normal modal logics , 1993, Notre Dame J. Formal Log..

[10] Heinrich Wansing,et al. Sequent Calculi for Normal Modal Proposisional Logics , 1994, J. Log. Comput..

[11] S. Blamey,et al. A Perspective on Modal Sequent Logic , 1991 .

[12] Grigori Mints,et al. Indexed systems of sequents and cut-elimination , 1997, J. Philos. Log..

[13] 京都大学数理解析研究所,et al. Publications of the Research Institute for Mathematical Sciences , 1965 .

[14] Masahiko Sato. A Cut-Free Gentzen-Type System for the Modal Logic S5 , 1980, J. Symb. Log..