Generalised sequent calculus for propositional modal logics

The paper contains an exposition of some non standard approach to gentzenization of modal logics. The first section is devoted to short discussion of desirable properties of Gentzen systems and the short review of various sequential systems for modal logics. Two non standard, cut-free sequent systems are then presented, both based on the idea of using special modal sequents, in addition to usual ones. First of them, GSC I is well suited for nonsymmetric modal logics (accessibility relation in their Kripke models is not symmetric) The second one, GSC II is devised specially for symmetric, i.e. Blogics. GSC I and GSC II are not different formalizations, from the theoretical point of view GSC I may be seen as a simplification of the more general approach present in GSC II. They are considered separately, mainly because Blogics demand different, and more complicated, strategy in completeness proof, whereas non symmetric logics are easily and uniformly characterised by means of Fitting's Consistency Properties. The weakest modal logic captured by this formalization is minimal regular logic C, but many stronger logics are obtainable by addition of suitable structural rules, which conforms to Do en's methodology. Both variants of GSC satisfy also other, besides cut-freedom, desirable properties.

[1]  G. Gentzen Untersuchungen über das logische Schließen. I , 1935 .

[2]  R. Feys,et al.  Les systèmes formalisés des modalités aristotéliciennes , 1950 .

[3]  Haskell B. Curry,et al.  The elimination theorem when modality is present , 1952, Journal of Symbolic Logic.

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

[5]  R. L. Goodstein,et al.  Provability in logic , 1959 .

[6]  Haskell B. Curry,et al.  Foundations of Mathematical Logic , 1964 .

[7]  John L. Pollock,et al.  Basic modal logic , 1967, Journal of Symbolic Logic.

[8]  A. Slisenko Studies in constructive mathematics and mathematical logic , 1969 .

[9]  G. Mints,et al.  Cut-Free Calculi of the S5 Type , 1970 .

[10]  Melvin Fitting,et al.  Model existence theorems for modal and intuitionistic logics , 1973, Journal of Symbolic Logic.

[11]  Silvio Valentini,et al.  A modal sequent calculus for a fragment of arithmetic , 1980 .

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

[13]  Silvio Valentini,et al.  The modal logic of provability. The sequential approach , 1982, J. Philos. Log..

[14]  Nuel Belnap,et al.  Display logic , 1982, J. Philos. Log..

[15]  M. Fitting Proof Methods for Modal and Intuitionistic Logics , 1983 .

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

[17]  Arnon Avron,et al.  Simple Consequence Relations , 1988, Inf. Comput..

[18]  Claudio Cerrato,et al.  Modal Sequents for Normal Modal Logics , 1993, Math. Log. Q..

[19]  Heinrich Wansing,et al.  Strong Cut-Elimination for Constant Domain First-Order S5 , 1995, Log. J. IGPL.

[20]  Andrzej Indrzejczak,et al.  Cut-free Double Sequent Calculus for S5 , 1998, Log. J. IGPL.