Classifying the phase transition threshold for Ackermannian functions

Annals of Pure and Applied Logic

Volumn 158, Issue 3, 2009, Pages 156-162

  Omri, Eran ^a   Weiermann, Andreas ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b GHENT UNIVERSITY   (Belgium)

Author keywords

Ackermann function; Fast growing hierarchy; Phase transition; Threshold

Indexed keywords

EID: 61549130286     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2007.02.004     Document Type: Article

References (18)

1. 0. Math. Log. Quart. 48 (2002) 125-130
2. Buchholz W., Cichon A., and Weiermann A. A uniform approach to fundamental sequences and hierarchies. Math. Log. Quart. 40 (1994) 273-286
3. L. Carlucci, G. Lee, A. Weiermann, Classifying the phase transition threshold for regressive Ramsey functions, Amer. J. Math. (submitted for publication) Preprint 2006
4. Calude C. Theories of Computational Complexity. Annals of Discrete Mathematics vol. 35 (1988), North-Holland, Amsterdam
5. Kojman M., Lee G., Omri E., and Weiermann A. Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers. J. Combin. Theory, Ser. A 115 6 (2008) 1036-1055
6. G. Lee, Phase transitions in axiomatic thought, Ph.D. Thesis (written under the supervision of A. Weiermann), Münster 2005, 121 pages
7. E. Omri, Thresholds for regressive ramsey functions, Master Thesis, Be'er-Sheva, Israel 2005
8. 0-rekursiven Funktionen. Z. Math. Log. Grund. Math. 17 (1971) 61-74
9. Wainer S.S. A classification of the ordinal recursive functions. Arch. Math. Log. Grundl.forsch. 13 (1970) 136-153
10. Weiermann A. An application of graphical enumeration to PA. J. Symbolic Logic 68 1 (2003) 5-16
11. Weiermann A. An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions. Discrete Math. Comput. Sci. 6 (2003) 133-142
12. 0. Logic Colloquium '99. Lect. Notes Log. vol. 17 (2004), Assoc. Symbol. Logic, Urbana, IL 182-199
13. Weiermann A. A classification of rapidly growing Ramsey functions. Proc. Amer. Math. Soc. 132 2 (2004) 553-561
14. Weiermann A. Analytic Combinatorics, proof-theoretic ordinals and phase transitions for independence results. Ann. Pure Appl. Logic 136 (2005) 189-218
15. Weiermann A. An extremely sharp phase transition threshold for the slow growing hierarchy. Math. Structures Comput. Sci. 16 5 (2006) 925-946
16. A. Weiermann, Classifying the phase transition for Paris Harrington numbers, Preprint, 2005
17. Weiermann A. Phase transition thresholds for some Friedman-style independence results. Math. Log. Q. 53 1 (2007) 4-18
18. Weiermann A. Phase transition thresholds for some natural subclasses of the computable functions. Logical Approaches to Computational Barriers, Second Conference on Computability in Europe. CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings. Lecture Notes in Computer Science vol. 3988 (2006), Springer 556-570