David FernÁndez-Duque, Joost J Joosten, Fedor Pakhomov, Konstantinos Papafilippou, Andreas Weiermann, “Arithmetical and Hyperarithmetical Worm Battles”, Journal of Logic and Computation, 32, no. 8, 2022, 1558
Lev D. Beklemishev, 1289, Computational Logic and Proof Theory, 1997, 103
L. D. Beklemishev, 1683, Computer Science Logic, 1999, 389
Andrés Cordón–Franco, F. Félix Lara–Martín, 7318, How the World Computes, 2012, 440
Лев Дмитриевич Беклемишев, Lev Dmitrievich Beklemishev, “Схемы рефлексии и алгебры доказуемости в формальной арифметике”, УМН, 60, no. 2, 2005, 3
Andrés Cordón-Franco, Alejandro Fernández-Margarit, F. Félix Lara-Martín, “Envelopes, indicators and conservativeness”, MLQ - Math. Log. Quart., 52, no. 1, 2006, 51
Ján Komara, “On nested simple recursion”, Arch. Math. Logic, 50, no. 5-6, 2011, 617
Stefan Hetzl, Jannik Vierling, “Unprovability results for clause set cycles”, Theoretical Computer Science, 935, 2022, 21
Joost J. Joosten, “The Closed Fragment of the Interpretability Logic of PRA with a Constant for $\mathrm{I}\Sigma_1$”, Notre Dame J. Formal Logic, 46, no. 2, 2005
Reinhard Kahle, Isabel Oitavem, Paulo Guilherme Santos, “Numeral completeness of weak theories of arithmetic”, Journal of Logic and Computation, 2023, exad075