- Fedor Nikolaevich Pakhomov, “Линейные $\mathrm{GLP}$-алгебры и их элементарные теории”, Известия Российской академии наук. Серия математическая, 80, № 6, 2016, 173
- Лев Дмитриевич Беклемишев, Lev Dmitrievich Beklemishev, “Схемы рефлексии и алгебры доказуемости в формальной арифметике”, УМН, 60, № 2, 2005, 3
- Lev D. Beklemishev, 10703, Logical Foundations of Computer Science, 2018, 91
- F N Pakhomov, “Linear $ \mathrm{GLP}$-algebras and their elementary theories”, Izv. Math., 80, № 6, 2016, 1159
- EVGENY KOLMAKOV, LEV BEKLEMISHEV, “AXIOMATIZATION OF PROVABLE n-PROVABILITY”, J. symb. log., 84, № 02, 2019, 849
- L. D. Beklemishev, Turing’s Revolution, 2015, 225
- Lev Beklemishev, 6618, Logic, Language, and Computation, 2011, 1
- Lev Beklemishev, David Gabelaia, “Topological completeness of the provability logic GLP”, Annals of Pure and Applied Logic, 164, № 12, 2013, 1201
- David Fernández-Duque, Eduardo Hermo-Reyes, “Deducibility and independence in Beklemishev's autonomous provability calculus”, Information and Computation, 287, 2022, 104758
- F. N. Pakhomov, “On elementary theories of ordinal notation systems based on reflection principles”, Proc. Steklov Inst. Math., 289, № 1, 2015, 194