Classifying the provably total functions of PA

Abstract

We give a self-contained and streamlined version of the classification of the provably computable functions of PA. The emphasis is put on illuminating as well as seems possible the intrinsic computational character of the standard cut elimination process. The article is intended to be suitable for teaching purposes and just requires basic familiarity with PA and the ordinals below ε₀. (Familiarity with a cut elimination theorem for a Gentzen or Tait calculus is helpful but not presupposed).