Proof Analysis in Modal Logic

Journal of Philosophical Logic 34 (5-6):507-544 (2005)
  Copy   BIBTEX

Abstract

A general method for generating contraction- and cut-free sequent calculi for a large family of normal modal logics is presented. The method covers all modal logics characterized by Kripke frames determined by universal or geometric properties and it can be extended to treat also Gödel-Löb provability logic. The calculi provide direct decision methods through terminating proof search. Syntactic proofs of modal undefinability results are obtained in the form of conservativity theorems.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 99,596

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
152 (#145,975)

6 months
6 (#747,634)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

Modal Logic: Graph. Darst.Patrick Blackburn, Maarten de Rijke & Yde Venema - 2001 - New York: Cambridge University Press. Edited by Maarten de Rijke & Yde Venema.
Basic proof theory.A. S. Troelstra - 2000 - New York: Cambridge University Press. Edited by Helmut Schwichtenberg.
Structural Proof Theory.Sara Negri, Jan von Plato & Aarne Ranta - 2001 - New York: Cambridge University Press. Edited by Jan Von Plato.
Provability in logic.Stig Kanger - 1957 - Stockholm,: Almqvist & Wiksell.
Cut Elimination in the Presence of Axioms.Sara Negri & Jan Von Plato - 1998 - Bulletin of Symbolic Logic 4 (4):418-435.

View all 22 references / Add more references