1. B. Allen, ?Arithmetizing Uniform NC?,Annals of Pure and Applied Logic, p. 1?50, v. 53 (1991).
2. S. Bellantoni, ?Predicative Recursion and Computational Complexity?, PhD Thesis, University of Toronto, 1992 (to appear).
3. S. Bellantoni and S. Cook, ?A New Recursion-Theoretic Characterization of the Polytime Functions (Extended Abstract)?, inProc. 24th Symposium on the Theory Of Computing, ACM, 1992.
4. S. Bloch, ?Functional Charaterizations of Uniform Log-depth and Polylogdepth Circuit Families?, inProc., Structure in Complexity Theory, to appear, IEEE, 1992.
5. S. Buss, ?Bounded Arithmetic?, Ph.D. Dissertation, Princeton University, 1985; reprinted Bibliopolis, Naples, 1986.