Toshiyasu Arai, “Some results on cut-elimination, provable well-orderings, induction and reflection”, Annals of Pure and Applied Logic, 95, no. 1-3, 1998, 93
Emil Jeřábek, “Induction rules in bounded arithmetic”, Arch. Math. Logic, 59, no. 3-4, 2020, 461
EVGENY KOLMAKOV, LEV BEKLEMISHEV, “AXIOMATIZATION OF PROVABLE n-PROVABILITY”, J. symb. log., 84, no. 02, 2019, 849
EVGENY A. KOLMAKOV, “ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS”, The Review of Symbolic Logic, 17, no. 1, 2024, 206
Lev D. Beklemishev, “On the induction schema for decidable predicates”, J. symb. log., 68, no. 1, 2003, 17
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, no. 9, 2014, 1429
Lev D. Beklemishev, “Provability algebras and proof-theoretic ordinals, I”, Annals of Pure and Applied Logic, 128, no. 1-3, 2004, 103
Andrés Cordón-Franco, Alejandro Fernández-Margarit, F. Félix Lara-Martín, “Fragments of Arithmetic and true sentences”, Mathematical Logic Quarterly, 51, no. 3, 2005, 313
L. D. Beklemishev, Turing’s Revolution, 2015, 225
Joaquín Borrego-Díaz, Andrés Cordón-Franco, Francisco Félix Lara-Martín, “On Conditional Axioms and Associated Inference Rules”, Axioms, 13, no. 5, 2024, 306