AbstractWe present new variants of known proofs of cut elimination for intuitionistic and classical sequent calculi. In both cases the proofs proceed by three nested structural inductions, avoiding the explicit use of multi-sets and termination measures on sequent derivations. This makes them amenable to elegant and concise representations in LF, which are given in full detail
AbstractAlgebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are ...
Besides the cut rule, Gentzen’s sequent calculus LJ for propositional intuitionistic logic contains ...
International audienceWe present two proof systems for implication-only intuitionistic logic in the ...
We present a new proof of cut elimination for linear logic which proceeds by three nested structural...
We present a new proof of cut elimination for linear logic which proceeds by three nested structural...
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...
AbstractAlgebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are ...
Algebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are presente...
Algebraic proofs of the cut-elimination theorems for classical and intu-itionistic logic are present...
AbstractIn this paper we give a new proof of cut elimination in Gentzen's sequent system for intuiti...
. We describe a sequent calculus, based on work of Herbelin, of which the cut-free derivations are i...
We describe in full detail a solution to the problem of proving the cut elimination theorem for FILL...
Abstract. In this paper we investigate, for intuitionistic implicational logic, the relationship bet...
We show that the SN and CR cut-elimination procedure on Gentzen-style classical logic LKT/LKQ, as pr...
AbstractAlgebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are ...
Besides the cut rule, Gentzen’s sequent calculus LJ for propositional intuitionistic logic contains ...
International audienceWe present two proof systems for implication-only intuitionistic logic in the ...
We present a new proof of cut elimination for linear logic which proceeds by three nested structural...
We present a new proof of cut elimination for linear logic which proceeds by three nested structural...
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...
AbstractAlgebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are ...
Algebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are presente...
Algebraic proofs of the cut-elimination theorems for classical and intu-itionistic logic are present...
AbstractIn this paper we give a new proof of cut elimination in Gentzen's sequent system for intuiti...
. We describe a sequent calculus, based on work of Herbelin, of which the cut-free derivations are i...
We describe in full detail a solution to the problem of proving the cut elimination theorem for FILL...
Abstract. In this paper we investigate, for intuitionistic implicational logic, the relationship bet...
We show that the SN and CR cut-elimination procedure on Gentzen-style classical logic LKT/LKQ, as pr...
AbstractAlgebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are ...
Besides the cut rule, Gentzen’s sequent calculus LJ for propositional intuitionistic logic contains ...
International audienceWe present two proof systems for implication-only intuitionistic logic in the ...
DOI
Add to ORKG