1. Bouton, C.: NIM, a game with a complete mathematical theory. Ann. Math. 3, 35–39 (1901)
2. Buss, S.R.: Bounded Arithmetic. Ph.D. dissertation, Princeton University (1985)
3. Cook, S.A., Nguyen, P.: Logical Foundations of Proof Complexity. ASL Perspectives in Logic Series. Cambridge University Press, Cambridge (2010)
4. Cook, S.A., Soltys, M.: Boolean programs and quantified propositional proof systems. Bull. Sect. Log. 28(3), 119–129 (1999)
5. Eguchi, N.: Characterising Complexity Classes by Inductive Definitions in Bounded Arithmetic. arXiv:1306.5559 [math.LO] (2014)