1. Lecture Notes in Computer Science 789;S. Abramsky,1994
2. S.J. Bellantoni. Predicative recursion and computational complexity. Technical Report TR 264/92, Department of Computer Science, University of Toronto, 1992.
3. S.J. Bellantoni and S. Cook. A new recursion-theoretic characterization of the polytime functions. Computational Complexity, 1993.
4. P. Bernays. On Platonism in Mathematics. In P. Benacerraf and H. Putnam, editors, Philosophy of Mathematics, pages 274–288. Prentice-Hall, Englewood Cliffs, NJ, 1964. Originally appeared in French in L'Enseignement Mathèmatique, 1935, pp. 52–69.
5. É. Borel. Les nombres inaccessibles. Gauthier-Villars, Paris, 1952.