Phase transition thresholds for some Friedman-style independence results

Mathematical Logic Quarterly

Volumn 53, Issue 1, 2007, Pages 4-18

  Weiermann, Andreas ^a  

^a GHENT UNIVERSITY   (Belgium)

Author keywords

Asymptotic analysis; Enumerative combinatorics; Independence results; Peano arithmetic

Indexed keywords

EID: 33846701156     PISSN: 09425616     EISSN: 15213870     Source Type: Journal    
DOI: 10.1002/malq.200610022     Document Type: Article

References (23)

1. S. N. Burris, Number Theoretic Density and Logical Limit Laws. Mathematical Surveys and Monographs 86 (American Mathematical Society, 2001).
2. N. G. de Bruijn, D. E. Knuth, and S. O. Rice, The average height of planted plane trees. In: Graph Theory and Computing (R.-C. Read, ed.), pp. 15-22 (Academic Press, 1972).
3. D. H. J. de Jongh and R. Parikh, Well partial orderings and hierarchies. Indigationes Mathematicae 39, 195-206 (1977).
4. W. Feller, An Introduction into Probability Theory and Its Applications, Vol. 1,2nd edition (Wiley, 1957).
5. P. Flajolet and R. Sedgewick, Analytic Combinatorics. To appear. The current version is downloadable from Flajolet's web site: http://algo.inria.fr/ flajolet/Publications/publist.html.
6. G. Higman, Ordering by divisibility in abstract algebras. Proc. London Math. Soc. 3, 326-336 (1952).
7. G. Kreisel, On the interpretation of non-finitist proofs II. J. Symbolic Logic 17, 43-58 (1952).
8. J. B. Kruskal, Well-quasi-orderings, the tree theorem, and Vázsonyi's conjecture. Trans. Amer. Math. Soc. 95, 210-225 (1960).
9. J. L. Lagrange, Recherches sur les suites récurrentes. In: Œuvres de Lagrange, Vol. 4, pp. 149-251 (Gauthier-Villars, 1869).
10. M. Loebl and J. Matoušek, On undecidability of the weakened Kruskal theorem. In: Logic and Combinatorics, pp. 275-280 (Arcata, 1985).
11. J. Matoušek and J. Nešetřil, Invitation to Discrete Mathematics (The Clarendon Press, 1998).
12. A. Odlyzko, Asymptotic enumeration methods. In: Handbook of Combinatorics, Vol. 2 (R. L. Graham, M. Groetschel, and L. Lovasz, eds.), pp. 1063-1229 (Elsevier, 1995).
13. M. Rathjen and A. Weiermann, Proof-theoretic investigations on Kruskal's theorem. Annals Pure Appl. Logic 60, 49-88 (1993).
14. D. Schmidt, Well-partial orderings and their maximal order types. Habilitationsschrift, Heidelberg, 1979.
15. K. Schütte and S. G. Simpson, Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen. Archiv für mathematische Logik und Grundlagenforschung 25, 75-89 (1985).
16. S. G. Simpson, Non-provability of certain combinatorial properties of finite trees. In: Harvey Friedman's Research on the Foundations of Mathematics (L. A. Harrington et al., eds.), pp. 87-117 (Elsevier, 1985).
17. R. L. Smith, The consistency strength of some finite forms of the Higman and Kruskal theorems. In: Harvey Friedman's Research on the Foundations of Mathematics (L. A. Harrington et al., eds.), pp. 119-136 (Elsevier, 1985).
18. A. Weiermann, Some interesting connections between the slow growing hierarchy and the Ackermann function. J. Symbolic Logic 66, 609-628 (2001).
19. 0. In: Logic Colloquium '99, pp. 182-199. Lecture Notes in Logic 17 (ASL, 2004).
20. A. Weiermann, An application of graphical enumeration to PA. J. Symbolic Logic 68, 5-16 (2003).
21. A. Weiermann, A classification of rapidly growing Ramsey functions. Proc. Amer. Math. Soc. 132, 553-561 (2004).
22. A. Weiermann, Analytic combinatorics, proof-theoretic ordinals and phase transitions for independence results. Annals Pure Appl. Logic 136, 189-218 (2005).
23. A. Weiermann, An extremely sharp phase transition threshold for the slow growing hierarchy. Mathematical Structures in Computer Science 16, 925-946 (2006).