- Wolfgang Rautenberg, A Concise Introduction to Mathematical Logic, 2010, 269
- Lev Dmitrievich Beklemishev, “Исчисление для схем рефлексии и спектры консервативности”, Успехи математических наук, 73, № 4(442), 2018, 3
- Lev D. Beklemishev, “Parameter free induction and provably total computable functions”, Theoretical Computer Science, 224, № 1-2, 1999, 13
- Carlo Nicolai, Lorenzo Rossi, “Principles for Object-Linguistic Consequence: from Logical to Irreflexive”, J Philos Logic, 47, № 3, 2018, 549
- Anton Freund, “Slow reflection”, Annals of Pure and Applied Logic, 168, № 12, 2017, 2103
- L. D. Beklemishev, “Reflection calculus and conservativity spectra”, Russ. Math. Surv., 73, № 4, 2018, 569
- LEV BEKLEMISHEV, “Notes on local reflection principles”, Theoria, 63, № 3, 1997, 139
- Eduardo Hermo Reyes, Joost J. Joosten, “The Logic of Turing Progressions”, Notre Dame J. Formal Logic, 61, № 1, 2020
- Лев Дмитриевич Беклемишев, Lev Dmitrievich Beklemishev, “Схемы рефлексии и алгебры доказуемости в формальной арифметике”, УМН, 60, № 2, 2005, 3
- Marianna Antonutti Marfori, Leon Horsten, “Human-Effective Computability†”, Philosophia Mathematica, 27, № 1, 2019, 61