1. Bounded Arithmetic (Bibliopolis, 1986).
2. Relating the bounded arithmetic and polynomial time hierarchies
3. First-order proof theory of arithmetic. In: Handbook of Proof Theory (S. R. Buss, ed.). Studies in Logic and the Foundations of Mathematics 137, pp. 79–147 (Elsevier, 1998).
4. The intrinsic computational difficulty of functions. In: Proceedings of the 2nd International Congress of Logic, Methodology and Philosophy of Science (Y. Bar-Hillel, ed.), pp. 24–30 (North-Holland, 1965).
5. Feasibly constructive proofs and the propositional calculus. In: Proceedings of the 7th Annual ACM Symposium on Theory of Computing, pp. 83–97 (ACM Press, 1975).