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

Authors
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.
Keywords Philosophy
Categories (categorize this paper)
DOI 10.1007/s10992-005-2267-3
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 69,979
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Basic Proof Theory.A. S. Troelstra - 2000 - Cambridge University Press.
Structural Proof Theory.Sara Negri, Jan von Plato & Aarne Ranta - 2001 - Cambridge University Press.
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

Citations of this work BETA

Proof Analysis in Intermediate Logics.Roy Dyckhoff & Sara Negri - 2012 - Archive for Mathematical Logic 51 (1-2):71-92.
Shifting Priorities: Simple Representations for Twenty-Seven Iterated Theory Change Operators.Hans Rott - 2006 - In David Makinson, Jacek Malinowski & Heinrich Wansing (eds.), Towards Mathematical Philosophy. Dordrecht: Springer. pp. 269–296.
From Display to Labelled Proofs for Tense Logics.Agata Ciabattoni, Tim Lyon & Revantha Ramanayake - 2018 - In Anil Nerode & Sergei Artemov (eds.), Logical Foundations of Computer Science. Springer International Publishing. pp. 120 - 139.

View all 83 citations / Add more citations

Similar books and articles

The Unprovability of Consistency: An Essay in Modal Logic.George Boolos - 1979 - Cambridge, England: Cambridge University Press.
Proof Theory for Modal Logic.Sara Negri - 2011 - Philosophy Compass 6 (8):523-538.
Proof Theory of Modal Logic.Heinrich Wansing (ed.) - 1996 - Dordrecht, Netherland: Kluwer Academic Publishers.
Proof Analysis in Intermediate Logics.Roy Dyckhoff & Sara Negri - 2012 - Archive for Mathematical Logic 51 (1-2):71-92.
Lower Bounds for Modal Logics.Pavel Hrubeš - 2007 - Journal of Symbolic Logic 72 (3):941 - 958.
Modal Hybrid Logic.Andrzej Indrzejczak - 2007 - Logic and Logical Philosophy 16 (2-3):147-257.
Propositional Abduction in Modal Logic.Marta Cialdea Mayer & Fiora Pirri - 1995 - Logic Journal of the IGPL 3 (6):907-919.
Proof Analysis: A Contribution to Hilbert's Last Problem.Sara Negri & Jan von Plato - 2011 - Cambridge and New York: Cambridge University Press.

Analytics

Added to PP index
2009-01-28

Total views
111 ( #105,333 of 2,505,139 )

Recent downloads (6 months)
2 ( #277,142 of 2,505,139 )

How can I increase my downloads?

Downloads

My notes