1. Beeson, M.J.: Foundations of Constructive Mathematics: Metamathematical Studies. Springer, Berlin (1985)
2. Buchholtz, U.: Unfolding of systems of inductive definitions. Ph.D. thesis, Stanford University (2013)
3. Buchholtz, U., Jäger, G., Strahm, T.: Theories of proof-theoretic strength $$\Psi (\Gamma _{\Omega +1})$$. In: Probst, D., Schuster, P. (eds.) Concepts of Proof in Mathematics, Philosophy, and Computer Science of Ontos Mathematical Logic. vol. 6, pp. 115–140. De Gruyter (2016)
4. Clote, P.: Computation models and function algebras. In: Griffor, E. (ed.) Handbook of Computability Theory, pp. 589–681. Elsevier (1999)
5. Cobham, A.: The intrinsic computational difficulty of functions. In: Logic, Methodology and Philosophy of Science II, pp. 24–30. North Holland, Amsterdam (1965)