Buss, Samuel R., Bounded arithmetic, Bibliopolis, Naples, 1986.
Buss, Samuel R. and Ignjatović, Aleksandar, Unprovability of consistency statements in fragments of bounded arithmetic, Technical Report CMU-PHIL-43, Carnegie-Mellon University, Department of Philosophy, Pittsburgh, Pennsylvania, 01 1994; Annals of Pure and Applied Logic (to appear).
Cook, Stephen, Feasibly constructive proofs and the propositional calculus, Proceedings of the Seventh Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1975, pp. 83–97.
Ferreira, Fernando J. I., Polynomial time computable arithmetic, Logic and computation (Sieg, W., editor), Contemporary Mathematics, vol 106, American Mathematical Society, Providence, Rhode Island, 1990, pp. 137–156.
Ferreira, Fernando J. I., Polynomial time computable arithmetic and conservative extensions, Ph.D. thesis, Penn-sylvania State University, University Park, Pennsylvania, 1988.
Ferreira, Fernando J. I., Stockmeyer induction, Feasible Mathematics (Buss, S. R. and Scott, P. J., editors), Proceedings of the Mathematical Sciences Institute workshop, Ithaca, New York, 06 1989, Birkhäuser, Boston, Massachusetts, 1990, pp. 161–180.
Hájek, P. and Pudlák, P., Metamathematics of first-order arithmetic, Springer-Verlag, Berlin, 1992.
Ignjatović, Aleksandar, Delineating classes of computational complexity via second order theories with weak set existence principles. I, Technical report CMU-PHIL-22, Department of Philosophy, Carnegie-Mellon University, Pittsburgh, Pennsylvania, 11 1991.
Ignjatović, Aleksandar, Induction in theories of bounded arithmetic, manuscript in preparation.
Ignjatović, Aleksandar and Sieg, Wilfried, Herbrand analysis of some theories with weak set existence principles, manuscript in preparation.
Leivant, Daniel, A foundational delineation of computational feasibility, draft (07 1991).
Pudlák, Pavel, A note on bounded arithmetic, Fundamenta Mathematicae, vol. 136 (1990), pp. 85–89.
Solovay, Robert, Letter to P. Hájek, August 1976.