Theories with self-application and computational complexity

Information and Computation

Volumn 185, Issue 2, 2003, Pages 263-297

  Strahm, Thomas ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

Bounded applicative theories; Bounded arithmetic; Explicit mathematics; Feasible functionals

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; DIGITAL ARITHMETIC; FUNCTIONS; OBJECT ORIENTED PROGRAMMING; POLYNOMIALS;

BOUNDED APPLICATIVE THEORIES; BOUNDED ARITHMETIC; EXPLICIT MATHEMATICS; FEASIBLE FUNCTIONALS;

THEOREM PROVING;

EID: 0041693849     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00086-5     Document Type: Article

References (71)

1. H.P. Barendregt, The Lambda Calculus, revised ed., North-Holland, Amsterdam, 1984.
2. A. Beckmann, Separating fragments of bounded arithmetic, Ph.D. thesis, Universität Münster, 1996.
3. M.J. Beeson, Foundations of Constructive Mathematics: Metamathematical Studies, Springer, Berlin, 1985.
4. M.J. Beeson, Proving programs and programming proofs, in: B. Marcus (Ed.), et al., Logic, Methodology and Philosophy of Science VII, North-Holland, Amsterdam, 1986, pp. 51-82.
5. S. Bellantoni, K.-H. Niggl, H. Schwichtenberg, Higher type recursion, ramification and polynomial time, Annals of Pure and Applied Logic 104 (1-3) (2000) 17-30.
6. S. Bellantoni, S. Cook, A new recursion-theoretic characterization of the poly-time functions, Computational Complexity 2 (1992) 97-110.
7. W. Buchholz, W. Sieg, A note on polynomial time computable arithmetic, in: W. Sieg (Ed.), Logic and Computation, Proceedings of a Workshop held at Carnegie Mellon University, 1987, Contemporary Mathematics, vol. 106, American Mathematical Society, Providence, Rhode Island, 1990, pp. 51-55.
8. S.R. Buss, Axiomatizations and conservation results for fragments of bounded arithmetic, in: W. Sieg (Ed.), Logic and Computation, Proceedings of a Workshop held at Carnegie Mellon University, 1987, Contemporary Mathematics, vol. 106, American Mathematical Society, Providence, Rhode Island, 1990, pp. 57-84.
9. S.R. Buss, Bounded Arithmetic, Bibliopolis, Napoli, 1986.
10. S.R. Buss, First-order proof theory of arithmetic, in: S.R. Buss (Ed.), Handbook of Proof Theory, Elsevier, 1998, pp. 79-147.
11. S.R. Buss, The witness function method and fragments of Peano arithmetic, in: D. Prawitz, B. Skyrms, D. Westerdåhl (Eds.), Proceedings of the Ninth International Congress on Logic, Methodology and Philosophy of Science, Uppsala, Sweden, August 7-14, 1991, Elsevier, North Holland, Amsterdam, 1994, pp. 29-68.
12. A. Cantini, Characterizing poly-time with an intuitionistic theory based on combinatory logic and safe induction, Preprint, Firenze, 1999, 14 pp.
13. A. Cantini, Choice and uniformity in weak applicative theories, invited talk, Logic Colloquium 2001, 31 pp (submitted for publication).
14. A. Cantini, Feasible operations and applicative theories based on λη, Mathematical Logic Quarterly 46 (3) (2000) 291-312.
15. A. Cantini, Logical Frameworks for Truth and Abstraction, North-Holland, Amsterdam, 1996.
16. A. Cantini, On the computational content of theories of operations with total application, handwritten notes, June 1995.
17. A. Cantini, Polytime, combinatory logic and positive safe induction, Archive for Mathematical Logic 41 (2) (2002) 169-189.
18. A. Cantini, Proof-theoretic aspects of self-referential truth, in: M.L. Dalla Chiara (Ed.), et al., Tenth International Congress of Logic, Methodology and Philosophy of Science, Florence, August 1995, vol. 1, Kluwer Academic Publishers, Dordrecht, 1997, pp. 7-27.
19. P. Clote, Computation models and function algebras, in: E. Griffor (Ed.), Handbook of Computability Theory, Elsevier, Amsterdam, 1999, pp. 589-681.
20. A. Cobham, The intrinsic computational difficulty of functions, Logic, Methodology and Philosophy of Science II, North Holland, Amsterdam, 1965, pp. 24-30.
21. S.A. Cook, A. Urquhart, Functional interpretations of feasibly constructive arithmetic, Annals of Pure and Applied Logic 63 (2) (1993) 103-200.
22. 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.
23. S.A. Cook, Feasibility constructive proofs and the propositional calculus, Proceedings of the Seventh ACM Symposium on the Theory of Computing, Association for Computing Machinery, New York, 1975, pp. 83-97.
24. 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.
25. 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.
26. S. Feferman, G. Jäger, Systems of explicit mathematics with non-constructive μ-operator. Part I, Annals of Pure and Applied Logic 65 (3) (1993) 243-263.
27. S. Feferman, G. Jäger, Systems of explicit mathematics with non-constructive μ-operator. Part II, Annals of Pure and Applied Logic 79 (1) (1996) 37-52.
28. S. Feferman, Logics for termination and correctness of functional programs, in: Y.N. Moschovakis (Ed.), Logic from Computer Science, MSRI Publications, vol. 21, Springer, Berlin, 1991, pp. 95-127.
29. S. Feferman, Logics for termination and correctness of functional programs II: Logics of strength PRA, in: P. Aczel, H. Simmons, S.S. Wainer (Eds.), Proof Theory, Cambridge University Press, Cambridge, 1992, pp. 195-225.
30. S. Feferman, Polymorphic type lambda-calculi in a type-free axiomatic framework, in: W. Sieg (Ed.), Logic and Computation, Contemporary Mathematics, vol. 106, American Mathematical Society, Providence, Rhode Island, 1990, pp. 101-136.
31. S. Feferman, Recursion theory and set theory: a marriage of convenience, in: J.E. Fenstad, R.O. Gandy, G.E. Sacks (Eds.), Generalized Recursion Theory II, Oslo 1977, Stud. Logic Found. Math, vol. 94, North-Holland, Amsterdam, 1978, pp. 55-98.
32. F. Ferreira, Polynomial time computable arithmetic and conservative extensions, Ph.D. thesis, Pennsylvania State University, 1988.
33. F. Ferreira, Polynomial time computable arithmetic, in: W. Sieg (Ed.), Logic and Computation, Proceedings of a Workshop held at Carnegie Mellon University, 1987, Contemporary Mathematics, vol. 106, American Mathematical Society, Providence, Rhode Island, 1990, pp. 137-156.
34. F. Ferreira, Stockmeyer induction, in: S. Buss, P. Scott (Eds.), Feasible Mathematics, Birkhäuser, Basel, 1990, pp. 161-180.
35. J.-Y. Girard, Proof Theory and Logical Complexitiy, Bibliopolis, Napoli, 1987.
36. T. Glass, T. Strahm, Systems of explicit mathematics with non-constructive μ-operator and join, Annals of Pure and Applied Logic 82 (1996) 193-219.
37. P. Hájek, P. Pudlák, Metamathematics of First-Order Arithmetic, Perspective in Mathematical Logic, Springer, Berlin, 1993.
38. J.R. Hindley, J.P. Seldin, Introduction to Combinators and λ-Calculus, Cambridge University Press, Cambridge, 1986.
39. M. Hofmann, Linear types and non-size-increasing polynomial time computation, in: Logic in Computer Science LICS '99, Trento, IEEE, 1999, pp. 464-473.
40. M. Hofmann, Type systems for polynomial-time computation, Habilitation Thesis, Darmstadt, appeared as LFCS Technical Report ECS-LFCS-99-416, 1999.
41. R. Irwin, B. Kapron, J. Royer, On characterizations of the basic feasible functionals, Part I, Journal of Functional Programming 11 (2001) 117-153.
42. 0, Archiv für mathematische Logik und Grundlagenforschung 23 (1983) 65-77.
43. G. Jäger, R. Kahle, T. Strahm, On applicative theories, in: A. Cantini, E. Casari, P. Minari (Eds.), Logic and Foundations of Mathematics, Kluwer Academic Publishers, Dordrecht, 1999, pp. 83-92.
44. G. Jäger, T. Strahm, Some theories with positive induction of ordinal strength φω0, Journal of Symbolic Logic 61 (3) (1996) 818-842.
45. G. Jäger, T. Strahm, Totality in applicative theories, Annals of Pure and Applied Logic 74 (2) (1995) 105-120.
46. 1-CA) + (Bl) und verwandter Systeme, in: Sitzungsberichte der Bayerischen Akademie der Wissenschaften, Mathematisch-naturwissenschaftliche Klasse, 1982, pp. 1-28.
47. B. Kapron, S. Cook, A new characterization of type 2 feasibility, SIAM Journal on Computing 25 (1996) 117-132.
48. J. Krajílek, Bounded Arithmetic, Propositional Logic, and Complexity Theory, Encyclopedia of Mathematics and its Applications, vol. 60, Cambridge, University Press, 1995.
49. D. Leivant, A foundational delineation of poly-time, Information and Computation 110 (1994) 391-420.
50. 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.
51. D. Leivant, Ramified recurrence and computational complexity I: word recurrence and poly-time, in: P. Clote, J. Remmel (Eds.), Feasible Mathematics II, Birkhäuser, Basel, 1994, pp. 320-343.
52. M. Marzetta, T. Strahm, The μ quantification operator in explicit mathematics with universes anditerated fixed point theories with ordinals, Archive for Mathematical Logic 37 (5+6) (1998) 391-413.
53. K. Melhorn, Polynomial and abstract subrecursive classes, Journal of Computer and System Science 12 (1976) 147-178.
54. C. Parsons, On a number theoretic choice schema and its relation to induction, in: J. Myhill, A. Kino, R. Vesley (Eds.), Intuitionism and Proof Theory, Proceedings of the Summer Conference at Buffalo NY, 1968, North-Holland, Amsterdam, 1970, pp. 459-473.
55. 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.
56. R.W. Ritchie, Classes of predictably computable functions, Transactions of the American Mathematical Society 106 (1963) 139-173.
57. J. Royer, Semantics vs. syntax vs. computations: machine models for type-2 polynomial-time bounded functionals, Journal of Computer and System Science 54 (1997) 424-436.
58. A. Schlüter, An extension of Leivant's characterization of poly-time by predicative arithmetic, Preprint, Stanford University, 1995, 13 pp.
59. A. Seth, Complexity theory of higher type functionals, Ph.D. thesis, Tata Institute of Fundamental Research, Bombay, 1994.
60. W. Sieg, Fragments of arithmetic, Annals of Pure and Applied Logic 28 (1985) 33-71.
61. W. Sieg, Herbrand analyses, Archive for Mathematical Logic 30 (5+6) (1991) 409-441.
62. T. Strahm, Proof-theoretic Contributions to Explicit Mathematics, Habilitationsschrift, University of Bern, 2001.
63. T. Strahm, A proof-theoretic characterization of the basic feasible functionals, preprint, April 2002, 22 pp.
64. T. Strahm, Polynomial time operations in explicit mathematics, Journal of Symbolic Logic 62 (2) (1997) 575-594.
65. T. Strahm, The non-constructive μ operator, fixed point theories with ordinals, and the bar rule, Annals of Pure and Applied Logic 104 (1-3) (2000) 305-324.
66. T. Studer, Object-oriented programming in explicit mathematics: towards the mathematics of objects, Ph.D. thesis, Universität Bern, 2001.
67. 1, Journal of Symbolic Logic 56 (3) (1991) 1038-1063.
68. D.B. Thompson, Subrecursiveness: machine independent notions of computability in restricted time and storage, Mathematical Systems Theory 6 (1972) 3-15.
69. A. Troelstra, D. van Dalen, Constructivism in Mathematics, vol. I, North-Holland, Amsterdam, 1988.
70. A. Troelstra, D. van Dalen, Constructivism in Mathematics, vol. II, North Holland, Amsterdam, 1988.
71. D. Zambella, Notes on polynomially bounded arithmetic, Journal of Symbolic Logic 61 (3) (1996) 942-966.