How to characterize provably total functions by local predicativity

Journal of Symbolic Logic 61 (1):52-69 (1996)
Inspired by Pohlers' proof-theoretic analysis of KPω we give a straightforward non-metamathematical proof of the (well-known) classification of the provably total functions of $PA, PA + TI(\prec\lceil)$ (where it is assumed that the well-ordering $\prec$ has some reasonable closure properties) and KPω. Our method relies on a new approach to subrecursion due to Buchholz, Cichon and the author
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275597
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 26,162
Through your library
References found in this work BETA
Proof-Theoretic Analysis of KPM.Michael Rathjen - 1991 - Archive for Mathematical Logic 30 (5-6):377-403.
Fragments of Arithmetic.Wilfried Sieg - 1983 - Annals of Pure and Applied Logic 28 (1):33-71.
Elementary Descent Recursion and Proof Theory.Harvey Friedman & Michael Sheard - 1995 - Annals of Pure and Applied Logic 71 (1):1-45.
Notation Systems for Infinitary Derivations.Wilfried Buchholz - 1991 - Archive for Mathematical Logic 30 (5-6):277-296.

View all 7 references / Add more references

Citations of this work BETA
Classifying the Provably Total Functions of Pa.Andreas Weiermann - 2006 - Bulletin of Symbolic Logic 12 (2):177-190.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

4 ( #633,386 of 2,152,538 )

Recent downloads (6 months)

1 ( #399,788 of 2,152,538 )

How can I increase my downloads?

My notes
Sign in to use this feature

There  are no threads in this forum
Nothing in this forum yet.

Other forums