[Bus86]Buss, S., Bounded arithmetic, Bibliopolis, 1986.
[CT06]Cook, S. and Thapen, N., The strength of replacement in weak arithmetic, ACM Transactions on Computational Logic, vol. 7 (2006), no. 4.
[Jer07] E. Jeřábek, On independence of variants of the weak pigeonhole principle, Journal of Logic and Computation, vol. 17 (2007), no. 3, pp. 587–604.
[Kra95] J. Krajíček, Bounded arithmetic, prepositional logic, and complexity theory, Cambridge University Press, 1995.
[Kra01] J. Krajíček, On the weak pigeonhole principle, Fundamenta Mathematicae, vol. 170 (2001), pp. 123–140.
[KP98] J. Krajíček and Pudlák, P., Some consequences of cryptographical conjectures for and EF, Information and Computation, vol. 140 (1998), pp. 82–89.
[MPW02]Maciel, A., Pitassi, T., and Woods, A. R., A new proof of the weak pigeonhole principle, Journal of Computer and System Sciences, vol. 64 (2002), pp. 843–872.
[PW85]Paris, J. B. and Wilkie, A. J., Counting problems in bounded arithmetic. Methods in mathematical logic, Lecture Notes in Mathematics, vol. 1130, Springer-Verlag, 1985, pp. 317–340.
[PWW88]Paris, J. B., Wilkie, A. J., and Woods, A. R., Provability of the pigeonhole principle and the existence of infinitely many primes, this Journal, vol. 53 (1988), pp. 1235–1244.
[Po1OO]Pollett, C., Multifunction algebras and the provability of PH ↓, Annals of Pure and Applied Logic, vol. 104 (2000), pp. 279–303.
[Res]Ressayre, J. P., A conservation result for systems of bounded arithmetic, unpublished manuscript, 1986.
[Th02]Thapen, N., A model-theoretic characterization of the weak pigeonhole principle, Annals of Pure and Applied Logic, vol. 118 (2002), pp. 175–195.
[Th05]Thapen, N., Structures interpretable in models of bounded arithmetic. Annals of Pure and Applied Logic, vol. 136 (2005), pp. 247–266.
[Zam96]Zambella, D., Notes on polynomially bounded arithmetic, this Journal, vol. 61 (1996), pp. 942–966.