论文信息 - Strong Cut-Elimination for Constant Domain First-Order S5 - 字舞流文

Strong Cut-Elimination for Constant Domain First-Order S5

We consider a labelled tableau presentation of constant domain rst-order S5 and prove a strong cut-elimination theorem.

Heinrich Wansing | H. Wansing

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

[2] Melvin Fitting,et al. Basic modal logic , 1993 .

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

[4] Saul A. Kripke,et al. Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi , 1963 .

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

[6] Rajeev Goré,et al. Cut-free sequent and tableau systems for propositional Diodorean modal logics , 1994, Stud Logica.

[7] Melvin Fitting,et al. Tableau methods of proof for modal logics , 1972, Notre Dame J. Formal Log..

[8] Heinrich Wansing. Strong Cut-elimination in Display Logic , 1995, Reports Math. Log..

[9] Vaj Tijn Borghuis. Coming to terms with modal logic : on the interpretation of modalities in typed lambda-calculus , 1994 .

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

[11] Wolfgang Rautenberg,et al. Modal tableau calculi and interpolation , 1983, J. Philos. Log..

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

[13] J. Roger Hindley,et al. Introduction to combinators and λ-calculus , 1986, Acta Applicandae Mathematicae.

[14] Dirk Roorda,et al. Resource Logics : Proof-Theoretical Investigations , 1991 .

[15] G. Mints. A Short Introduction to Modal Logic , 1992 .

[16] D. Gabbay. LDS - Labelled Deductive Systems: Volume 1 - Foundations , 1994 .