1. S. Bellantoni and S. Cook, A new recursion theoretic characterization of the polytime functions, Computational Complexity Vol. 2 (1992) pp. 97 - 110.
2. W. Buchholz, An independence result for ∏ 11 - CA + BI, Annals of Pure and Applied Logic Vol. 23 (1987) pp. 131 - 155.
3. W. Burr, Fragments of Heyting arithmetic, Journal of Symbolic Logic Vol. 65 (2000) pp. 1223 - 1240.
4. S.R. Buss, Bounded arithmetic, Bibliopolis (1986).
5. N. Cagman, G. E. Ostrin and S.S. Wainer, Proof theoretic complexity of low subrecursive classes, in F. L. Bauer and R. Steinbrueggen (Eds) Foundations of Secure Computation, NATO ASI Series F Vol. 175, IOS Press (2000) pp. 249 - 285.