Lev D. Beklemishev, “Provability algebras and proof-theoretic ordinals, I”, Annals of Pure and Applied Logic, 128, № 1-3, 2004, 103
LESZEK ALEKSANDER KOŁODZIEJCZYK, “END-EXTENSIONS OF MODELS OF WEAK ARITHMETIC FROM COMPLEXITY-THEORETIC CONTAINMENTS”, J. symb. log., 81, № 3, 2016, 901
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
Reinhard Kahle, Isabel Oitavem, Paulo Guilherme Santos, “Numeral completeness of weak theories of arithmetic”, Journal of Logic and Computation, 2023, exad075
A.L. Rastsvetaev, L.D. Beklemishev, “On the query complexity of finding a local maximum point”, Information Processing Letters, 84, № 6, 2002, 327
Andrés Cordón-Franco, Alejandro Fernández-Margarit, F. Félix Lara-Martín, “Envelopes, indicators and conservativeness”, MLQ - Math. Log. Quart., 52, № 1, 2006, 51
Lev D. Beklemishev, “On the induction schema for decidable predicates”, J. symb. log., 68, № 1, 2003, 17
Wolfgang Burr, “Fragments of Heyting arithmetic”, J. symb. log., 65, № 3, 2000, 1223
Michael Rathjen, “2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10”, Bull. symb. log, 17, № 2, 2011, 272
Лев Дмитриевич Беклемишев, Lev Dmitrievich Beklemishev, “Схемы рефлексии и алгебры доказуемости в формальной арифметике”, УМН, 60, № 2, 2005, 3