Sequent Systems for Lewis’ Conditional Logics

  • Björn Lellmann
  • Dirk Pattinson
Conference paper

DOI: 10.1007/978-3-642-33353-8_25

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7519)
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

Abstract

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\).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Björn Lellmann
    • 1
  • Dirk Pattinson
    • 1
  1. 1.Department of ComputingImperial College LondonUK

Personalised recommendations