Abstract

Abstract. In this paper we introduce a cut-elimination procedure for classical logic, which is both strongly normalising and consisting of local proof transformations. Traditional cut-elimination procedures, including the one by Gentzen, are formulated so that they only rewrite neighbouring inference rules; that is they use local proof transformations. Unfortunately, such local proof transformation, if defined naïvely, break the strong normalisation property. Inspired by work of Bloo and Geuvers concerning the λx-calculus, we shall show that a simple trick allows us to preserve this property in our cut-elimination procedure. We shall establish this property using the recursive path ordering by Dershowitz.

Citations

493	Untersuchungen über das logische Schließen - Gentzen - 1935
253	Orderings for term-rewriting systems - Dershowitz - 1982
87	A New Deconstructive Logic: Linear Logic - Danos, Joinet, et al. - 1997
52	Constructive logics part I: A tutorial on proof systems and typed λ-calculi. Theoretical computer science - Gallier - 1993
49	Classical Logic and Computation - Urban - 2000
38	L.: A Permutation-free Sequent Calculus for Intuitionistic Logic - Dyckhoff, Pinto - 1996
33	A λ-calculus structure isomorphic to sequent calculus structure,Computer science logic - Herbelin - 1997
29	Strong normalisation of cut-elimination in classical logic - Urban, Bierman - 1999
28	Explicit substitution: on the edge of strong normalisation - Bloo, Geuvers - 1999
25	Explicit substitution — tutorial & survey - Rose - 1996
13	Typed lambda-calculi with explicit substitutions may not terminate - Mellies - 1995