Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T18:09:46.909Z Has data issue: false hasContentIssue false

How to characterize provably total functions by local predicativity

Published online by Cambridge University Press:  12 March 2014

Andreas Weiermann*
Affiliation:
Institut für Mathematische Logik und Grundlagenforschung, der Westfälischen Wilhelms-Universität Münster, Einsteinstrasse 62, D-48149 Münster, Germany, E-mail: weierma@math.uni-muenster.de

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(⊰ ↾) (where it is assumed that the well-ordering ⊰ has some reasonable closure properties) and KPω. Our method relies on a new approach to subrecursion due to Buchholz, Cichon and the author.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable