77 citations to https://www.mathnet.ru/rus/rm1401
-
Kolmakov E., Beklemishev L., “Axiomatization of Provable N-Provability”, J. Symb. Log., 84:2 (2019), 849–869
-
Nicolai C., Piazza M., “the Implicit Commitment of Arithmetical Theories and Its Semantic Core”, Erkenntnis, 84:4 (2019), 913–937
-
Cieslinski C., “Minimalism and the Generalisation Problem: on Horwich'S Second Solution”, Synthese, 195:3, SI (2018), 1077–1101
-
Heck Jr. Richard G., “The Logical Strength of Compositional Principles”, Notre Dame J. Form. Log., 59:1 (2018), 1–33
-
Nicolai C., Rossi L., “Principles For Object-Linguistic Consequence: From Logical to Irreflexive”, J. Philos. Log., 47:3 (2018), 549–577
-
Л. Д. Беклемишев, “Исчисление для схем рефлексии и спектры консервативности”, УМН, 73:4(442) (2018), 3–52 ; L. D. Beklemishev, “Reflection calculus and conservativity spectra”, Russian Math. Surveys, 73:4 (2018), 569–613
-
Murzi J., Rossi L., “Reflection Principles and the Liar in Context”, Philos. Impr., 18:15 (2018), 1–18
-
Berger G., Beklemishev L.D., Tompits H., “A Many-Sorted Variant of Japaridze'S Polymodal Provability Logic”, Log. J. IGPL, 26:5 (2018), 505–538
-
Chao C., Seraji P., “Godel'S Second Incompleteness Theorem For SIGMA(N)-Definable Theories”, Log. J. IGPL, 26:2 (2018), 255–257
-
Kolmakov E.A., Beklemishev L.D., “Axiomatizing Provable N-Provability”, Dokl. Math., 98:3 (2018), 582–585