Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results

Annals of Pure and Applied Logic

Volumn 136, Issue 1-2, 2005, Pages 189-218

  Weiermann, Andreas ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Analytic combinatorics; Independence results for systems of arithmetic; Logical limit laws; Ordinal analysis; Proof theoretic ordinals; Tauberian theory

Indexed keywords

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

References (76)

1. G. Almkvist Exact asymptotic formulas for the coefficients of nonmodular functions J. Number Theory 38 2 1991 145-160
2. T. Arai An introduction to finitary analyses of proof figures in: Sets and Proofs Leeds, 1997 in: London Math. Soc. Lecture Note Ser. vol. 258 1999 Cambridge Univ. Press Cambridge 1-25
3. 0, Hiroshima, 2000 (Preprint)
4. T. Arai Proof theory for theories of ordinals. I. Recursively Mahlo ordinals Ann. Pure Appl. Logic 122 1-3 2003 1-85
5. A. Beckmann Dynamic ordinal analysis Arch. Math. Logic 42 4 2003 303-334
6. A. Beckmann W. Pohlers Applications of cut-free infinitary derivations to generalized recursion theory in: Conference on Computability Theory Oberwolfach, 1996 Ann. Pure Appl. Logic 94 1-3 1998 7-19
7. L.D. Beklemishev Provability algebras and proof-theoretic ordinals, I Ann. Pure Appl. Logic 128 2004 103-123
8. L. Beklemishev The Worm principle in: Logic Group Preprint Series vol. 219 2003 Department of Philosophy, Utrecht University March
9. B. Blankertz A. Weiermann How to characterize provably total functions by the Buchholz operator method in: Gödel'96 Brno, 1996 Lecture Notes Logic vol. 6 1996 Springer Berlin 205-213
10. E. Bombieri, Problems of the Millenium: The Riemann Hypothesis, 2000 (Preprint)
11. W. Buchholz A. Cichon A. Weiermann A uniform approach to fundamental sequences and hierarchies Math. Logic Quarterly 40 1994 273-286
12. S.N. Burris Number Theoretic Density and Logical Limit Laws in: Mathematical Surveys and Monographs vol. 86 2001 American Mathematical Society
13. L. Carlucci, Worms, gaps and hydras, Math. Logic Quart. (in press)
14. E.A. Cichon A short proof of two recently discovered independence results using recursion theoretic methods Proc. Amer. Math. Soc. 87 1983 704-706
15. M. Cramer Some theorems concerning prime numbers Ark. Mat. Astr. Fys. 15 1920 1-32
16. N.G. de Bruijn On Mahler's partition problem Indagationes Math. 10 1948 210-220. Reprinted from: Koninklijke Nederlandsche Akademie van Wetenschappen, Ser. A.
17. M. Drmota B. Gittenberger On the profile of random tree Random Structures Algorithms 10 1997 421-451
18. P. Erdös R. Rado Combinatorial theorems on classifications of subsets of a given set Proc. London Math. Soc. Ser. III 2 1952 417-439
19. S. Feferman Infinitary properties, local functors, and systems of ordinal functions in: Conference in Mathematical Logic - London'70 Proc. Conf., Bedford Coll., London, 1970 in: Lecture Notes in Math. vol. 255 1972 Springer Berlin 63-97
20. M. Filaseta O. Trifonov On Gaps between squarefree numbers II J. London Math. Soc. (2) 45 2 1992 215-221
21. P. Flajolet R. Sedgewick The average case of algorithms. Available via WWW at http://algo.inria.fr/flajolet/Publications/publist.html
22. H. Friedman FOM: Urbana thoughts, Posting from Saturday 10-th, June 2000 http://www.cs.nyu.edu/pipermail/fom/2000-June/004098.html
23. J.L. Geluk L. de Haan U. Stadtmüller A Tauberian theorem of exponential type Canad. J. Math. 38 3 1986 697-718
24. 1-logic. I. Dilators Ann. Math. Logic 21 2-3 1981 75-219 1982
25. B. Gittenberger On the contour of random trees SIAM J. Discrete Math. 12 4 1999 434-458
26. A. Granville ABC allows us to count squarefrees Int. Math. Res. Not. 19 1998 991-1009
27. A. Granville T. Tucker It's as easy as a b c Notices Amer. Soc. 49 10 2002 1224-1231
28. G.H. Hardy S. Ramanujan Asymptotic formulae for the distribution of integers of various types Proc. London Math. Soc. 1917
29. G.H. Hardy S. Ramanujan Asymptotic formulae in combinatory analysis Proc. London Math. Soc. 17 1918 75-115
30. R. Hasegawa Two applications of analytic functors. Theories of types and proofs, Tokyo, 1997 Theoret. Comput. Sci. 272 1-2 2002 113-175
31. D.R. Heath Brown The number of primes in a short interval J. Reine Angew. Math. 389 1988 22-63
32. 2 1-CA) + (BI) and of related systems Bayer. Akad. Wiss. Math.-Natur. Kl. Sitzungsber 1982 1-28
33. A. Joyal Une thorie combinatoire des series formelles Adv. Math. 42 1 1981 1-82
34. A. Kanamori K. McAloon On Gödel incompleteness and finite combinatorics Ann. Pure Appl. Logic 33 1987 23-41
35. C.F. Kent B.R. Hodgson Extensions of arithmetic for proving termination of computations J. Symbolic Logic 54 1989 779-794
36. J. Knopfmacher Abstract Analytic Number Theory in: North-Holland Mathematical Library vol. 12 1975 North-Holland Publishing Co., Amsterdam-Oxford; American Elsevier Publishing Co., Inc. New York
37. D.E. Knuth The Art of Computer Programming vol. 1 1968 Addison Wesley
38. E.E. Kohlbecker Weak asymptotic properties of partitions Trans. Amer. Math. Soc. 88 1958 346-365
39. J. Korevaaar Tauberian Theory 2004 Springer
40. G. Labelle C. Lamathe P. Leroux Enumeration des 2-arbres k-gonaux in: B. Chauvin P. Flajolet (Eds) Trends in Mahematics 2002 Birkhäuser Verlag Basel, Switzerland 95-109
41. G. Lee, Phase transitions in axiomatic thought. Ph.D. Thesis, Münster, 2005
42. M. Loebl J. Matoušek On undecidability of the weakened Kruskal theorem in: Logic and Combinatorics Arcata, CA, 1985 1987 Amer. Math. Soc. Providence, RI 275-280
43. D.W. Matula A natural rooted tree enumeration by prime factorization SIAM Rev. 10 1968
44. G. Moreno Socias An Ackermannian polynomial ideal Lecture Notes in Computer Science vol. 539 1991 269-280
45. R. Otter The number of trees Ann. Math. 49 1948 583-599
46. S. Parameswaran Partition functions whose logarithms are slowly oscillating Trans. Amer. Math. Soc. 100 1961 217-240
47. V.M. Petrogradsky Growth of finitely generated polynilpotent lie algebras and groups, generalized partitions, and functions analytic in the unit circle Internat. J. Algebra Comput. 1991 179-212
48. W. Pohlers Ordinals connected with formal theories for transfinitely iterated inductive definitions J. Symbolic Logic 43 2 1978 161-182
49. 1 Arch. Math. Logik Grundlag. 21 3-4 1981 113-129
50. W. Pohlers Cut elimination for impredicative infinitary systems. II. Ordinal analysis for iterated inductive definitions Arch. Math. Logik Grundlag. 22 1-2 1982 69-87
51. W. Pohlers Proof theory. An introduction Lecture Notes in Mathematics vol. 1407 1989 Springer-Verlag Berlin
52. H. Rademacher On the Partition Function p(n) Proc. London Math. Soc. 43 1937 241-254
53. 1 - CA and related systems Bull. Symbolic Logic 1 4 1995 468-485
54. M. Rathjen The realm of ordinal analysis Sets and Proofs Leeds, 1997 London Math. Soc. Lecture Note Ser. vol. 258 1999 Cambridge Univ. Press Cambridge 219-279
55. 1-comprehension Arch. Math. Logic 2004 doi:10.1007/ s00153-004-0232-4 Publisher: Springer-Verlag GmbH ISSN: 0933-5846 (Paper) 1432-0665 (Online) Issue: Online First September 1, 2004
56. M. Rathjen An ordinal analysis of stability Arch. Math. Logic 44 1 2005 1-62
57. M. Rathjen A. Weiermann Proof-theoretic investigations on Kruskal's theorem Ann. Pure Appl. Logic 60 1993 49-88
58. L.B. Richmond Asymptotic results for partitions. I. The distribution of certain integers J. Number Theory 8 4 1976 372-389
59. B. Riemann Über die Anzahl der Primzahlen unter einer gegebenen Grösse Mon. Not. Berlin Akad. 1859 671-680
60. D. Schmidt Bounds for the closure ordinals of replete monotonic increasing functions J. Symbolic Logic 40 3 1975 305-316
61. D. Schmidt Well-Partial Orderings and Their Maximal Order Types 1979 Habilitationsschrift Heidelberg
62. K. Schütte Proof Theory 1977 Springer
63. S.G. Simpson Non-provability of certain combinatorial properties of finite trees in: Harvey Friedman's Research on the Foundations of Mathematics 1985 North-Holland Amsterdam 87-117
64. S. Simpson Ordinal numbers and the Hilbert basis theorem J. Symbolic Logic 53 3 1988 961-974
65. R. Smith The consistency strength of some finite forms of the Higman and Kruskal theorems in: Harvey Friedman's Research on the Foundations of Mathematics 1985 North-Holland Amsterdam 119-136
66. A. Walfisz, Weylsche Exponentialsummen in der neueren Zahlentheorie, Berlin, 1963
67. A. Weiermann Bounds for the closure ordinals of essentially monotonic increasing functions J. Symbolic Logic 58 2 1993 664-671
68. A. Weiermann Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones Arch. Math. Logic 34 5 1995 313-330
69. A. Weiermann Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths Theoret. Comput. Sci. 139 1-2 1995 355-362
70. A. Weiermann How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: A case study J. Symbolic Logic 63 4 1998 1348-1370
71. 0 in: Mathematics and Computer science, II Versailles, 2002 Trends Math. 2002 Birkhäuser Basel 527-539
72. A. Weiermann An application of graphical enumeration to PA J. Symbolic Logic 68 1 2003 5-16
73. A. Weiermann An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions Discrete Math. Comput. Sci. 6 2003 133-142
74. A. Weiermann A classification of rapidly growing Ramsey functions Proc. Amer. Math. Soc. 132 2 2004 553-561
75. A.R. Woods Coloring rules for finite trees, and probabilities of monadic second order sentences Random Structures Algorithms 10 1997 453-485
76. M. Yamashita Asymptotic estimation of the number of trees Trans. IECE Japan 62-A 1979 128-135 (in Japanese).