Normalization as a Consequence of Cut Elimination
نویسندگان
چکیده
Pairs of systems, which consist of a system of sequents and a natural deduction system for some part of intuitionistic logic, are considered. For each of these pairs of systems the property that the normalization theorem is a consequence of the cut-elimination theorem is presented.
منابع مشابه
The Normalization Theorem for Extended Natural Deduction
The normalization theorem for the system of extended natural deduction will be proved as a consequence of the cut-elimination theorem, by using the connections between the system of extended natural deduction and a standard system of sequents.
متن کاملClassical Proofs as Programs, Cut Elimination as Computation
We show that the SN and CR cut-elimination procedure on Gentzen-style classical logic LKT/LKQ, as presented in Danos et al.(1994), is isomorphic to call-by-name (CBN) and call-by-value (CBV) reduction system respectively. Our method is simple. We assign typed -terms on intuitionistic decoration of LKT/LKQ so as to simulate the cut-elimination procedure by -contraction | i.e. we simulate cutelim...
متن کاملPattern Matching as Cut Elimination
We present a typed pattern calculus with explicit pattern matching and explicit substitutions, where both the typing rules and the reduction rules are modeled on the same logical proof system, namely Gentzen sequent calculus for minimal logic. Our calculus is inspired by the Curry-Howard Isomorphism, in the sense that types, both for patterns and terms, correspond to propositions, terms corresp...
متن کاملOn a Local-Step Cut-Elimination Procedure for the Intuitionistic Sequent Calculus
In this paper we investigate, for intuitionistic implicational logic, the relationship between normalization in natural deduction and cut-elimination in a standard sequent calculus. First we identify a subset of proofs in the sequent calculus that correspond to proofs in natural deduction. Then we define a reduction relation on those proofs that exactly corresponds to normalization in natural d...
متن کاملAn Isomorphism Between Cut-Elimination Procedure and Proof Reduction
This paper introduces a cut-elimination procedure of the intuitionistic sequent calculus and shows that it is isomorphic to the proof reduction of the intuitionistic natural deduction with general elimination and explicit substitution. It also proves strong normalization and Church-Rosser property of the cut-elimination procedure by projecting the sequent calculus to the natural deduction with ...
متن کامل