An application of graphical enumeration to PA

Journal of Symbolic Logic

Volumn 68, Issue 1, 2003, Pages 5-16

  Weiermann, Andreas ^a  

^a UNIVERSITY OF MÜNSTER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037356292     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1045861503     Document Type: Article

References (16)

1. 0, Mathematical Logic Quarterly, vol. 48 (2002), pp. 125-130.
2. S. N. Burris, Number theoretic density and logical limit laws, Mathematical Surveys and Monographs, vol. 86, American Mathematical Society.
3. H. Friedman and M. Sheard, Elementary descent recursion and proof theory, Annals of Pure and Applied Logic, vol. 71 (1995), pp. 1-45.
4. G. H. Hardy and S. Ramanujan, Asymptotic formulae for the distribution of integers of various types, Proceedings of the London Mathematical Society, vol. 16 (1917), pp. 112-132.
5. J. B. Kruskal, Well-quasi-orderings, the tree theorem, and Vázsonyi’s conjecture, Transactions of the American Mathematical Society, vol. 95 (1960), pp. 210-225.
6. M. Loebl and J. Matoušek, On undecidability of the weakened Kruskal theorem, Logic and combinatorics (Arcata, California, 1985), American Mathematical Society, Providence, RI, 1987, pp. 275-280.
7. J. Matoušek and J. Nešetřil, Invitation to Discrete Mathematics, The Clarendon Press, Oxford, New York, 1998.
8. D. J. Newman, Analytic Number Theory, Springer, New York, 1998.
9. R. Otter, The number of trees, Annals of Mathematics, vol. 49 (1948), pp. 583-599.
10. M. Rathjen and A. Weiermann, Proof-theoretic investigations on Kruskal’s theorem, Annals of Pure and Applied Logic, vol. 60 (1993), pp. 49-88.
11. J. Riordan, The enumeration of trees by height and diameter, IBM Journal of Research and Development, vol. 4 (1960), pp. 473-478.
12. K. Schütte, Proof Theory, Springer, Berlin, 1977.
13. S. G. Simpson, Non-provability of certain combinatorial properties of finite trees, Harvey Friedman’s research on the foundations of mathematics, North-Holland, Amsterdam, 1985, pp. 87-117.
14. R. Smith, The consistency strength of some finite forms of the Higman and Kruskal theorems, Harvey Friedman’s research on the foundations of mathematics, North-Holland, Amsterdam, 1985, pp. 119-136.
15. A. Weiermann, What makes a (point-wise) sub-recursive hierarchy slow growing?, Sets and proofs (Leeds, 1997), Cambridge University Press, Cambridge, 1999, pp. 403-423.
16. M. Yamashita, Asymptotic estimation of the number of trees, Transactions of the Institute of Electronics and Communication Engineering of Japan, vol. 62-A (1979), pp. 128-135, in Japanese.