Γ0 May Be Minimal Subrecursively Inaccessible

Mathematical Logic Quarterly 47 (3):397-408 (2001)
  Copy   BIBTEX

Abstract

Let T be the standard Veblen 1908 ordinal notation system for Γ0 as defined, for example, in Schütte's 1977 textbook [13] on Proof Theory. We define a slight modification of the standard assignment of fundamental sequences for the limit ordinals in T and prove that Γ0 is subrecursively inaccessible for this assignment, i.e. the induced slow and fast growing hierarchy match up at Γ0 for the first time.The results of this paper also indicate that φε00 may be considered as a new slow growing ordinal of PA in the sense that the induced slow growing hierarchy up to φε00 classifies the PA-provablyrecursive functions.We show how the results of this paper can be used to bui d a subrecursive hierarchyover the predicative ordinals in the spirit of Wainer's 1970 abstract [16 ]

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,168

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Sometimes slow growing is fast growing.Andreas Weiermann - 1997 - Annals of Pure and Applied Logic 90 (1-3):91-99.
Variations on a theme by Weiermann.Toshiyasu Arai - 1998 - Journal of Symbolic Logic 63 (3):897-925.
Equational derivation vs. computation.W. G. Handley & S. S. Wainer - 1994 - Annals of Pure and Applied Logic 70 (1):17-49.
A Nonstandard Hierarchy Comparison Theorem for the Slow and Fast Growing Hierarchy.Wilfried Buchholz & Andreas Weiermann - 2012 - In Ulrich Berger, Hannes Diener, Peter Schuster & Monika Seisenberger, Logic, Construction, Computation. De Gruyter. pp. 79-90.
Consistency proof via pointwise induction.Toshiyasu Arai - 1998 - Archive for Mathematical Logic 37 (3):149-165.

Analytics

Added to PP
2013-12-01

Downloads
21 (#1,105,144)

6 months
1 (#1,597,699)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references