David Fernández-Duque, Konstnatinos Papafilippou, Joost J. Joosten, Lecture Notes in Computer Science, 13137, Logical Foundations of Computer Science, 2022, 52
ANTON FREUND, “A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH”, The Review of Symbolic Logic, 15:4 (2022), 880
Stefan Hetzl, Jannik Vierling, “Unprovability results for clause set cycles”, Theoretical Computer Science, 935 (2022), 21
Mateusz Łełyk, Carlo Nicolai, “A theory of implicit commitment”, Synthese, 200:4 (2022)
J.P. Aguilera, M. Baaz, J. Bydžovský, “The number of axioms”, Annals of Pure and Applied Logic, 173:5 (2022), 103078
Blanck R., “Hierarchical Incompleteness Results For Arithmetically Definable Extensions of Fragments of Arithmetic”, Rev. Symb. Log., 14:3 (2021), 624–644
Е. А. Колмаков, “Об одном усилении теоремы о неизоморфизме алгебр доказуемости”, Докл. РАН. Матем., информ., проц. упр., 499 (2021), 26–30 ; E. A. Kolmakov, “On a strengthening of the non-isomorphism theorem for provability algebras”, Dokl. Math., 104:1 (2021), 180–183
Joosten J.J., “Munchhausen Provability”, J. Symb. Log., 86:3 (2021), 1006–1034
Pakhomov F. Walsh J., “Reflection Ranks and Ordinal Analysis”, J. Symb. Log., 86:4 (2021), PII S0022481220000092, 1350–1384
Willard D.E., “About the Characterization of a Fine Line That Separates Generalizations and Boundary-Case Exceptions For the Second Incompleteness Theorem Under Semantic Tableau Deduction”, J. Logic Comput., 31:1 (2021), 375–392