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
Conditional logics capture default entailment in a modal framework in which non-monotonic implicatio...
C. I. Lewis’ systems were the first axiomatisations of modal logics. However some of those systems a...
We present a sound and strongly complete axiomatization of a reasoning about linear combinations of ...
In this thesis we consider generic tools and techniques for the proof-theoretic investigation of not...
In this paper we present a cut-free sequent calculus, called SeqS, for some standard conditional log...
International audienceWe present the first internal calculi for Lewis' conditional logics characteri...
In this paper we present a cut-free sequent calculus, called SeqS, for some standard conditional log...
International audienceWe present new sequent calculi for Lewis' logics of coun-terfactuals. The calc...
International audienceThe preferential conditional logic $\mathbb{PCL}$, introduced by Burgess, and ...
Abstract. Nested sequent calculi are a useful generalization of ordinary sequent calculi, where sequ...
Nested sequent calculi are a useful generalization of ordinary sequent calculi, where sequents are a...
Lewis’s counterfactual logics are a class of conditional logics that are defined as extensions of cl...
The basic preferential conditional logic PCL, initially proposed by Burgess, finds an interest in th...
n this paper we study the proof theory of C.I. Lewis’ logics of strict conditional S1- S5 and we pr...
International audienceLewis's counterfactual logics are a class of conditional logics that are defin...
Conditional logics capture default entailment in a modal framework in which non-monotonic implicatio...
C. I. Lewis’ systems were the first axiomatisations of modal logics. However some of those systems a...
We present a sound and strongly complete axiomatization of a reasoning about linear combinations of ...
In this thesis we consider generic tools and techniques for the proof-theoretic investigation of not...
In this paper we present a cut-free sequent calculus, called SeqS, for some standard conditional log...
International audienceWe present the first internal calculi for Lewis' conditional logics characteri...
In this paper we present a cut-free sequent calculus, called SeqS, for some standard conditional log...
International audienceWe present new sequent calculi for Lewis' logics of coun-terfactuals. The calc...
International audienceThe preferential conditional logic $\mathbb{PCL}$, introduced by Burgess, and ...
Abstract. Nested sequent calculi are a useful generalization of ordinary sequent calculi, where sequ...
Nested sequent calculi are a useful generalization of ordinary sequent calculi, where sequents are a...
Lewis’s counterfactual logics are a class of conditional logics that are defined as extensions of cl...
The basic preferential conditional logic PCL, initially proposed by Burgess, finds an interest in th...
n this paper we study the proof theory of C.I. Lewis’ logics of strict conditional S1- S5 and we pr...
International audienceLewis's counterfactual logics are a class of conditional logics that are defin...
Conditional logics capture default entailment in a modal framework in which non-monotonic implicatio...
C. I. Lewis’ systems were the first axiomatisations of modal logics. However some of those systems a...
We present a sound and strongly complete axiomatization of a reasoning about linear combinations of ...
DOI
Add to ORKG