Classifying the provably total functions of PA

Bulletin of Symbolic Logic

Volumn 12, Issue 2, 2006, Pages 177-190

  Weiermann, Andreas ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33745233071     PISSN: 10798986     EISSN: None     Source Type: Journal    
DOI: 10.2178/bsl/1146620058     Document Type: Article

References (24)

1. W. ACKERMANN, Zur Widerspruchsfreiheit der reinen Zahlentheorie, Mathematische Annalen, vol. 117 (1940).
2. J. AVIGAD and R. SOMMER, A model-theoretic approach to ordinal analysis, this BUL-LETIN, vol. 3 (1997), no. 1, pp. 17-52.
3. B. BLANKERTZ and A. WEIERMANN, How to characterize provably total functions by the Buchholz operator method, Lecture Notes in Logic, vol. 6, Springer, 1996, pp. 205-213.
4. W. BUCHHOLZ, Notation systems for infinitary derivations. Archive for Mathematical Logic, vol. 30 (1991), no. 5/6, pp. 277-296.
5. _, A simplified version of local predicativity, Proof theory: a selection of papers from the Leeds proof theory meeting 1990 (P. Aczel, H. Simmons, and S.S. Wainer, editors), Cambridge University Press, 1992, pp. 115-148.
6. _, Lectures Notes Logic I, II and Proof Theory, Online available under: http:// www. mathematik.uni-muenchen.de/~ buchholz/.
7. W. BUCHHOLZ, A. CICHON, and A. WEIERMANN, A uniform approach to fundamental sequences and hierarchies. Mathematical Logic Quarterly, vol. 40 (1994), pp. 273-286.
8. W. BUCHHOLZ and S. S. WAINER, Provably computable functions and the fast growing hierarchy, Logic and combinatorics, Contemporary Mathematics, vol. 65, American Mathematical Society, 1987, pp. 179-198.
9. E. A. CICHON, A short proof of two recently discovered independence results using recursion theoretic methods, Proceedings of the AMS, vol. 87, 1983, pp. 704-706.
10. M. FAIRTLOUGH and S. S. WAINER, Hierarchies of provably recursive functions, Handbook of proof theory, Studies in Logic and the Foundation of Mathematics, vol. 137, North-Holland, 1998, pp. 149-207.
11. H. FRIEDMAN and M. SHEARD, Elementary descent recursion and proof theory. Annals of Pure and Applied Logic, vol. 71 (1995), pp. 1-45.
12. K. GÖDEL, Über eine bisher noch nicht benützte Erweiterung des finiten Standpunkts, Dialectica, vol. 12 (1958), pp. 280-287.
13. P. HÁJEK and P. PUDLÁK, Metamathematics of first-order arithmetic. Springer, 1993.
14. G. KREISEL, On the interpretation of non-finitist proofs II, The Journal of Symbolic Logic, vol. 17 (1952), pp. 43-58.
15. W. POHLERS, Proof theory. An introduction, Lecture Notes in Mathematics, vol. 1407, Springer, 1989.
16. _, Subsystems of set theory and second order number theory. Handbook of proof theory. Studies in Logic and the Foundations of Mathematics, vol. 137. North-Holland, 1998, pp. 209-335.
17. H. E. ROSE, Subrecursion: Functions and hierarchies, Oxford University Press, 1984.
18. K. SCHÜTTE, Proof theory, Springer, 1977.
19. 0-rekursiven Funktionen, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, (1971), pp. 61-74.
20. _, Proof theory: Some applications of cut-elimination, Handbook of mathematical logic (J. Barwise, editor), North-Holland, 1977, pp. 867-895.
21. G. TAKEUTI, Proof theory, 2nd ed., North-Holland, 1987.
22. S. S. WAINER, A classification of the ordinal recursive functions, Archiv für Mathematische Logik, vol. 13 (1970), pp. 136-153.
23. A. WEIERMANN, How to characterize provably total functions by local predicativity, The Journal of Symbolic Logic, vol. 61 (1996), pp. 52-69.
24. _, Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results. Annals of Pure and Applied Logic, vol. 136 (2005), no. 1-2, pp. 189-218.