1. Boolos, G. S. and Jeffrey, R. C.: Computability and Logic, 2nd edition, Cambridge University Press, 1980.
2. Brainerd, W. S. and Landweber, L. H.: Theory of Computation, J. Wiley & Sons, New York, 1974.
3. Buss, S. R. and Scott, P. J. (eds): Feasible Mathematics, Birkhäuser, Boston–Basel–Berlin, 1990.
4. Cleave, J. P.: A Hierarchy of Primitive Recursive Functions, Zeitschrift für mathematische Logik und Grundlagen der Mathematik Bd. 9 (1963), 331–345.
5. Clote, P. and Takeuti, G.: Exponential Time and Bounded Arithmetic (Extended Abstract), in: A. L. Selman (ed), Structure in Complexity Theory: Proceedings of the Conference held at the University of California, Berkeley, California, June 1986, Lecture Notes in Computer Science vol. 223, Springer-Verlag, Berlin–Heidelberg–New York, 1986.