A Strong Normalization Result for Classical Logic

Abstract In this paper we give a strong normalization proof for a set of reduction rules for classical logic. These reductions, more general than the ones usually considered in literature, are inspired to the reductions of Felleisen's lambda calculus with continuations.

[1]  Matthias Felleisen,et al.  Reasoning with Continuations , 1986, LICS.

[2]  D. Evelyne.  Thèse de doctorat d'Etat , 1988 .

[3]  Chetan R. Murthy.  Extracting Constructive Content From Classical Proofs , 1990 .

[4]  William W. Tait,et al.  Intensional interpretations of functionals of finite type I , 1967, Journal of Symbolic Logic.

[5]  Matthias Felleisen,et al.  Control operators, the SECD-machine, and the λ-calculus , 1987, Formal Description of Programming Concepts.

[6]  T G Muchnick,et al.  On some extensions of syntactic error recovery technique based on phrase markers , 1986, SIGP.

[7]  Piergiorgio Odifreddi,et al.  Logic and computer science , 1990 .

[8]  Timothy G. Griffin,et al.  A formulae-as-type notion of control , 1989, POPL '90.

[9]  J. Y. Girard,et al.  Interpretation fonctionelle et elimination des coupures dans l'aritmetique d'ordre superieur , 1972 .

[10]  Erich J. Neuhold,et al.  Formal description of programming concepts , 1991 .

[11]  D. Prawitz.  Natural Deduction: A Proof-Theoretical Study , 1965 .

[12]  Matthias Felleisen,et al.  The calculi of lambda-nu-cs conversion: a syntactic theory of control and state in imperative higher-order programming languages , 1987 .

[13]  Georg Kreisel,et al.  Mathematical significance of consistency proofs , 1958, Journal of Symbolic Logic.

[14]  Michel Parigot,et al.  Lambda-Mu-Calculus: An Algorithmic Interpretation of Classical Natural Deduction , 1992, LPAR.

[15]  Stefano Berardi,et al.  Extracting Constructive Content from Classical Logic via Control-like Reductions , 1993, TLCA.

[16]  Harvey M. Friedman,et al.  Classically and intuitionistically provably recursive functions , 1978 .

[17]  J. Girard.  Une Extension De ĽInterpretation De Gödel a ĽAnalyse, Et Son Application a ĽElimination Des Coupures Dans ĽAnalyse Et La Theorie Des Types , 1971 .

[18]  Stefano Berardi,et al.  Witness extraction in classical logic through normalization , 1993 .

[19]  Simon L. Peyton Jones,et al.  Imperative functional programming , 1993, POPL '93.