We aim at a conceptually clear and technical smooth investigation of Ackermann's substitution method. Our analysis provides a direct classification of the provable recursive functions of PA , i.e. Peano Arithmetic framed in the -calculus. Key words: Peano Arithmetic, Provable recursive functions, Epsilon substitution method. 1991 MSC: 03F30, 03F05, 03F15