An extremely sharp phase transition threshold for the slow growing hierarchy

Mathematical Structures in Computer Science

Volumn 16, Issue 5, 2006, Pages 925-946

  Weiermann, Andreas ^a,b  

^a Departement Wiskunde   (Netherlands)

^b Deutsche Forschungsgemeinschaft   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750729598     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129506005640     Document Type: Conference Paper

References (15)

1. Arai, T. (1998) Variations on a theme by Weiermann. J. Symbolic Logic 63 (3) 897-925.
2. 0. Mathematical Logic Quarterly 48 125-130.
3. Bollobás, B. (2001) Random graphs, Second edition, Cambridge Studies in Advanced Mathematics 73, Cambridge University Press.
4. Buchholz, W. (1986) A new system of proof-theoretic ordinal functions. Ann. Pure Appl. Logic 32 (3) 195-207.
5. Buchholz, W., Cichon, E.A. and Weiermann, A.A. (1994) A uniform approach to fundamental sequences and hierarchies. Math. Logic Quart. 40 (2) 273-286.
6. Chandler, D. (1987) Introduction to modern statistical mechanics, The Clarendon Press.
7. Clote, P. and Kranakis, E. (2002) Boolean functions and computation models, Texts in Theoretical Computer Science, An EATCS Series, Springer-Verlag.
8. Girard, J.-Y. (1987) Proof Theory and Logical Complexity, Bipliopolis.
9. Grimmett, G. (1999) Percolation, Second edition. Grundlehren der Mathematischen Wissenschaften (Fundamental Principles of Mathematical Sciences) 321, Springer-Verlag.
10. Janson, S., Łuczak, T. and Rucinski, A. (2000) Random graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization.
11. Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B. and Troyansky, L. (1999) Determining computational complexity from characteristic 'phase transitions'. Nature 400 (6740) 133-137.
12. Weiermann, A. (1995) Investigations on slow versus fast growing: how to majorize slow growing functions nontrivially by fast growing ones. Arch. Math. Logic 34 (5) 313-330.
13. Weiermann, A. (1999) What makes a (point-wise) subrecursive hierarchy slow growing? In: Sets and proofs (Leeds, 1997), Cambridge University Press 403-423.
14. 0 may be minimal subrecursively inaccessible. MLQ 47 (3) 397-408.
15. 0. In: Van Eijck, J., Van Oostrom, V. and Visser, A. (eds.) Logic Colloquium 99: Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, held in Utrecht, The Netherlands August 1-6, 1999. Lecture Notes in Logic 17, Association for Symbolic Logic 182-199.