How to characterize provably total functions by local predicativity
Journal of Symbolic Logic 61 (1):52-69 (1996)
| Abstract | 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 | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,631 |
| External links |
|
| Through your library | Configure |
Markus Michelbrink (2006). A Buchholz Derivation System for the Ordinal Analysis of KP + Π₃-Reflection. Journal of Symbolic Logic 71 (4):1237 - 1283.
Fernando Ferreira (1994). A Feasible Theory for Analysis. Journal of Symbolic Logic 59 (3):1001-1011.
Zlatan Damnjanovic (1995). Minimal Realizability of Intuitionistic Arithmetic and Elementary Analysis. Journal of Symbolic Logic 60 (4):1208-1241.
Victor Harnik (1992). Provably Total Functions of Intuitionistic Bounded Arithmetic. Journal of Symbolic Logic 57 (2):466-477.
Thomas Strahm (1997). Polynomial Time Operations in Explicit Mathematics. Journal of Symbolic Logic 62 (2):575-594.
Andreas Weiermann (1998). How is It That Infinitary Methods Can Be Applied to Finitary Mathematics? Gödel's T: A Case Study. Journal of Symbolic Logic 63 (4):1348-1370.
Andreas Weiermann (2006). Classifying the Provably Total Functions of Pa. Bulletin of Symbolic Logic 12 (2):177-190.
Toshiyasu Arai (1998). Variations on a Theme by Weiermann. Journal of Symbolic Logic 63 (3):897-925.
Monthly downloads |
Added to index2009-01-28Total downloads2 ( #232,211 of 548,969 )Recent downloads (6 months)0How can I increase my downloads? |

