[FOM] provably recursive functions

[Andreas Weiermann]

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
URL: 

http://www.math.uu.nl/people/weierman/file.html

Feedback is appreciated. In a sequel I will
also make a paper on hydras and Goodstein sequences
available.


Best regards,
Andreas Weiermann