Summary
Let T(Ω) be the ordinal notation system from Buchholz-Schütte (1988). [The order type of the countable segmentT(Ω)0 is — by Rathjen (1988) — the proof-theoretic ordinal the proof-theoretic ordinal ofACA 0 + (Π l1 −TR).] In particular let ↦Ω a denote the enumeration function of the infinite cardinals and leta ↦ ψ0 a denote the partial collapsing operation on T(Ω) which maps ordinals of T(Ω) into the countable segment TΩ 0 of T(Ω). Assume that the (fast growing) extended Grzegorczyk hierarchy\((F_a )_{a \in T(\Omega )_0 }\) and the slow growing hierarchy\((G_a )_{a \in T(\Omega )_0 }\) are defined with respect to the natural system of distinguished fundamental sequences of Buchholz and Schütte (1988) in the following way:
wherel is a countable limit ordinal (term) and (l[n]) n ∈N is the distinguished fundamental sequence assigned tol. For each ordinal (term)a in T(Ω) and each natural numbern letC n (a) be the formal term which results from the ordinal terma by successively replacing every occurence ofψ a by\(\psi _{ - 1 + C_n (a)}\) whereψ −1 is considered as a defined function symbol, namely\(\psi _{ - 1} b: = F_{\psi _0 b + 1} (n + 1)\). (Note thatψ a 0=Ω a ) In this article it is shown that for each ordinal termψ 0 a in T(Ω) there exists a natural numbern 0 such thatψ 0 C n (a) ∈ T(Ω) and\(G_{\psi _0 a} (n) \leqslant F_{\psi _0 C_n (a) + 1} (n + 1)\) holds for alln≥n 0. This hierarchy comparison theorem yields a plethora of new results on nontrivial lower bounds for the slow growing ordinals — i.e. ordinals for which the slow growing hierarchy yields a classification of the provably total functions of the theory in question — of various theories of iterated inductive definitions (and subsystems ofKPi) and on the number and size of the subrecursively inaccessible ordinals — i.e. ordinals at which the extended Grzegorczyk hierarchy and the slow growing hierarchy catch up — below the proof-theoretic ordinal ofACA 0+(Π l1 −TR). In particular these subrecursively inaccessibles ordinals are necessarily of the form\(\psi _0 \Omega ..._{\Omega _\omega }\).
Similar content being viewed by others
References
Aczel, P.: Another elementary treatment of Girard's result connecting the slow and fast growing hierarchies of numbertheoretic functions. Preprint (1980)
Aoyama, K., Kadota, N.: Some extensions of built-upness on systems of fundamental sequences. Z math Logik Grundl Math36, 357–364 (1990)
Arai, T.: A slow growing analogue to Buchholz' proof. Ann Pure Appl Logic54, 101–120 (1991)
Barwise, J.: Admissible sets and structures. Berlin Heidelberg New York: Springer 1975
Buchholz, W.: Eine Erweiterung der Schnitteliminationsmethode. Habilitationsschrift, München (1977)
Buchholz, W.: Three contributions to the conference on recent advances in proof theory. Preprint, Oxford (1980)
Buchholz, W.: A new system of proof-theoretic ordinal functions. Ann Pure Appl Logic32, 195–207 (1986)
Buchholz, W.: Notation systems for infinitary derivations. Arch Math Logic30, 277–296 (1991)
Buchholz, W.: Proof-theoretic analysis of termination proofs. Ann Pure Appl Logic (to appear)
Buchholz, W., Cichon, A., Weiermann, A.: A uniform approach to fundamental sequences and subrecursive hierarchies. Math Logic Quart40, 273–286 (1994)
Buchholz, W., Feferman, S., Sieg, W., Pohlers, W.: Iterated inductive definitions. Recent proof-theoretical studies. Lecture Notes in Mathematics 897. Berlin Heidelberg New York: Springer 1981
Buchholz, W., Schütte, K.: Ein Ordinalzahlensystem für die beweistheoretische Abgrenzung derΠ 12 -Separation und Bar-Induktion. Sitzungsberichte der Bayerischen Akademie der Wissenschaften. Mathematisch-Naturwissenschaftliche Klasse, pp. 99–132 (1983)
Buchholz, W., Schütte, K.: Proof theory of impredicative subsystems of analysis. Naples: Bibliopolis 1988
Cichon, E.A.: Termination orderings and complexity characterizations. In: Aczel, P., et al (eds.) Proof theory, pp. 171–193. Cambridge: Cambridge University Press 1992
Cichon, E.A., Wainer, S.S.: The slow and the Grzegorczyk hierarchies. J Symb Logic48, 399–408 (1983)
Cichon, E.A., Weiermann, A.: Term rewriting theory for the primitive recursive functions. Preprint, Nancy (1995) (submitted)
Dennis-Jones, E.C., Wainer, S.S.: Subrecursive hierarchies via direct limits, pp. 118–128. Computation and proof theory. Lecture Notes in Mathematics 1104. Berlin Heidelberg New York: Springer 1984
Feferman, S.: Formal theories for transfinite iterations of generalized inductive definitions and some subsystems of analysis. Intuitionism and proof theory. In: Kino, A., Myhill, J., Vesley, R.E. (eds.) Proceedings of The Summer Conference at Buffalo N.Y. 1968. Amsterdam: North-Holland 1970
Friedman, H., Sheard, M.: Elementary descent recursion and proof theory. Ann Pure Appl Logic71, 1–47 (1995)
Fairtlough, M.V.H., Wainer, S.S.: Ordinal complexity of recursive definitions. Inf comput99, 123–153 (1992)
Girard, J.Y.:Π 12 -logic: Part 1: Dilators. Ann Math Logic21, 75–219 (1981)
Girard, J.Y.: Proof theory and logical complexity, Vol. 1. Studies in proof theory. Naples: Bibliopolis 1986
Girard, J.Y.: Proof/theory and logical complexity, Vol. 2. Studies in proof theory. mimeographed
Gödel, K.: Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes. Dialectica12, 280–287 (1958)
Gordeev, L.: Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees. Arch Math Logic29, 29–46 (1989)
Grzegorzcyk, A.: Some classes of recursive functions. Rozprawy Matematycne. No. IV, Warsaw (1953)
Hofbauer, D.: Termination proofs by multiset path orderings imply primitive recursive derivation lengths. Theor Comput Sci105, 129–140 (1992)
Handley, W.G., Wainer, S.S.: Equational derivation versus computation. Preprint (1992)
Jervell, H.R.: Homogeneous trees. Lecture notes of a lecture held at München (1979)
Kadota, N.: On Wainer's notation for a minimal subrecursive inaccesible ordinal. Math Logic Quart39, 217–227 (1993)
Kreisel, G.: On the interpretation of non-finitist proofs II. J Symb Logic17, 43–58 (1952)
Kreisel, G.: Interpretation of classical analysis by means of constructive functionals of finite type. In: Heyting, A. (ed.) Constructivity in mathematics, pp. 101–128. Amsterdam: North-Holland 1959
Löb, M.H., Wainer, S.S.: Hierarchies of numbertheoretic functions, Part I. Arch Math Logik13, 39–51 (1970)
Löb, M.H., Wainer, S.S.: Hierarchies of numbertheoretic functions, Part II. Archiv Math Logik13, 97–113 (1997)
Pohlers, W.: Beweistheorie der iterierten induktiven Definitionen. Habilitationsschrift, München (1977)
Pohlers, W.: A short course in ordinal analysis. In: Aczel, P., et al. (eds) Proof theory, pp. 27–78. Cambridge: Cambridge University Press 1992
Rathjen, M.: Untersuchungen zu Teilsystemen der Zahlentheorie zweiter Stufe und der Mengenlehre mit einer zwischenΔ 12 −CA undΔ 12 −CA + (BI) liegenden Beweisstärke. Dissertation Münster (1988)
Robbin, J.W.: Subrecursive hierarchies. Ph. D. thesis, Princeton (1965)
Rose, H.E.: Subrecursion: Functions and hierarchies. Oxford: University Press 1984
Schmerl, U.: Über die schwach und die stark wachsende Hierarchie zahlentheoretischer Funktionen. Sitzungsberichte der Bayerischen Akademie der Wissenschaften, Mathematisch Naturwissenschaftliche Klasse (1981)
Schmidt, D.: Built-up systems of fundamental sequences and hierarchies of number-theoretic functions. Arch Math Logik Grundlagenforschu18, 47–53 (1976)
Schmidt, D.: [Postscript to Schmidt (1976).] Arch Math Logik Grundlagenforschu18, 145–146 (1977)
Schütte, K.: Proof theory. Berlin Heidelberg New York: Springer 1977
Schütte, K.: Majorisierungsrelationen und Fundamentalfolgen eines Ordinalzahlensystems von G. Jäger, Arch Math Logik26, 29–55 (1986/87)
Schwichtenberg, H.: Rekursionszahlen und die Grzegorczyk-Hierarchie. Arch Math Logik12, 85–97 (1969)
Schwichtenberg, H.: Eine Klassifikation derε 0-rekursiven Funktionen. Z Math Logik Grundl Math17, 61–74 (1971)
Schwichtenberg, H.: Elimination of higher type levels of primitive-recursive functionals by means of transfinite recursion. In: Rose, H.E., Sheperdson, J.C. (eds.) Logic Colloquim '73, pp. 279–304. Amsterdam: North-Holland, 1975
Schwichtenberg, H.: Lecture at the conference on Recent Advances in Proof Theory, Oxford (1980)
Schwichtenberg, H., Wainer, S.S.: Ordinal bounds for programs. Preprint 1993
Takeuti, G., Proof theory, 2nd edn. Amsterdam: North Holland 1987
Tait, W.: Constructive reasoning. In: van Rotselaar, B., Staal, J.F. (eds.) Logic, methodology and the philosophy of science, Vol. III, pp. 185–199. Amsterdam: North-Holland 1968
Wainer, S.S.: A classification of the ordinal recursive functions. Arch Math Logik Grundlagenforschu13, 136–53 (1970)
Wainer S.S.: Ordinal recursion and a refinement of the extended Gregorczyk hierarchy. J Symb Logic37, 281–292 (1972)
Wainer S.S.: Hierarchies of provably computable functions. The University of Leeds, Department of Mathematics, Preprint Series 9 (1988)
Wainer S.S.: Slow growing versus fast growing, J Symb Logic54, 608–614 (1989)
Weiermann, A.: Vereinfachte Kollabierungsfunktionen und ihre Anwendungen. Arch Math Logic31 85–94 (1991)
Weiermann, A.: How to characterize provably total functions by local predicativity. J Symb Logic (to appear)
Weiermann, A.: Bounding derivation lengths with functions from the slow growing hierarchy. Münster (1993) (unpublished)
Weiermann, A.: Ein Beitrag zur Theorie der subrekursiven Funktionen. Habilitationsschrift, Münster (1994)
Weiermann, A.: Termination proofs by lexicographic path orderings imply multiply recursive derivation lengths. Theor Comput Sci139, 355–362 (1995)
Weiermann, A.: A strongly uniform termination proof for Gödel'sT by methods from local predicativity. Preprint, Münster (1995) (submitted)
Zemke, F.: P.r.-regulated systems of notation and the subrecursive hierarchy equivalence property. Transa Amer Math Soc234, 89–118 (1977)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Weiermann, A. Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones. Arch Math Logic 34, 313–330 (1995). https://doi.org/10.1007/BF01387511
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01387511