How to characterize provably total functions by local predicativity
AbstractInspired 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.
Keyword(s):
Keyword(s):
2021 ◽
1997 ◽
Vol 1
(1)
◽
pp. 111-133
◽
Keyword(s):
1983 ◽
Vol 73
(3)
◽
pp. 135-149
◽
Keyword(s):