Sequent systems for Lewis' conditional logics

Björn Lellmann*, Dirk Pattinson

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

18 Citations (Scopus)

Abstract

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 .

Original languageEnglish
Title of host publicationLogics in Artificial Intelligence - 13th European Conference, JELIA 2012, Proceedings
Pages320-332
Number of pages13
DOIs
Publication statusPublished - 2012
Externally publishedYes
Event13th European Conference on Logics in Artificial Intelligence, JELIA 2012 - Toulouse, France
Duration: 26 Sept 201228 Sept 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7519 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th European Conference on Logics in Artificial Intelligence, JELIA 2012
Country/TerritoryFrance
CityToulouse
Period26/09/1228/09/12

Fingerprint

Dive into the research topics of 'Sequent systems for Lewis' conditional logics'. Together they form a unique fingerprint.

Cite this