Polynomial time operations in explicit mathematics

Journal of Symbolic Logic

Volumn 62, Issue 2, 1997, Pages 575-594

  Strahm, Thomas ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031527173     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2275547     Document Type: Article

References (26)

1. H. P. BARENDREGT, The Lambda calculus, revised ed., North Holland, Amsterdam, 1984.
2. M. J. BEESON, Foundations of constructive mathematics: Metamathematical studies, Springer-Verlag, Berlin, 1985.
3. W. BUCHHOLZ and W. SIEG, A note on polynomial time computable arithmetic, Contemporary Mathematics, vol. 106 (1990), pp. 51-55.
4. S. R. Buss, Bounded arithmetic, Bibliopolis, Napoli, 1986.
5. _, A conservation result concerning bounded theories and the collection axiom, Proceedings of the AMS, vol. 100 (1987), no. 4, pp. 709-715.
6. A. CANTINI, On the computational content of theories of operations with total application, handwritten notes, June 1995.
7. _, Asymmetric interpretation for bounded theories, Mathematical Logic Quarterly, vol. 42 (1996), pp. 270-288.
8. A. COBHAM, The intrinsic computational difficulty of functions, Logic, methodology and philosophy of science II, North Holland, Amsterdam, 1964, pp. 24-30.
9. S. A. COOK and B. M. KAPRON, Characterizations of the basic feasible functionals of finite type, Feasible mathematics, Birkhäuser, Basel, 1990, pp. 71-95.
10. S. A. COOK and A. URQUHART, Functional interpretations of feasibly constructive arithmetic, Annals of Pure and Applied Logic, vol. 63 (1993), no. 2, pp. 103-200.
11. S. FEFERMAN, A language and axioms for explicit mathematics, Algebra and logic, Lecture Notes in Mathematics, vol. 450, Springer-Verlag, Berlin, 1975, pp. 87-139.
12. _, Constructive theories of functions and classes, Logic Colloquium '78, North-Holland, Amsterdam, 1979, pp. 159-224.
13. _, Hilbert's program relativized: proof-theoretical and foundational studies, this JOURNAL, vol. 53 (1988), pp. 364-384.
14. S. FEFERMAN and G. JÄGER, Systems of explicit mathematics with non-constructive μ-operator. Part I, Annals of Pure and Applied Logic, vol. 65 (1993), no. 3, pp. 243-263.
15. _, Systems of explicit mathematics with non-constructive μ-operator. Part II, Annals of Pure and Applied Logic, vol. 79 (1996), no. 1.
16. F. FERREIRA, Polynomial time computable arithmetic and conservative extensions, Ph.D. thesis, Pennsylvania State University, 1988.
17. _. Polynomial time computable arithmetic, Contemporary Mathematics, vol. 106 (1990), pp. 137-156.
18. _, A feasible theory for analysis, this JOURNAL, vol. 59 (1994), no. 3, pp. 1001-1011.
19. _, A note on a result of Buss concerning bounded theories and the collection scheme, Portugaliae Mathematica, vol. 52 (1995), no. 3, pp. 331-336.
20. T. GLAß and T. STRAHM, Systems of explicit mathematics with non-constructive μ-operator and join, Annals of Pure and Applied Logic, to appear.
21. P. G. HINMAN, Recursion-theoretic hierarchies, Springer-Verlag, Berlin, 1978.
22. G. JÄGER and T. STRAHM, Totality in applicative theories, Annals of Pure and Applied Logic, vol. 74 (1995), no. 2, pp. 105-120.
23. A. SETH, Complexity theory of higher type functionals, Ph.D. thesis, Tata Institute of Fundamental Research, Bombay, 1994.
24. T. STRAHM, Theories with self-application of strength PRA, Master's thesis, Institut für Informatik und angewandte Mathematik, Universität Bern, 1992.
25. A. TROELSTRA and D. VAN DALEN, Constructivism in mathematics vol. I, North-Holland, Amsterdam, New York, 1988.
26. _, Constructivism in mathematics vol. II, North-Holland, Amsterdam, 1988.