Bounded functional interpretation and feasible analysis

Annals of Pure and Applied Logic

Volumn 145, Issue 2, 2007, Pages 115-129

  Ferreira, Fernando ^a   Oliva, Paulo ^b  

^a UNIVERSITY OF LISBON   (Portugal)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Feasibility; Functional interpretation; Majorizability; Proof theory

Indexed keywords

EID: 33845241473     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2006.07.002     Document Type: Article

References (25)

1. Avigad J., and Feferman S. Gödel's functional ("Dialectica") interpretation. In: Buss S.R. (Ed). Handbook of Proof Theory. Studies in Logic and the Foundations of Mathematics vol. 137 (1998), North Holland, Amsterdam 337-405
2. Bezem M. Strongly majorizable functionals of finite type: a model for bar recursion containing discontinuous functionals. The Journal of Symbolic Logic 50 (1985) 652-660
3. Bishop E. Schizophrenia in contemporary mathematics. Errett Bishop: Reflections on Him and His Research. Contemporary Mathematics (1985), American Mathematical Society 1-32 First published in 1973
4. Bridges D.S., and Richman F. Varieties of Constructive Mathematics. London Mathematical Society Lecture Notes Series vol. 97 (1987), Cambridge University Press
5. S.R. Buss, Bounded arithmetic, Ph.D. Thesis, Princeton University, Princeton, New Jersey, 1985. A revision of this thesis was published by Bibliopolis (Naples) in 1986
6. Buss S.R. A conservation result concerning bounded theories and the collection scheme. Proceedings of the American Mathematical Society 100 (1987) 109-116
7. Cantini A. Asymmetric interpretations for bounded theories. Mathematical Logic Quarterly 42 1 (1996) 270-288
8. Cook S., and Urquhart A. Functional interpretations of feasibly constructive arithmetic. Annals of Pure and Applied Logic 63 (1993) 103-200
9. A. Fernandes, Investigações em sistemas de análise exequível, Ph.D. Thesis, Universidade de Lisboa, Portugal, 2001 (in Portuguese)
10. Fernandes A. The Baire category theorem over a feasible base theory. In: Simpson S. (Ed). Reverse Mathematics 2001. Lecture Notes in Logic vol. 21 (2005), A.K. Peters, Wellesley, Massachusetts 164-174
11. F. Ferreira, Polynomial time computable arithmetic and conservative extensions, Ph.D. Thesis, Pennsylvania State University, USA, 1988
12. Ferreira F. A feasible theory for analysis. The Journal of Symbolic Logic 59 3 (1994) 1001-1011
13. Ferreira F., and Fernandes A. Groundwork for weak analysis. The Journal of Symbolic Logic 67 2 (2002) 557-578
14. Ferreira F., and Fernandes A. Basic applications of weak König's lemma in feasible analysis. In: Simpson S. (Ed). Reverse Mathematics 2001. Lecture Notes in Logic vol. 21 (2005), A.K. Peters, Wellesley, Massachusetts 175-188
15. Ferreira F., and Oliva P. Bounded functional interpretation. Annals of Pure and Applied Logic 135 (2005) 73-112
16. Gödel K. Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes. Dialectica 12 (1958) 280-287
17. Howard W.A. Hereditarily majorizable functionals of finite type. In: Troelstra A.S. (Ed). Metamathematical Investigation of Intuitionistic Arithmetic and Analysis. Lecture Notes in Mathematics vol. 344 (1973), Springer, Berlin 454-461
18. Kohlenbach U. Effective bounds from ineffective proofs in analysis: An application of functional interpretation and majorization. The Journal of Symbolic Logic 57 (1992) 1239-1273
19. Kohlenbach U. Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation. Annals of Pure and Applied Logic 64 (1993) 27-94
20. Kohlenbach U. Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals. Archive for Mathematical Logic 36 (1996) 31-71
21. Kuroda S. Intuitionistische Untersuchungen der formalistischen Logik. Nagoya Mathematical Journal 3 (1951) 35-47
22. Luckhardt H. Extensional Gödel Functional Interpretation: A Consistency Proof of Classical Analysis. Lecture Notes in Mathematics vol. 306 (1973), Springer, Berlin
23. Oliva P. Polynomial-time algorithms from ineffective proofs. Proc. of the Eighteenth Annual IEEE Symposium on Logic in Computer Science. LICS'03 (2003), IEEE Press 128-137
24. Parikh R. Existence and feasibility in arithmetic. The Journal of Symbolic Logic 36 (1971) 494-508
25. Yamazaki T. Reverse mathematics and basic feasible systems of 0-1 strings. In: Simpson S. (Ed). Reverse Mathematics 2001. Lecture Notes in Logic vol. 21 (2005), A.K. Peters, Wellesley, Massachusetts 394-401