Add to ORKGIn this paper we present a cut-free sequent calculus, called SeqS, for some standard conditional logics, namely CK, CK+ID, CK+MP and CK+MP+ID. The calculus uses labels and transition formulas and can be used to prove decidability and space complexity bounds for the respective logics. We also present CondLean, a theorem prover for these logics implementing SeqS calculi written in SICStus Prolog
Contains a version of the author's PhD dissertation and focuses on proof methods and theorem proving...
PreprintIn this paper, we present a propositional sequent calculus containing disjoint copies of cla...
This Ph.D. thesis addresses the problem of giving computational interpretation to proofs in classica...
In this paper we present a cut-free sequent calculus, called SeqS, for some standard conditional log...
In this paper we present a cut-free sequent calculus, called SeqS, for some standard conditional log...
In this thesis we consider generic tools and techniques for the proof-theoretic investigation of not...
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...
Abstract. In this paper we focus on proof methods for conditional logics. We present US’, a goal-dir...
We present unlabelled cut-free sequent calculi for Lewis' conditional logic and extensions, in both ...
AbstractSufficient conditions for first-order-based sequent calculi to admit cut elimination by a Sc...
Sufficient conditions for first order based sequent calculi to admit cut elimination by a Schütte-Ta...
International audienceWe present new sequent calculi for Lewis' logics of coun-terfactuals. The calc...
1 Introduction Sequent calculi provide a rigorous basis for meta-theoretic studies of logics. The ce...
Gentzen's sequent calculi LK and LJ are landmark proof systems. They identify the structural rules o...
Contains a version of the author's PhD dissertation and focuses on proof methods and theorem proving...
PreprintIn this paper, we present a propositional sequent calculus containing disjoint copies of cla...
This Ph.D. thesis addresses the problem of giving computational interpretation to proofs in classica...
In this paper we present a cut-free sequent calculus, called SeqS, for some standard conditional log...
In this paper we present a cut-free sequent calculus, called SeqS, for some standard conditional log...
In this thesis we consider generic tools and techniques for the proof-theoretic investigation of not...
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...
Abstract. In this paper we focus on proof methods for conditional logics. We present US’, a goal-dir...
We present unlabelled cut-free sequent calculi for Lewis' conditional logic and extensions, in both ...
AbstractSufficient conditions for first-order-based sequent calculi to admit cut elimination by a Sc...
Sufficient conditions for first order based sequent calculi to admit cut elimination by a Schütte-Ta...
International audienceWe present new sequent calculi for Lewis' logics of coun-terfactuals. The calc...
1 Introduction Sequent calculi provide a rigorous basis for meta-theoretic studies of logics. The ce...
Gentzen's sequent calculi LK and LJ are landmark proof systems. They identify the structural rules o...
Contains a version of the author's PhD dissertation and focuses on proof methods and theorem proving...
PreprintIn this paper, we present a propositional sequent calculus containing disjoint copies of cla...
This Ph.D. thesis addresses the problem of giving computational interpretation to proofs in classica...