Classifying the provably total functions of pa

Bulletin of Symbolic Logic 12 (2):177-190 (2006)
We give a self-contained and streamlined version of the classification of the provably computable functions of PA. The emphasis is put on illuminating as well as seems possible the intrinsic computational character of the standard cut elimination process. The article is intended to be suitable for teaching purposes and just requires basic familiarity with PA and the ordinals below ε0. (Familiarity with a cut elimination theorem for a Gentzen or Tait calculus is helpful but not presupposed).
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/bsl/1146620058
 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: 24,453
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
Wilfried Buchholz (1991). Notation Systems for Infinitary Derivations. Archive for Mathematical Logic 30 (5-6):277-296.

View all 8 references / Add more references

Citations of this work BETA
Andreas Weiermann (2009). Phase Transitions for Gödel Incompleteness. Annals of Pure and Applied Logic 157 (2):281-296.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

23 ( #205,824 of 1,925,480 )

Recent downloads (6 months)

1 ( #418,235 of 1,925,480 )

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.