Fragments of Heyting arithmetic

Journal of Symbolic Logic

Volumn 65, Issue 3, 2000, Pages 1223-1240

  Burr, Wolfgang ^a  

^a UNIVERSITY OF MÜNSTER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034258798     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2586698     Document Type: Article

References (23)

1. JEREMY AVIGAD, Interpreting classical theories in constructive ones, preprint, 1998.
2. JEREMY AVIGAD and RICK SOMMER, A model-theoretic approach to ordinal analysis, The Bulletin of Symbolic Logic, vol. 3 (1997), pp. 17-52.
3. LEV D. BEKLEMISHEV, A proof-theoretic analysis of collection, Archive for Mathematical Logic, vol. 37 (1998), pp. 275-296.
4. SAMUEL BUSS, Bounded arithmetic, Bibliopolis, Naples, 1986, revision of 1985 Princeton University Ph. D. thesis.
5. THIERRY COQUAND and MARTIN HOFMANN, A new method for establishing conservativity of classical systems over their intuitionistic version, Lambda calculus and logic, Mathematical Structures in Computer Science, vol. 9 (1999), no. 4, pp. 323-333.
6. JUSTUS DILLER and WERNER NAHM, Eine Variante zur Dialectica-Interpretation der Heyting-Arithmetik endlicher Typen, Archiv für mathematische Logik und Grundlagenforschung, vol. 16 (1974), pp. 49-66.
7. JUSTUS DILLER and KURT SCHÜTTE, Simultane Rekursionen in der Theorie der Funktionale endlicher Typen, Archiv für mathematische Logik und Grundlagenforschung, vol. 14 (1970), pp. 69-74.
8. KURT GÖDEL, Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes, Dialectica, vol. 12 (1958), pp. 280-287.
9. PETR HÁJEK and PAVEL PUDLÁK, Metamathematics of first-order arithmetic, Berlin, 1993.
10. RICHARD KAYE, Models of Peano arithmetic, Oxford, 1991.
11. ULRICH KOHLENBACH, Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals, Archive for Mathematical Logic, vol. 36 (1996), pp. 31-71.
12. DANIEL LEIVANT, Implicational complexity in intuitionistic arithmetic, this JOURNAL, vol. 46 (1981), pp. 240-248.
13. CHARLES PARSONS, On n-quantifier induction, this JOURNAL, vol. 37 (1972), pp. 466-482.
14. WOLFRAM POHLERS, Proof theory, Berlin, 1989.
15. KURT SCHÜTTE, Proof theory, Heidelberg, 1977.
16. J. R. SHOENFIELD, Mathematical logic, 2nd ed., Addison-Wesley, Reading, Massachusetts, 1973.
17. WILFRIED SIEG. Fragments of arithmetic, Annals of Pure and Applied Logic, vol. 28 (1985), pp. 33-71.
18. A. S. Troelstra (editor), Metamathematical investigation of intuitionistic arithmetic and analysis, Lecture Notes in Mathematics, vol. 344, Springer-Verlag, Berlin, 1973.
19. _, Aspects of constructive mathematics, Handbook of mathematical logic (Jon Barwise, editor), North-Holland, 1977, pp. 973-1052.
20. A. S. TROELSTRA and D. VAN DALEN, Constructivism in mathematics, vol. I, North-Holland, Amsterdam, 1988.
21. KAI F. WEHMEIER, Semantical investigations in intuitionistic first-order arithmetic, Ph.D. thesis, Münster, 1996.
22. 1-induction, Archive for Mathematical Logic, vol. 37 (1997), pp. 445-460.
23. ANDREAS WEIERMANN, How is it, that infinitary methods can be applied to finitary mathematics? Gödel's T; a case study, this JOURNAL, vol. 63 (1998), pp. 1348-1370.