77 citations to https://www.mathnet.ru/rus/rm1401
-
Paulo Guilherme Santos, Wilfried Sieg, Reinhard Kahle, “A new perspective on completeness and finitist consistency”, Journal of Logic and Computation, 2023
-
James Walsh, “Characterizations of ordinal analysis”, Annals of Pure and Applied Logic, 174:4 (2023), 103230
-
MATEUSZ ZBIGNIEW ŁEŁYK, “MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE”, J. symb. log., 88:2 (2023), 738
-
LESZEK ALEKSANDER KOŁODZIEJCZYK, KATARZYNA W. KOWALIK, KEITA YOKOYAMA, “HOW STRONG IS RAMSEY'S THEOREM IF INFINITY CAN BE WEAK?”, J. symb. log., 88:2 (2023), 620
-
David Ferná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. Bydžovský, “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