How to Characterize Provably Total Functions by Local Predicativity

Weiermann, Andreas

J. Symbolic Logic, Tome 61 (1996) no. 1, p. 52-69 / Harvested from Project Euclid

Résumé

Inspired by Pohlers' proof-theoretic analysis of $KP\omega$ 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\omega$. Our method relies on a new approach to subrecursion due to Buchholz, Cichon and the author.

Publié le : 1996-03-14
Classification:

@article{1183744926,
     author = {Weiermann, Andreas},
     title = {How to Characterize Provably Total Functions by Local Predicativity},
     journal = {J. Symbolic Logic},
     volume = {61},
     number = {1},
     year = {1996},
     pages = { 52-69},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183744926}
}

Weiermann, Andreas. How to Characterize Provably Total Functions by Local Predicativity. J. Symbolic Logic, Tome 61 (1996) no. 1, pp.  52-69. http://gdmltest.u-ga.fr/item/1183744926/