A classification of rapidly growing Ramsey functions

Proceedings of the American Mathematical Society

Volumn 132, Issue 2, 2004, Pages 553-561

  Weiermann, Andreas ^a,b  

^a UNIVERSITY OF MÜNSTER   (Germany)

^b Department of Mathematics ^*  (Netherlands)

Author keywords

Fast growing hierarchies; Independence results; Paris Harrington theorem; Peano arithmetic; Rapidly growing Ramsey functions

Indexed keywords

EID: 0742271609     PISSN: 00029939     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0002-9939-03-07086-2     Document Type: Conference Paper

References (18)

1. T. Aral: On the slowly well orderedness of εo, Mathematical Logic Quarterly 48 (2002), 125-130. MR 2003a:03061
2. B. Blankertz and A. Weiermann: How to characterize provably total functiona by the Buchholz operator method. Springer Lecture Notes in Logic 6 (1996), 205-213. MR 98c:03116
3. W. Buchholz: On rapidly growing Ramsey functions. Technical report. München 1991.
4. W. Buchholz, A. Cichon and A. Weiermann: A uniform approach to fundamental sequences and hierarchies. Mathematical Logic Quarterly 40 (1994), 273-286. MR 95g:03035a
5. W. Buchholz and S. Wainer: Provably computable functions and the fast growing hierarchy. Logic and combinatorics, Contemporary Mathematics 65, American Mathematical Society, Providence, RI, 1987, 179-198. MR 88d:03109
6. P. Erdös and R. Rado: Combinatorial theorems on classifications of subsets of a given set. Proceedings of the London Math. Society III Ser. 2., (1952), 417-439. MR 16:455d
7. H. Priedman: "Perfect" statements. Posting the FOM email list from 05.02.1999: http://www.cs.nyu.edu/pipermail/fom/1999-February/002610.html
8. H. Friedman and M. Sheard: Elementary descent recursion and proof theory. Annals of Pure and Applied Logic 71 (1995), 1-45. MR 96c:03110
9. R. L. Graham, B. L. Rothschild and J. H. Spencer: Ramsey theory. John Wiley and Sons, 1990. MR 90m:05003
10. A. Kanamori and K. McAloon: On Gödel incompleteness and finite combinatorics. Annals of Pure and Applied Logic 33 (1987), 23-41. MR 88i:03095
11. R. Kaye: Models of Peano arithmetic. Oxford Logic Guides 15. The Clarendon Press, Oxford University Press, 1991. MR 92k:03034
12. J. Ketonen and R. Solovay: Rapidly growing Ramsey functions. Annals of Mathematics (2) 113 (1981), 267-314. MR 84c:03100
13. J. Paris and L. Harrington: A mathematical incompleteness in Peano arithmetic, Handbook of Mathematical Logic (J. Barwise, ed.). North-Holland, Amsterdam, 1977, 1133-1142. MR 56:15351
14. M. Loebl and J. Nešetřil: An improvable Ramsey-type theorem. Report No. 89598-OR, ISSN 0724-3138 (1989). Published in: Proceedings of the American Mathematical Society 116 (1992), 819-824. MR 93a:03067
15. H. E. Rose: Subrecursion: Functions and Hierarchies. The Clarendon Press, Oxford University Press, 1984. MR 86g:03004
16. S. S. Wainer: A classification of the ordinal recursive functions. Archiv für Mathematische Logik und Grundlagenforschung 13 (1970). 136-153. MR 45:3207
17. A. Weiermann: How to characterize provably total functions by local predicativity, Journal of Symbolic Logic 61 (1996), 52-69. MR 97d:03075
18. A. Weiermann: An application of graphical enumeration to PA, Journal of Symbolic Logic 68, no. 1 (2003), 5-16.