[FOM] provably recursive functions
weiermann at math.uu.nl
Wed Jun 23 08:19:11 EDT 2004
Dear members of FOM,
during my recent Utrecht proof theory lectures I prepared
an expository article (submitted to BSL) about classifying
the provably recursive
functions of first order Peano arithmetic.
Among other things it contains a selfcontained
treatment of the Hardy hierarchy and a streamlined
version of the classification result using
Skolem operators a la Buchholz.
As a service for FOM I put it on the following
Feedback is appreciated. In a sequel I will
also make a paper on hydras and Goodstein sequences
More information about the FOM