Adamowicz, Zofia, On tableaux consistency in weak theories, preprint # 618, Institute of Mathematics, Polish Academy of Sciences, 34 pp., 2001.
Adamowicz, Zofia, Herbrand consistency and bounded arithmetic, Fundamenta Mathematical vol. 171 (2002), no. 3, pp. 279–292.
Adamowicz, Zofia and Zbierski, Pawel, On Herbrand consistency in weak arithmetic, Archive for Mathematical Logic, vol. 40 (2001), no. 6, pp. 399–413.
Adamowicz, Zofia and Zdanowski, Konrad, Lower bounds for the unprovability of Herbrand consistency in weak arithmetics, Fundamenta Mathematicae, vol. 212 (2011), no. 3, pp. 191–216.
Boolos, George S. and Jeffrey, Richard C., Computability and Logic, Cambridge University Press, 2007.
Buss, Samuel R., On Herbrand's theorem, Proceedings of the International Workshop on Logic and Computational Complexity, October 13-16, 1994 (Maurice, D. and Leivant, R., editors), Lecture Notes in Computer Science 960, Springer-Verlag, 1995, pp. 195–209.
Hájek, Petr and Pudlák, Pavel, Metamathematics of first-order arithmetic, Springer-Verlag, 1998.
Kołodziejczyk, Leszek A., On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories, this Journal, vol. 71 (2006), no. 2, pp. 624–638.
Krajíček, Jan, Bounded arithmetic, prepositional logic and complexity theory, Cambridge University Press, 1995.
Paris, Jeff B. and Wilkie, Alex J., Δ0 sets and induction, Proceedings of Open Days in Model Theory and Set Theory (Guzicki, W., Marek, W., Plec, A., and Rauszer, C., editors), Leeds University Press, 1981, pp. 237–248.
Pudlák, Pavel, Cuts, consistency statements and interpretations, this Journal, vol. 50 (1985), no. 2, pp. 423–441.
Salehi, Saeed, Unprovability of Herbrand consistency in weak arithmetics, Proceedings of the sixth ESSLLI student session, European Summer School for Logic, Language, and Information (Striegnitz, K., editor), 2001, pp. 265–274.
Salehi, Saeed, Herbrand consistency in arithmetics with bounded induction, Ph.D. Dissertation, Institute of Mathematics of the Polish Academy of Sciences, 2002, 84 pages, available on the net at http://saeedsalehi.ir/pphd.html.
Salehi, Saeed, Separating bounded arithmetical theories by Herbrand consistency, Journal of Logic and Computation, vol. 22 (2012), no. 3, pp. 545–560.
Willard, Dan E., How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic Q, this Journal, vol. 67 (2002), no. 1, pp. 465–496.
Willard, Dan E., Passive induction and a solution to a Paris-Wilkie open question, Annals of Pure and Applied Logic, vol. 146 (2007), no. 2–3, pp. 124–149.