Functional Interpretations of Feasibly Constructive Arithmetic

Abstract A notion of feasible function of finite type based on the typed lambda calculus is introduced which generalizes the familiar type 1 polynomial-time functions. An intuitionistic theory IPVω is presented for reasoning about these functions. Interpretations for IPVω are developed both in the style of Kreisel's modified realizability and Godel's Dialectica interpretation. Applications include alternative proofs for Buss's results concerning the classical first-order system S12 and its intuitionistic counterpart IS12 as well as proofs of some of Buss's conjectures concerning IS12, and a proof that IS12 cannot prove that extended Frege systems are not polynomially bounded.

[1]  Stephen A. Cook,et al.  Computability and Complexity of Higher Type Functions , 1992 .

[2]  S. Buss.  On Model Theory for Intuitionistic Bounded Arithmetic with Applications to Independence Results , 1990 .

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

[4]  Toniann Pitassi,et al.  A Feasibly Constructive Lower Bound for Resolution Proofs , 1990, Inf. Process. Lett..

[5]  S. Cook.  Computational complexity of higher type functions , 1990 .

[6]  V. Sazonov,et al.  An Equivalence between Polynomial Constructivity of Markov’s Principle and the Equality P=NP , 1990 .

[7]  Victor Harnik.  Provably Total Functions of Intuitionistic Bounded Arithmetic , 1992, J. Symb. Log..

[8]  Stephen Cook,et al.  Corrections for "On the lengths of proofs in the propositional calculus preliminary version" , 1974, SIGA.

[9]  A. Troelstra.  Metamathematical investigation of intuitionistic arithmetic and analysis , 1973 .

[10]  Richard Statman,et al.  The Typed lambda-Calculus is not Elementary Recursive , 1979, Theor. Comput. Sci..

[11]  Jan Krajícek,et al.  Propositional proof systems, the consistency of first order theories and the complexity of computations , 1989, Journal of Symbolic Logic.

[12]  Kurt Gödel,et al.  On a hitherto unexploited extension of the finitary standpoint , 1980, J. Philos. Log..

[13]  Von Kurt Gödel,et al.  ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES , 1958 .

[14]  Errett Bishop,et al.  Mathematics as a Numerical Language , 1970 .

[15]  Daniel Leivant,et al.  Syntactic translations and provably recursive functions , 1985, Journal of Symbolic Logic.

[16]  Yehoshua Bar-Hillel,et al.  The Intrinsic Computational Difficulty of Functions , 1969 .

[17]  Samuel R. Buss,et al.  The Polynomial Hierarchy and Intuitionistic Bounded Arithmetic , 1986, SCT.

[18]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

[19]  R. Smullyan.  Theory of formal systems , 1962 .

[20]  Stephen A. Cook,et al.  Functional interpretations of feasibly constructive arithmetic , 1989, STOC '89.

[21]  Samuel R. Buss.  A note on bootstrapping intuitionistic bounded arithmetic , 1993 .

[22]  Stephen A. Cook,et al.  The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.

[23]  Peter Clote,et al.  Exponential Time and Bounded Arithmetic , 1986, SCT.