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
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 22,585
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Michael Rathjen (1991). Proof-Theoretic Analysis of KPM. Archive for Mathematical Logic 30 (5-6):377-403.
Wilfried Sieg (1985). Fragments of Arithmetic. Annals of Pure and Applied Logic 28 (1):33-71.
Wilfried Buchholz (1991). Notation Systems for Infinitary Derivations. Archive for Mathematical Logic 30 (5-6):277-296.

View all 7 references / Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

4 ( #594,986 of 1,938,672 )

Recent downloads (6 months)

1 ( #452,035 of 1,938,672 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.