A model-theoretic approach to ordinal analysis

Bulletin of Symbolic Logic

Volumn 3, Issue 1, 1997, Pages 17-52

  Avigad, Jeremy ^a   Sommer, Richard ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031519595     PISSN: 10798986     EISSN: None     Source Type: Journal    
DOI: 10.2307/421195     Document Type: Article

References (33)

1. PETER ACZEL, An introduction to inductive definitions, in [5], pp. 739-782.
2. JEREMY AVIGAD, Formalizing forcing arguments in subsystems of second-order arithmetic, Annals of Pure and Applied Logic, vol. 82 (1996), pp. 165-191.
3. <ω, Journal of Symbolic Logic, vol. 61 (1996), pp. 768-779.
4. JEREMY AVIGAD and RICHARD SOMMER, The model-theoretic ordinal analysis of theories of predicative strength, Journal of Symbolic Logic, to appear.
5. JON BARWISE, The handbook of mathematical logic, North-Holland, 1977.
6. SOLOMON FEFERMAN, Theories of finite type related to mathematical practice, in [5], pp. 913-971.
7. _, Iterated inductive fixed-point theories: Application to Hancock's conjecture, Patras logic symposium (G. Metakides, editor), North-Holland, 1982.
8. 1-AC, Intuitionism and proof theory (A. Kino et al., editors), North-Holland, 1970, pp. 435-442.
9. HARVEY FRIEDMAN, KENNETH MCALOON, and STEPHEN SIMPSON, A finite combinatorial principle which is equivalent to the 1-consistency of predicative analysis, Patras logic symposium (G. Metakides, editor), North-Holland, 1982, pp. 197-230.
10. PETR HÁJEK and PAVEL PUDLÁK, Metamathematics of first-order arithmetic, Springer-Verlag, 1991.
11. RICHARD KAYE, Models of Peano arithmetic, Oxford University, 1991.
12. JUSSI KETONEN and ROBERT SOLOVAY, Rapidly growing Ramsey functions, Annals of Mathematics, vol. 113 (1981), pp. 267-314.
13. L. KIRBY and J. PARIS, Initial segments of models of Peano's axioms, Springer-Verlag Lecture Notes in Mathematics, vol. 619, 1977, pp. 211-216.
14. H. KOTLARSKI and Z. RATAJCZYK, Inductive full satisfaction classes, Annals of Pure and Applied Logic, vol. 47 (1990), pp. 199-223.
15. JEFF B. PARIS, A hierarchy of cuts in models of arithmetic, Springer-Verlag Lecture Notes in Mathematics, vol. 834, 1980, pp. 312-337.
16. JEFF B. PARIS and LEO HARRINGTON, A mathematical incompleteness in Peano arithmetic, in [5], pp. 1132-1142.
17. WOLFRAM POHLERS, Proof theory: An introduction, Springer-Verlag Lecture Notes in Mathematics, vol. 1407, 1989.
18. _, A short course in ordinal analysis, Proof theory (Aczel et al., editors), Cambridge University Press, 1993.
19. ZYGMUNT RATAJCZYK, Subsystems of true arithmetic and hierarchies of functions, Annals of Pure and Applied Logic, vol. 64 (1993), pp. 95-152.
20. MICHAEL RATHJEN, Admissible proof theory and beyond, Logic, methodology, and the philosophy of science IX (D. Prawitz et al., editors), Elsevier, 1994, pp. 123-147.
21. _, Proof theory of reflection, Annals of Pure and Applied Logic, vol. 68 (1994), pp. 181-224.
22. 1-CA and related systems, this BULLETIN, vol. 1 (1995), pp. 468-485.
23. H. E. ROSE, Subrecursion: Functions and hierarchies, Clarendon, 1984.
24. KURT SCHÜTTE, Proof theory, Springer-Verlag, 1977.
25. HELMUT SCHWICHTENBERG, Proof theory: Some applications of cut-elimination, in [5], pp. 867-895.
26. STEPHEN G. SIMPSON, Subsystems of second order arithmetic, preprint.
27. 2 and reverse mathematics, appendix to GAISI TAKEUTI, Proof theory, second ed., North-Holland, 1987.
28. _, On the strength of König's duality theorem of countable bipartite graphs, Journal of Symbolic Logic, vol. 59 (1994), pp. 113-123.
29. RICK SMITH, The consistency strengths of some finite forms of the Higman and Kruskal theorems, Harvey Friedman's research on the foundations of mathematics (Leo Harrington et al., editors), North-Holland, 1985, pp. 119-135.
30. RICHARD SOMMER, Transfinite induction and hierarchies generated by transfinite recursion within Peano arithmetic, Ph.D. thesis, University of California, Berkeley, 1990.
31. _, Ordinals in bounded arithmetic, Arithmetic, proof theory, and complexity (Peter Clote and Jan Krajiček, editors), Oxford University Press, 1992.
32. _, Transfinite induction within Peano arithmetic. Annals of Pure and Applied Logic, vol. 76 (1995), pp. 231-289.
33. S. S. WAINER, A classification of the ordinal recursive functions, Archiv für mathematische Logik, vol. 13 (1970), pp. 136-153.