Sequent systems for Lewis' conditional logics
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 .
|Collections||ANU Research Publications|
|Source:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|01_Lellmann_Sequent_systems_for_Lewis'_2012.pdf||265.98 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.