Skip to main content

The slow-growing and the Graegorczyk hierarchies

  • E.A. Cichon (a1) and S.S. Wainer (a2)

We give here an elementary proof of a recent result of Girard [4] comparing the rates of growth of the two principal (and extreme) examples of a spectrum of “majorization hierarchies”—i.e. hierarchies of increasing number-theoretic functions, indexed by (systems of notations for) initial segments I of the countable ordinals so that if α < βI then the βth function dominates the αth one at all but finitely-many positive integers x.

Hardy [5] was perhaps the first to make use of a majorization hierarchy—the Hα's below—in “exhibiting” a set of reals with cardinality ℵ1. More recently such hierarchies have played important roles in mathematical logic because they provide natural classifications of recursive functions according to their computational complexity. (All the functions considered here are “honest” in the sense that the size of their values gives a measure of the number of steps needed to compute them.)

The hierarchies we are concerned with fall into three main classes depending on their mode of generation at successor stages, the other crucial parameter being the initial choice of a particular (standard) fundamental sequence λ0 < λ1 < λ2 < … to each limit ordinal λ under consideration which, by a suitable diagonalization, will then determine the generation at stage λ.

Our later comparisons will require the use of a “large” initial segment I of proof-theoretic ordinals, extending as far as the “Howard ordinal”. However we will postpone a precise description of these ordinals and their associated fundamental sequences until later.

Hide All
[1]Aczel, P., Another elementary treatment of Girard's result connecting the slow and fast growing hierarchies of number-theoretic functions, Handwritten notes, 04, 1980.
[2]Bachmann, H., Die Normalfunktionen und das Problem der ausgezeichneten Folgen von Ordnungszahlen, Vierteljahrsschrift der Naturforschenden Gesellschaft Zürich, vol. 95 (1950), pp. 115147.
[3]Buchholz, W., Three contributions to the conference on Recent Advances in Proof Theory (to appear).
[4]Girard, J.-Y., logic, Annals of Mathematical Logic, vol. 21 (to appear).
[5]Hardy, G.H., A theorem concerning the infinite cardinal numbers, Quarterly Journal of Mathematics, vol. 35 (1904), pp. 8794.
[6]Jervell, H.R., Homogeneous trees, Lectures given at the University of Munich, 1979.
[7]Löb, M.H. and Wainer, S.S., Hierarchies of number-theoretic functions. I, II, Archiv für Mathematische Logik und Grundlagenforschung, vol. 13 (1970), pp. 39–51 and pp. 97113.
[8]Paris, J. and Harrington, L., A mathematical incompleteness in Peano arithmetic, Handbook of Mathematical Logic (Barwise, J., Editor), North-Holland, Amsterdam, 1977, pp. 11331142.
[9]Schwichtenberg, H., Lecture at the conference on Recent Advances in Proof Theory, Oxford, 04, 1980.
[10]Ketonen, J. and Solovay, R.M., Rapidly growing Ramsey functions, Annals of Mathematics, vol. 113 (1981), pp. 267314.
[11]Wainer, S.S., Ordinal recursion and a refinement of the extended Grzegorczyk hierarchy, this Journal, vol. 37 (1972), pp. 281292.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed