Sometimes slow growing is fast growing (Q1377604)

An important problem in the foudations of subrecursive hierarchies is to explain the role of the choice of a fundamental sequence for the definition of such a hierarchy. In this paper we can see that the study of this problem is very promising and can reveal interesting surprises. The author shows that a version of the hierarchy which is commonly called the slow growing hierarchy (defined with respect to a certain norm-based assignment of fundamental sequences [\textit{E. A. Cichon}, in: P. Aczel et al. (eds.), Proof theory, Int. Summer School and Conference, Leeds 1990, 173-193 (1992; Zbl 0793.03057)]) majorizes each PA-provable recursive function; and that is the property that lets a hierarchy be called fast growing. The proof is quite technical but it is easy to follow since everything is given in full detail. Before the proof of the crucial hierarchy comparison theorem is carried out, the author gives a short calculation that illustrates why the considered ``slow growing'' hierarchy leaves the scope of elementary recursion.