Some interesting connections between the slow growing hierarchy and the Ackermann function

Journal of Symbolic Logic

Volumn 66, Issue 2, 2001, Pages 609-628

  Weiermann, Andreas ^a  

^a UNIVERSITY OF MÜNSTER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035534326     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2695032     Document Type: Article

References (29)

1. P. ACZEL, Another elementary treatment of Girard's result connecting the slow and fast growing hierarchies of number-theoretic functions, 1980, Manuscript.
2. T. ARAI, A slow growing analogue to Buchholz' proof, Annals of Pure and Applied Logic, vol. 54 (1991), pp. 101-120.
3. _,Some results on cut-elimination, provable well-orderings, induction and reflection, Annals of Pure and Applied Logic, vol. 95 ( 1998 ), pp. 93-184.
4. W. BUCHHOLZ, Fundamentalfolgen für θ(v), Preprint, München, 1980.
5. _, Three contributions to the conference on recent advances in proof theory, Oxford, 1980, mimeographed.
6. _,Proof-theoretic analysis of termination proofs, Annals of Pure and Applied Logic, vol. 75 (1995), no. 1-2, pp. 57-66.
7. W. BUCHHOLZ, E. A. CICHON, and A. WEIERMANN, A uniform approach to fundamental sequences and hierarchies, Mathematical Logic Quarterly, vol. 40 (1994), pp. 273-286.
8. A. CICHON, Termination orderings and complexity characterisations, Proof theory (P. Aczel et al., editors), Cambridge University Press, Cambridge, 1992, pp. 171-193.
9. E. A. CICHON and S. S. WAINER. The slow-growing and the Grzegorczyk hierarchies, this JOURNAL, vol. 48 (1983), pp. 399-408.
10. E.C. DENNIS-JONES and S.S. WAINER, Subrecursive hierarchies via direct limits. Computation and proof theory, Springer, Berlin, 1984, pp. 118-128.
11. N. DERSHOWITZ and J.P. JOUANNAUD, Rewrite systems, Handbook of theoretical computer science, Elsevier, Amsterdam, 1990, pp. 243-320.
12. S. FEFERMAN, Systems of predicative analysis, II: Representations of ordinals, this JOURNAL, vol. 33
13. 2-logic. I. Dilators, Annals of Mathematical Logic, vol. 21 (1981), pp. 75-219.
14. D. HOFBAUER, Termination proofs by multiset path orderings imply primitive recursive derivation lengths. Proceedings of the 2nd algebraic and logic programming, Lecture Notes in Computer Science 463, Springer, Berlin, 1990, pp. 347-358.
15. H.R. JERVELL, Homogeneous Trees. Lecture Notes at the University of München, 1979.
16. U.R. SCHMERL, Über die schwach und die stark wachsende Hierarchie zahlentheoretischer Funktionen, Sitzungsberichte der Bayerischen Akademie der Wissenschaften. Mathematisch-Naturwissenschaftliche Klasse, (1981), pp. 1-18.
17. D. SCHMIDT, Well-Partial Orderings and Their Maximal Order Types, Habilitationsschrift, Heidelberg, 1979.
18. K. SCHÜTTE, Primitiv-rekursive Ordinalzahlfunktionen, Sitzungsberichte der Bayerischen Akademie der Wissenschaften, Mathematisch Naturwissenschaftliche Klasse, (1975), pp. 143-153 (1976).
19. _. Proof theory, Springer-Verlag, Berlin, 1977.
20. H. SCHWICHTENBERG, Homogeneous Trees and Subrecursive Hierarchies, Lecture at the University of München, 1980.
21. O. VEBLEN, Continuous increasing functions of finite and transfinite ordinals, Transactions of the American Mathematical Society, vol. 9 (1908), pp. 280-292.
22. H. VOGEL, Ausgezeichnete Folgen für prädikative Ordinalzahlen und prädikativ-rekursive Funktionen, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 23 (1977). pp. 435-438.
23. S.S. WAINER, Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy, this JOURNAL, vol. 37 (1972), no. 2, pp. 281-292.
24. _, A subrecursive hierarchy over the predicative ordinals, Conference in mathematical logic - london '70. Springer Lecture Notes in Mathematics 255, 1972, pp. 350-351.
25. _, Slow growing versus fast growing, this JOURNAL, vol. 54 (1989), no. 2, pp. 608-614.
26. A. WEIERMANN, Ein beitrag zur theorie der subrekursiven funktionen, Habilitationsschrift, Münster, 1994.
27. _, Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths. Theoretical Computer Science, vol. 139 (1995), pp. 355-362.
28. 0 may be minimal subrecursively inaccessible, Preprint, Münster, 1999.
29. _, What makes the slow growing hierarchy slow growing?, London Mathematical Society: Sets and Proofs (Cooper and Truss, editors), Cambridge University Press, 1999, pp. 403-423.