Add to ORKGIt is shown how the sequent calculus LJ can be embedded into a simple extension of the -calculus by generalized applications, called J. The reduction rules of cut elimination and normalization can be precisely correlated, if explicit substitutions are added to J. The resulting system J2 is proved strongly normalizing, thus showing strong normalization for Gentzen's cut elimination steps. This re nes previous results by Zucker, Pottinger and Herbelin on the isomorphism between natural deduction and sequent calculus
Abstract. In this paper a strongly normalising cut-elimination procedure is presented for classical ...
In the context of intuitionistic implicational logic, we achieve a perfect correspondence (technical...
At the heart of the connections between Proof Theory and Type Theory, the Curry-Howard correspondenc...
Abstract. It is shown how the sequent calculus LJ can be embedded into a simple extension of the λ-c...
Abstract. A proof theoretical analysis suggests that the process of cut elimination in a sequent cal...
A proof theoretical analysis suggests that the process of cut elimination in a sequent calculus corr...
We define an equivalent variant $LK_{sp}$ of the Gentzen sequent calculus $LK$. In $LK_{sp}$ weakeni...
Date of Acceptance: 01/2015We present a proof (of the main parts of which there is a formal version,...
When defined with general elimination/application rules, natural deduction and $\lambda$-calculus b...
Cut-free proofs in Herbelin's sequent calculus are in 1-1 correspondence with normal natural deducti...
Abstract. In this paper we investigate, for intuitionistic implicational logic, the relationship bet...
AbstractWe present a typed pattern calculus with explicit pattern matching and explicit substitution...
AbstractWe present a typed calculus λξ isomorphic to the implicational fragment of the classical seq...
Abstract. In this paper we introduce a cut-elimination procedure for classical logic, which is both ...
Abstract In this paper, we provide a general setting under which results of normalization of proof t...
Abstract. In this paper a strongly normalising cut-elimination procedure is presented for classical ...
In the context of intuitionistic implicational logic, we achieve a perfect correspondence (technical...
At the heart of the connections between Proof Theory and Type Theory, the Curry-Howard correspondenc...
Abstract. It is shown how the sequent calculus LJ can be embedded into a simple extension of the λ-c...
Abstract. A proof theoretical analysis suggests that the process of cut elimination in a sequent cal...
A proof theoretical analysis suggests that the process of cut elimination in a sequent calculus corr...
We define an equivalent variant $LK_{sp}$ of the Gentzen sequent calculus $LK$. In $LK_{sp}$ weakeni...
Date of Acceptance: 01/2015We present a proof (of the main parts of which there is a formal version,...
When defined with general elimination/application rules, natural deduction and $\lambda$-calculus b...
Cut-free proofs in Herbelin's sequent calculus are in 1-1 correspondence with normal natural deducti...
Abstract. In this paper we investigate, for intuitionistic implicational logic, the relationship bet...
AbstractWe present a typed pattern calculus with explicit pattern matching and explicit substitution...
AbstractWe present a typed calculus λξ isomorphic to the implicational fragment of the classical seq...
Abstract. In this paper we introduce a cut-elimination procedure for classical logic, which is both ...
Abstract In this paper, we provide a general setting under which results of normalization of proof t...
Abstract. In this paper a strongly normalising cut-elimination procedure is presented for classical ...
In the context of intuitionistic implicational logic, we achieve a perfect correspondence (technical...
At the heart of the connections between Proof Theory and Type Theory, the Curry-Howard correspondenc...