Variations on a theme by Weiermann
Journal of Symbolic Logic 63 (3):897-925 (1998)
| Abstract | Weiermann [18] introduces a new method to generate fast growing functions in order to get an elegant and perspicuous proof of a bounding theorem for provably total recursive functions in a formal theory, e.g., in PA. His fast growing function θαn is described as follows. For each ordinal α and natural number n let T α n denote a finitely branching, primitive recursive tree of ordinals, i.e., an ordinal as a label is attached to each node in the tree so that the labelling is compatible with the tree ordering. Then the tree T α n is well founded and hence finite by Konig's lemma. Define θαn=the depth of the tree T α n =the length of the longest branch in T α n . We introduce new fast and slow growing functions in this mode of definitions and show that each of these majorizes provably total recursive functions in PA | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesAndreas Weiermann (2003). An Application of Graphical Enumeration to PA. Journal of Symbolic Logic 68 (1):5-16.
Alessandro Andretta (1991). Building Iteration Trees. Journal of Symbolic Logic 56 (4):1369-1384.
Stanley S. Wainer (1999). Accessible Recursive Functions. Bulletin of Symbolic Logic 5 (3):367-388.
Markus Michelbrink (2006). A Buchholz Derivation System for the Ordinal Analysis of KP + Π₃-Reflection. Journal of Symbolic Logic 71 (4):1237 - 1283.
Zlatan Damnjanovic (1995). Minimal Realizability of Intuitionistic Arithmetic and Elementary Analysis. Journal of Symbolic Logic 60 (4):1208-1241.
Andreas Weiermann (2006). Classifying the Provably Total Functions of Pa. Bulletin of Symbolic Logic 12 (2):177-190.
Andreas Weiermann (2002). Slow Versus Fast Growing. Synthese 133 (1-2):13 - 29.
Andreas Weiermann (1996). How to Characterize Provably Total Functions by Local Predicativity. Journal of Symbolic Logic 61 (1):52-69.
Benjamin Blankertz & Andreas Weiermann (1999). A Uniform Approach for Characterizing the Provably Total Number-Theoretic Functions of KPM and (Some of) its Subsystems. Studia Logica 62 (3):399-427.
Andreas Weiermann (2001). Some Interesting Connections Between the Slow Growing Hierarchy and the Ackermann Function. Journal of Symbolic Logic 66 (2):609-628.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #274,982 of 549,196 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
