78 citations to https://www.mathnet.ru/rus/rm1401
-
Kolmakov E.A., Beklemishev L.D., “Axiomatizing Provable N-Provability”, Dokl. Math., 98:3 (2018), 582–585
-
Lev D. Beklemishev, “A universal algebra for the variable-free fragment of $RC^\nabla$”, Lecture Notes in Comput. Sci., 10703 (2018), 91–106
-
Kikuchi M., Kurahashi T., “Generalizations of Gödel'S Incompleteness Theorems For SIGMA(N)-Definable Theories of Arithmetic”, Rev. Symb. Log., 10:4 (2017), 603–616
-
Fischer M., Nicolai C., Horsten L., “Iterated Reflection Over Full Disquotational Truth”, J. Logic Comput., 27:8 (2017), 2631–2651
-
Beklemishev L.D., “On the Reflection Calculus With Partial Conservativity Operators”, Logic, Language, Information, and Computation: 24Th International Workshop, Wollic 2017, London, UK, July 18-21, 2017, Proceedings, Lecture Notes in Computer Science, 10388, eds. Kennedy J., DeQueiroz R., Springer International Publishing Ag, 2017, 48–67
-
Cordon-Franco A., Fernandez-Duque D., Joosten J.J., Felix Lara-Martin F., “Predicativity Through Transfinite Reflection”, J. Symb. Log., 82:3 (2017), 787–808
-
Beklemishev L.D., “On the Reduction Property For Glp-Algebras”, Dokl. Math., 95:1 (2017), 50–54
-
Visser A., “Transductions in Arithmetic”, Ann. Pure Appl. Log., 167:3 (2016), 211–234
-
Kurahashi T., “Henkin Sentences and Local Reflection Principles For Rosser Provability”, Ann. Pure Appl. Log., 167:2 (2016), 73–94
-
Joosten J.J., “Turing–Taylor Expansions for Arithmetic Theories”, Stud. Log., 104:6 (2016), 1225–1243