1. Buss, S.R.: The witness function method and provably recursive functions of Peano arithmetic. In: Prawitz, D., Skyrms, B., Westerstahl, D. (eds.) Logic, Methodology and Philosophy of Science IX (1991). North-Holland, Amsterdam (1994)
2. Cobham, A.: The intristic computational difficulty of functions. In: Bar- Hillel, Y. (ed.) Logic, Methodology and Philosophy of Science II, pp. 24–30. North-Holland, Amsterdam (1965)
3. Colson, L.: About primitive recursive algorithms. Theoretical Computer Science 83(1), 57–69 (1991)
4. Davis, M.: Computability and Unsolvability, 2nd edn. McGraw-Hill, New York (1985)
5. Hájek, P., Pudlák, P.: Metamathematics of First-Order Arithmetic. Springer, Heidelberg (1993)