- Andrés Cordón–Franco, F. Félix Lara–Martín, 7318, How the World Computes, 2012, 440
- Henning Basold, Ekaterina Komendantskaya, Yue Li, 11423, Programming Languages and Systems, 2019, 783
- Evgeny Kolmakov, “Local reflection, definable elements and 1-provability”, Arch. Math. Logic, 59, № 7-8, 2020, 979
- Emil Jeřábek, “Induction rules in bounded arithmetic”, Arch. Math. Logic, 59, № 3-4, 2020, 461
- A. Cordón-Franco, A. Fernández-Margarit, F. F. Lara-Martín, “A note on parameter free Π1-induction and restricted exponentiation”, Mathematical Logic Quarterly, 57, № 5, 2011, 444
- Michael Rathjen, “2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10”, Bull. symb. log, 17, № 2, 2011, 272
- E. A. Kolmakov, L. D. Beklemishev, “Axiomatizing Provable n-Provability”, Dokl. Math., 98, № 3, 2018, 582
- Andrés Cordón-Franco, F. Félix Lara-Martín, “Local induction and provably total computable functions”, Annals of Pure and Applied Logic, 165, № 9, 2014, 1429
- EVGENY KOLMAKOV, LEV BEKLEMISHEV, “AXIOMATIZATION OF PROVABLE n-PROVABILITY”, J. symb. log., 84, № 02, 2019, 849
- Лев Дмитриевич Беклемишев, Lev Dmitrievich Beklemishev, “Схемы рефлексии и алгебры доказуемости в формальной арифметике”, УМН, 60, № 2, 2005, 3