Regressive Ramsey Numbers Are Ackermannian

Journal of Combinatorial Theory. Series A

Volumn 86, Issue 1, 1999, Pages 177-181

  Kojman, Menachem ^a,b   Shelah, Saharon ^c  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0011048779     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.1998.2906     Document Type: Article

References (8)

1. Calude C. Theories of Computational Complexity. Annals of Discrete Mathematics. 35:1988.
2. Kanamori A., McAloon K. On Gödel incompleteness and finite combinatorics. Ann. Pure Appl. Logic. 33:1987;23-41.
3. Leffman H., Rödl V. On canonical Ramsey numbers for complete graphs versus paths. J. Combin. Theory Ser. B. 58:1993;1-13.
4. Mills G. Ramsey-Paris-Harrington numbers for graphs. J. Combin. Theory Ser. A. 38:1985;30-37.
5. Nilli A. Shelah's proof of the Hales-Jewett theorem. Nešetřil J., Rödl V. Mathematics of Ramsey Theory. Algorithms and Combinatorics. 5:1990;151-152 Springer-Verlag, Berlin.
6. Erdos P, Mills G. Some bounds for the Ramsey-Paris-Harrington numbers. J. Combin. Theory Ser. A. 30:1981;53-70.
7. Paris J, Harrington L. A mathematical incompleteness in Peano arithmetic. Barwise J. Handbook of Mathematical Logic. 1977.
8. Shelah S. Primitive recursive bounds for van der Waerden numbers. J. Amer. Math. Soc. 1:1988;683-697.