A proof-theoretic characterization of the basic feasible functional

Theoretical Computer Science

Volumn 329, Issue 1-3, 2004, Pages 159-176

  Strahm, Thomas ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

Applicative theories; Basic feasible functionals; Proof theory; Type two feasibility

Indexed keywords

CHARACTERIZATION; COMBINATORIAL MATHEMATICS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; FUNCTIONS; POLYNOMIALS;

APPLICATIVE THEORIES; BASIC FEASIBLE FUNCTIONALS; PROOF THEORY; TYPE TWO FEASIBILITY;

COMPUTATIONAL COMPLEXITY;

EID: 10044224853     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.08.009     Document Type: Article

References (32)

1. H.P. Barendregt, The Lambda Calculus, revised ed., North-Holland, Amsterdam, 1984.
2. M.J. Beeson, Foundations of Constructive Mathematics: Metamathematical Studies, Springer, Berlin, 1985.
3. M.J. Beeson, Proving programs and programming proofs, in: Barcan Marcus et al. (Eds.), Logic, Methodology, and Philosophy of Science VII, North-Holland, Amsterdam, 1986, pp. 51-82.
4. S. Bellantoni, S. Cook, A new recursion-theoretic characterization of the poly-time functions, Comput. Complexity 2 (1992) 97-110.
5. S. Bellantoni, K.-H. Niggl, H. Schwichtenberg, Higher type recursion ramification and polynomial time, Ann. Pure Appl. Logic 104 (1-3) (2000) 17-30.
6. S.R. Buss, Bounded Arithmetic, Bibliopolis, Napoli, 1986.
7. A. Cantini, Choice and uniformity in weak applicative theories, in: Logic Colloquium 2001, ASL Lecture Notes in Logic, to appear.
8. A. Cantini, Polytime, combinatory logic and positive safe induction, Arch. Math. Logic 41 (2) (2002) 169-189.
9. P. Clote, Computation models and function algebras, in: E. Griffor (Ed.), Handbook of Computability Theory, Elsevier, Amsterdam, 1999, pp. 589-681.
10. S.A. Cook, B.M. Kapron, Characterizations of the basic feasible functionals of finite type, in: S.R. Buss, P.J. Scott (Eds.), Feasible Mathematics, Birkhäuser, Basel, 1990, pp. 71-95.
11. S.A. Cook, A. Urquhart, Functional interpretations of feasibly constructive arithmetic, Ann. Pure Appl. Logic 63 (2) (1993) 103-200.
12. S. Feferman, A language and axioms for explicit mathematics, in: J. Crossley (Ed.), Algebra and Logic, Lecture Notes in Mathematics, Vol. 450, Springer, Berlin, 1975, pp. 87-139.
13. S. Feferman, Constructive theories of functions and classes, in: M. Boffa, D. van Dalen, K. McAloon (Eds.), Logic Colloquium '78, North-Holland, Amsterdam, 1979, pp. 159-224.
14. F. Ferreira, Polynomial Time Computable Arithmetic and Conservative Extensions, Ph.D. Thesis, Pennsylvania State University, 1988.
15. F. Ferreira, Polynomial time computable arithmetic, in: W. Sieg (Ed.), Logic and Computation, Proc. Workshop held at Carnegie Mellon University, 1987, Contemporary Mathematics, Vol. 106, American Mathematical Society, Providence, RI, 1990, pp. 137-156.
16. J.-Y. Girard, Proof Theory and Logical Complexity, Bibliopolis, Napoli, 1987.
17. J.R. Hindley, J.P. Seldin, Introduction to Combinators and λ-Calculus, Cambridge University Press, Cambridge, 1986.
18. M. Hofmann, Type systems for polynomial-time computation, Habilitation Thesis, Darmstadt, 1999, appeared as LFCS Technical Report ECS-LFCS-99-406.
19. R. Irwin, B. Kapron, J. Royer, On characterizations of the basic feasible functionals, Part I, J. Functional Programming 11 (2001) 117-153.
20. B. Kapron, S. Cook, A new characterization of type 2 feasibility, SIAM J. Comput. 25 (1996) 117-132.
21. D. Leivant, A foundational delineation of poly-time, Inform. Comput. 110 (1994) 391-420.
22. D. Leivant, Predicative recurrence in finite type, in: A. Nerode, Y. Matiyasevich (Eds.), Logical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 813, Springer, Berlin, 1994, pp. 227-239.
23. D. Leivant, Ramified recurrence and computational complexity I: Word recurrence and poly-time, in: P. Clote, J. Remmel (Eds.), Feasible Mathematics II, Birkhäuser, 1994, pp. 320-343.
24. D. Leivant, Implicit computational complexity for higher type functionals (Extended abstract), in: J. Bradfield (Ed.), CSL '02, Lecture Notes in Computer Science, Vol. 2471, Springer, Berlin, 2002, pp. 367-381.
25. K. Melhorn, Polynomial and abstract subrecursive classes, J. Comput. System Sci. 12 (1976) 147-178.
26. E. Pezzoli, On the computational complexity of type 2 functionals, in: Computer Science Logic '97, Lecture Notes in Computer Science, Vol. 1414, Springer, Berlin, 1998, pp. 373-388.
27. J. Royer, Semantics vs. syntax vs. computations: machine models for type-2 polynomial-time bounded functionals, J. Comput. System Sci. 54 (1997) 424-436.
28. A. Seth, Complexity Theory of Higher Type Functionals, Ph.D. Thesis, Tata Institute of Fundamental Research, Bombay, 1994.
29. T. Strahm, Proof-theoretic Contributions to Explicit Mathematics, Habilitationsschrift, University of Bern, 2001.
30. T. Strahm, Theories with self-application and computational complexity, Inform. Comput. 185 (2003) 263-297.
31. A. Troelstra, D. van Dalen, Constructivism in Mathematics, Vol. I, North-Holland, Amsterdam, 1988.
32. A. Troelstra, D. van Dalen, Constructivism in Mathematics, Vol. II, North-Holland, Amsterdam, 1988.