1. Ambos-Spies, K.: Polynomial time reducibilities and degrees. In: Griffor, E. (ed.) Handbook of Computability Theory, Elsevier, Amsterdam (1999)
2. Basu, S.: On the structure of subrecursive degrees. J. Comput. System Sci. 4, 452–464 (1970)
3. Clote, P.: Computation models and function algebra. In: Griffor, E. (ed.) Handbook of Computability Theory, Elsevier, Amsterdam (1999)
4. Grzegorczyk, A.: Some classes of recursive functions. Rozprawy Matematyczne IV, Warszawa (1953)
5. Kristiansen, L.: Neat function algebraic characterizations of Logspace and Linspace. Computational Complexity 14, 72–88 (2005)