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 general elimination without explicit substitution.
منابع مشابه
Some linear herbrand proof procedures : an analysis
Several Herbrand proof procedures proposed during the 1960 decade are shown to be related in varying degrees. Most of the paper deals with a relationship between s-linear resolution and model elimination. Refinements of each are proposed and the spaces of ground deductions are shown to be isomorphic in a suitable sense. The two refined procedures are then studied at the general level where they...
متن کامل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...
متن کاملCall-by-name reduction and cut-elimination in classical logic
We present a version of Herbelin’s λμ-calculus in the call-byname setting to study the precise correspondence between normalization and cut-elimination in classical logic. Our translation of λμ-terms into a set of terms in the calculus does not involve any administrative redexes, in particular η-expansion on μ-abstraction. The isomorphism preserves β, μ-reduction, which is simulated by a local-...
متن کامل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...
متن کامل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...
متن کامل