Add to ORKGDragalin in his book on Mathematical Intuitionism has given an outline proof of the admissibility of Contraction and Cut for the multi-succedent intuitionistic sequent calculus. One can give a corresponding (but simpler) proof for the single-succedent calculus. These proofs are given here in detail as a basis for extension and modi cation elsewhere.
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the dept...
We develop a general criterion for cut elimination in sequent calculi forpropositional modal logics,...
Whilst results from Structural Proof Theory can be couched in many formalisms, it is the sequent cal...
We give a direct proof of admissibility of cut and contraction for the contraction-free sequent calc...
Sufficient conditions for first order based sequent calculi to admit cut elimination by a Schütte-Ta...
AbstractSufficient conditions for first-order-based sequent calculi to admit cut elimination by a Sc...
AbstractWe present new variants of known proofs of cut elimination for intuitionistic and classical ...
I give a proof of the cut-elimination theorem (Gentzen's Hauptsatz ) for an intuitionistic multi-suc...
Using labelled formulae, a cut-free sequent calculus for intuitionistic propositional logic is prese...
Using labelled formulae, a cut-free sequent calculus for intuitionistic propositional logic is prese...
Besides the cut rule, Gentzen’s sequent calculus LJ for propositional intuitionistic logic contains ...
. We describe a sequent calculus, based on work of Herbelin, of which the cut-free derivations are i...
This paper provides a study of sequent calculi for intuitionistic Gödel-Löb logic (iGL), which is th...
. We describe a sequent calculus MJ, based on work of Herbelin, of which the cutfree derivations are...
This paper presents sequent calculi in which proof search is terminating for two intuitionistic moda...
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the dept...
We develop a general criterion for cut elimination in sequent calculi forpropositional modal logics,...
Whilst results from Structural Proof Theory can be couched in many formalisms, it is the sequent cal...
We give a direct proof of admissibility of cut and contraction for the contraction-free sequent calc...
Sufficient conditions for first order based sequent calculi to admit cut elimination by a Schütte-Ta...
AbstractSufficient conditions for first-order-based sequent calculi to admit cut elimination by a Sc...
AbstractWe present new variants of known proofs of cut elimination for intuitionistic and classical ...
I give a proof of the cut-elimination theorem (Gentzen's Hauptsatz ) for an intuitionistic multi-suc...
Using labelled formulae, a cut-free sequent calculus for intuitionistic propositional logic is prese...
Using labelled formulae, a cut-free sequent calculus for intuitionistic propositional logic is prese...
Besides the cut rule, Gentzen’s sequent calculus LJ for propositional intuitionistic logic contains ...
. We describe a sequent calculus, based on work of Herbelin, of which the cut-free derivations are i...
This paper provides a study of sequent calculi for intuitionistic Gödel-Löb logic (iGL), which is th...
. We describe a sequent calculus MJ, based on work of Herbelin, of which the cutfree derivations are...
This paper presents sequent calculi in which proof search is terminating for two intuitionistic moda...
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the dept...
We develop a general criterion for cut elimination in sequent calculi forpropositional modal logics,...
Whilst results from Structural Proof Theory can be couched in many formalisms, it is the sequent cal...