Journal of Symbolic Logic

How to Characterize Provably Total Functions by Local Predicativity

Andreas Weiermann

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

Abstract

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.

Article information

Source
J. Symbolic Logic, Volume 61, Issue 1 (1996), 52-69.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183744926

Mathematical Reviews number (MathSciNet)
MR1380676

Zentralblatt MATH identifier
0859.03028

JSTOR
links.jstor.org

Citation

Weiermann, Andreas. How to Characterize Provably Total Functions by Local Predicativity. J. Symbolic Logic 61 (1996), no. 1, 52--69. https://projecteuclid.org/euclid.jsl/1183744926


Export citation