Skip navigation
Skip navigation

Sequent systems for Lewis' conditional logics

Lellmann, Bjorn; Pattinson, Dirk


We present unlabelled cut-free sequent calculi for Lewis' conditional logic and extensions, in both the languages with the entrenchment connective and the strong conditional. The calculi give rise to Pspace-decision procedures, also in the language with the weak conditional. Furthermore, they are used to prove the Craig interpolation property for all the logics under consideration, and yield a Pspace-decision procedure for a recently considered hybrid version of .

CollectionsANU Research Publications
Date published: 2012
Type: Conference paper
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI: 10.1007/978-3-642-33353-8_25


File Description SizeFormat Image
01_Lellmann_Sequent_systems_for_Lewis'_2012.pdf265.98 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator