Logics in Artificial Intelligence pp 320-332
Sequent Systems for Lewis’ Conditional Logics
- Cite this paper as:
- Lellmann B., Pattinson D. (2012) Sequent Systems for Lewis’ Conditional Logics. In: del Cerro L.F., Herzig A., Mengin J. (eds) Logics in Artificial Intelligence. Lecture Notes in Computer Science, vol 7519. Springer, Berlin, Heidelberg
We present unlabelled cut-free sequent calculi for Lewis’ conditional logic \(\mathbb V\) 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 \(\mathbb V\).
Unable to display preview. Download preview PDF.