Список публикаций: |
|
|
2021 |
1. |
В. С. Атабекян, Л. Д. Беклемишев, В. С. Губа, И. Г. Лысёнок, А. А. Разборов, А. Л. Семенов, “Вопросы алгебры и математической логики. Научное наследие С. И. Адяна”, УМН, 76:1(457) (2021), 3–30 |
2. |
В. С. Атабекян, Л. Д. Беклемишев, В. М. Бухштабер, С. С. Гончаров, В. С. Губа, Ю. Л. Ершов, В. В. Козлов, И. Г. Лысёнок, С. П. Новиков, Ю. С. Осипов, М. Р. Пентус, В. В. Подольский, А. А. Разборов, В. А. Садовничий, А. Л. Семенов, А. Л. Таламбуца, Д. В. Трещев, Л. Н. Шеврин, “Сергей Иванович Адян (некролог)”, УМН, 76:1(457) (2021), 191–194 |
|
2020 |
3. |
L. Beklemishev, A. Dmitrieva, J. Makowsky, Axiomatizing Origami planes, 2020 , 25 pp., arXiv: 2012.03250 |
4. |
Л. Д. Беклемишев, А. В. Васильев, Е. П. Вдовин, С. С. Гончаров, В. В. Козлов, П. С. Колесников, В. Д. Мазуров, Ю. В. Матиясевич, А. С. Морозов, А. Н. Паршин, В. Г. Пузаренко, М. В. Швидефски, “Юрий Леонидович Ершов (к восьмидесятилетию со дня рождения)”, УМН, 75:3(453) (2020), 191–194 ; L. D. Beklemishev, A. V. Vasil'ev, E. P. Vdovin, S. S. Goncharov, V. V. Kozlov, P. S. Kolesnikov, V. D. Mazurov, Yu. V. Matiyasevich, A. S. Morozov, A. N. Parshin, V. G. Puzarenko, M. V. Schwidefsky, “Yurii Leonidovich Ershov (on his 80th birthday)”, Russian Math. Surveys, 75:3 (2020), 581–585 |
|
2019 |
5. |
Lev D. Beklemishev, Fedor N. Pakhomov, Reflection algebras and conservation results for theories of iterated truth, 2019 , 48 pp., arXiv: 1908.10302 |
6. |
E. A. Kolmakov, L. D. Beklemishev, “Axiomatization of provable $n$-provability”, J. Symb. Log., 84:2 (2019), 849–869 (cited: 1) (cited: 1) |
7. |
С. И. Адян, Н. Н. Андреев, Л. Д. Беклемишев, С. С. Гончаров, Ю. Л. Ершов, Ю. В. Матиясевич, Ю. С. Осипов, М. Р. Пентус, В. А. Плунгян, Е. В. Рахилина, В. А. Садовничий, А. Л. Семёнов, С. Г. Татевосов, В. М. Тихомиров, А. Х. Шень, “Владимир Андреевич Успенский (27.11.1930–27.06.2018)”, УМН, 74:4(448) (2019), 165–180 ; S. I. Adian, N. N. Andreev, L. D. Beklemishev, S. S. Goncharov, Yu. L. Ershov, Yu. V. Matiyasevich, Yu. S. Osipov, M. R. Pentus, V. A. Plungyan, E. V. Rakhilina, V. A. Sadovnichii, A. L. Semenov, S. G. Tatevosov, V. M. Tikhomirov, A. Kh. Shen, “Vladimir Andreevich Uspensky (27/11/1930–27/6/2018)”, Russian Math. Surveys, 74:4 (2019), 735–753 |
8. |
В. А. Александров, Л. Д. Беклемишев, В. М. Бухштабер, А. Ю. Веснин, А. А. Гайфуллин, Н. П. Долбилин, Н. Ю. Ероховец, М. Д. Ковалев, В. С. Макаров, С. П. Новиков, Д. О. Орлов, А. Н. Паршин, И. Х. Сабитов, Д. В. Трещев, О. К. Шейнман, Е. В. Щепин, “Михаил Иванович Штогрин (к восьмидесятилетию со дня рождения)”, УМН, 74:6(450) (2019), 194–197 ; V. A. Alexandrov, L. D. Beklemishev, V. M. Buchstaber, A. Yu. Vesnin, A. A. Gaifullin, N. P. Dolbilin, N. Yu. Erokhovets, M. D. Kovalev, V. S. Makarov, S. P. Novikov, D. O. Orlov, A. N. Parshin, I. Kh. Sabitov, D. V. Treschev, O. K. Sheinman, E. V. Shchepin, “Mikhail Ivanovich Shtogrin (on his 80th birthday)”, Russian Math. Surveys, 74:6 (2019), 1159–1162 |
9. |
Л.Д. Беклемишев, “Математика и логика”, Математическая составляющая, ред. Н.Н. Андреев, С.П. Коновалов и Н.А. Панюнин, 2019, 242–261 book.etudes.ru/toc/mathnlogic/ |
|
2018 |
10. |
Lev Beklemishev, “A note on strictly positive logics and word rewriting systems”, Larisa Maximova on Implication, Interpolation, and Definability, Outst. Contrib. Log., 15, eds. Sergei Odintsov, Springer, Berlin, Heidelberg, 2018, 61–70 (cited: 3) (cited: 5) |
11. |
Л. Д. Беклемишев, “Исчисление для схем рефлексии и спектры консервативности”, УМН, 73:4(442) (2018), 3–52 ; L. D. Beklemishev, “Reflection calculus and conservativity spectra”, Russian Math. Surveys, 73:4 (2018), 569–613 (cited: 1) |
12. |
Lev D. Beklemishev, “A universal algebra for the variable-free fragment of $RC^\nabla$”, Logical Foundations of Computer Science, International Symposium, LFCS 2018, Lecture Notes in Comput. Sci., 10703, Springer, Berlin, Heidelberg, 2018, 91–106 (cited: 2) (cited: 3) |
13. |
Gerald Berger, L. D. Beklemishev, Hans Tompits, “A many-sorted variant of Japaridze's polymodal provability logic”, Log. J. IGPL, 26:5 (2018), 505–538 |
14. |
L. D. Beklemishev, A universal Kripke frame for the variable-free fragment of $RC^\nabla$, 2018 , 5 pp., arXiv: 1804.02641 |
15. |
Е. А. Колмаков, Л. Д. Беклемишев, “Аксиоматизация доказуемой $n$-доказуемости”, Докл. РАН, 483:3 (2018), 244–248 ; E. A. Kolmakov, L. D. Beklemishev, “Axiomatizing provable $n$-provability”, Dokl. Math., 98:3 (2018), 582–585 |
|
2017 |
16. |
Lev D. Beklemishev, Reflection calculus and conservativity spectra, 2017 , 28 pp., arXiv: 1703.09314 |
17. |
Л. Д. Беклемишев, “О свойстве редукции для $GLP$-алгебр”, Докл. РАН, 472:4 (2017), 378–382 (цит.: 1) (цит.: 3) ; L. D. Beklemishev, “On the Reduction Property for GLP-Algebras”, Dokl. Math., 95:1 (2017), 50–54 (cited: 3) (cited: 3) |
18. |
Lev D. Beklemishev, “On the reflection calculus with partial conservativity operators”, Lecture Notes in Comput. Sci., 10388, 2017, 48–67 (cited: 5) (cited: 6) |
19. |
Lev Beklemishev, “Guest Editorial: Computer Science Symposium in Russia”, Theory Comput. Syst., 61:2 (2017), 462–463 https://link.springer.com/content/pdf/10.1007 |
|
2016 |
20. |
L. D. Beklemishev, “Proof theoretic analysis by iterated reflection”, Turing's revolution, Part II, Birkhäuser/Springer, Cham, 2016, 225–270 (cited: 1) |
21. |
Lev Beklemishev, Tommaso Flaminio, “Franco Montagna's work on provability logic and many-valued logic”, Studia Logica, 104:1 (2016), 1–46 |
22. |
L. D. Beklemishev, Notes on a reduction property for GLP-algebras, 2016 , 8 pp., arXiv: 1606.00290 |
23. |
Lev Beklemishev, Daniyar Shamkanov, “Some abstract versions of Gödel's second incompleteness theorem based on non-classical logics”, Liber Amicorum Alberti: A tribute to Albert Visser, Tributes, 30, eds. Jan van Eijck, Rosalie Iemhoff and Joost J. Joosten, College Publications, London, 2016, 15–29 url, arXiv: 1602.05728 |
24. |
Gerald Berger, Lev D. Beklemishev, Hans Tompits, A Many-Sorted Variant of Japaridze's Polymodal Provability Logic, 2016 , 15 pp., arXiv: 1601.02857 |
25. |
Lev Beklemishev, “Notes on a reduction property of GLP-algebras”, 11th International Conference on Advances in Modal Logic, Short Papers (Budapest, 30 August – 2 September, 2016), 2016, 7–13 |
26. |
Advances in Modal Logic, v. 11, eds. Lev Beklemishev, Stephane Demri, Andras Mate, College Publications, London, 2016 , xii+570 pp. |
|
2015 |
27. |
L. D. Beklemishev, A note on strictly positive logics and word rewriting systems, 2015 , 8 pp., arXiv: 1509.00666 |
28. |
Л. Д. Беклемишев, А. А. Оноприенко, “О некоторых медленно сходящихся системах преобразований термов”, Матем. сб., 206:9 (2015), 3–20 (цит.: 3) (цит.: 4) ; L. D. Beklemishev, A. A. Onoprienko, “On some slowly terminating term rewriting systems”, Sb. Math., 206:9 (2015), 1173–1190 (cited: 4) (cited: 4) |
29. |
L. D. Beklemishev, D. V. Musatov (eds.), Computer Science – Theory and Applications, 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13–17, 2015, Proceedings, Lecture Notes in Computer Science, 9139, Springer, 2015 , xx+443 pp. |
|
2014 |
30. |
L. D. Beklemishev, D. Fernández-Duque, J. J. Joosten, “On provability logics with linearly ordered modalities”, Studia Logica, 102:3 (2014), 541–566 , arXiv: 1210.4809 (cited: 9) (cited: 1) |
31. |
L. Beklemishev, “Positive provability logic for uniform reflection principles”, Ann. Pure Appl. Logic, 165:1 (2014), 82–105 (cited: 11) (cited: 14) |
32. |
L. Beklemishev, Y. Gurevich, “Propositional primal logic with disjunction”, J. Logic Comput., 24:1 (2014), 257–282 (cited: 8) (cited: 5) (cited: 12) |
33. |
L. Beklemishev, D. Gabelaia, “Topological interpretations of provability logic”, Leo Esakia on duality in modal and intuitionistic logics, Outstanding Contributions to Logic, 4, eds. G. Bezhanishvili, Springer, 2014, 257–290 , arXiv: 1210.7317 (cited: 7) |
34. |
Lev Beklemishev, Ruy De Queiroz, Andre Scedrov, “Editors' foreword”, Journal of Computer and System Sciences, 80:6, Special Issue: 18th Workshop on Logic, Language, Information and Computation (WoLLIC 2011) (2014), 1037 |
|
2013 |
35. |
L. Beklemishev, D. Gabelaia, “Topological completeness of the provability logic GLP”, Ann. Pure Appl. Logic, 164:12 (2013), 1201–1223 , arXiv: 1106.5693 (cited: 11) (cited: 4) (cited: 13) |
36. |
Л. Д. Беклемишев, “Позитивные логики доказуемости”, Международная конференция “Мальцевские чтения”. Тезисы докладов (Новосибирск, 11–15 ноября 2013 г.), ФГБУН Институт математики им. С.Л. Соболева СО РАН; Новосибирский государственный университет, Новосибирск, 2013, 10 www.math.nsc.ru/conference/malmeet/13/maltsev13.pdf |
|
2012 |
37. |
L. D. Beklemishev, “Calibrating provability logic: from modal logic to reflection calculus”, Advances in Modal Logic, 9, eds. T. Bolander, T. Braüner, S. Ghilardi, L. Moss, College Publications, London, 2012, 89–94 |
38. |
L. Beklemishev, “DKAL: A Distributed Knowledge Authorization Language and Its Logic of Information”, Computer Science – Theory and Applications. 7th International Computer Science Symposium in Russia, CSR 2012 (Nizhny Novgorod, Russia, July 3–7, 2012), Lecture Notes in Computer Science, 7353, eds. E. Hirsch, J. Karhumäki, A. Lepistö, M. Prilutskii, Springer, 2012, XIII–XIV |
39. |
L. Beklemishev, G. Bezhanishvili, D. Mundici, Y. Venema, “Foreword [Special issue dedicated to the memory of Leo Esakia]”, Studia Logica, 100:1-2 (2012), 1–7 (cited: 1) |
|
2011 |
40. |
L. Beklemishev, Y. Gurevich, Propositional primal logic with disjunction, Microsoft Research Technical Report MSR-TR-2011-35, Redmond, 2011 , 31 pp. http://research.microsoft.com/apps/pubs/default.aspx?id=146631 |
41. |
Л. Д. Беклемишев, “Упрощëнное доказательство теоремы об арифметической полноте для логики доказуемости GLP”, Тр. МИАН, 274, 2011, 32–40 (цит.: 9) (цит.: 9) (цит.: 2); L. D. Beklemishev, “A simplified proof of arithmetical completeness theorem for provability logic GLP”, Proc. Steklov Inst. Math., 274:1 (2011), 25–33 (cited: 9) (cited: 3) (cited: 6) |
42. |
L. Beklemishev, “Ordinal completeness of bimodal provability logic GLB”, Logic, language, and computation, 8th International Tbilisi Symposium TbiLLC 2009, Lecture Notes in Comput. Sci., 6618, eds. N. Bezhanishvili et al., Springer, Heidelberg, 2011, 1–15 (cited: 5) (cited: 5) |
43. |
Л. Д. Беклемишев, В. М. Бухштабер, И. Г. Лысëнок, А. А. Мальцев, С. П. Новиков, А. А. Разборов, А. Л. Семëнов, “Сергей Иванович Адян (к восьмидесятилетию со дня рождения)”, УМН, 66:1(397) (2011), 199–200 ; L. D. Beklemishev, V. M. Buchstaber, I. G. Lysenok, A. A. Mal'tsev, S. P. Novikov, A. A. Razborov, A. L. Semenov, “Sergei Ivanovich Adian (on his eightieth birthday)”, Russian Math. Surveys, 66:1 (2011), 197–198 |
44. |
L. Beklemishev, R. de Queiroz (eds.), Logic, language, information, and computation, 18th International Workshop, WoLLIC 2011 (Philadelphia, PA, USA, May 18–20, 2011), Proceedings, Lecture Notes in Comput. Sci., 6642, Springer, 2011 , x+311 pp. |
45. |
Алгоритмические вопросы алгебры и логики, Сборник статей. К 80-летию со дня рождения академика Сергея Ивановича Адяна, Тр. МИАН, 274, ред. Л. Д. Беклемишев, Е. Ф. Мищенко, МАИК «Наука/Интерпериодика», М., 2011 , 351 с. |
46. |
Л. Д. Беклемишев, “Предисловие”, Алгоритмические вопросы алгебры и логики, Сборник статей. К 80-летию со дня рождения академика Сергея Ивановича Адяна, Тр. МИАН, 274, МАИК, М., 2011, 7–9 ; L. D. Beklemishev, “Foreword”, Proc. Steklov Inst. Math., 274 (2011), 1–3 (cited: 16) (cited: 16) |
47. |
S. Adian, L. Beklemishev, A. Visser, “Proof and Computation”, J. Logic Computation, 21:4 (2011), 541–542 |
|
2010 |
48. |
Л. Д. Беклемишев, “Теоремы Гëделя о неполноте и границы их применимости. I”, УМН, 65:5(395) (2010), 61–106 (цит.: 3) (цит.: 2) (цит.: 7); L. D. Beklemishev, “Gödel incompleteness theorems and the limits of their applicability. I”, Russian Math. Surveys, 65:5 (2010), 857–899 (cited: 2) (cited: 1) (cited: 4) |
49. |
L. D. Beklemishev, “Kripke semantics for provability logic GLP”, Ann. Pure Appl. Logic, 161:6 (2010), 756–774 (cited: 15) (cited: 11) (cited: 18) |
50. |
L. Beklemishev, V. Goranko, V. Shehtman (eds.), Advances in Modal Logic, 8, College Publications, London, 2010 , ix+505 pp. |
51. |
L. Beklemishev, G. Bezhanishvili, T. Icard, “On topological models of GLP”, Ways of proof theory, Ontos Mathematical Logic, 2, eds. R. Schindler, Ontos Verlag, Frankfurt, 2010, 133–153 |
52. |
L. Beklemishev, “On the Craig interpolation and the fixed point properties of GLP”, Proofs, categories and computations, Tributes, 13, eds. S. Feferman et al., College Publications, London, 2010, 49–60 |
|
2007 |
53. |
L. Beklemishev, “Review of “Gödel's Theorem: an incomplete guide to its use and abuse” by Torkel Franzén”, Bulletin of Symbolic Logic, 13:2 (2007), 241–243 |
|
2006 |
54. |
L. D. Beklemishev, “The Worm principle”, Logic Colloquium '02 (Münster, 2002), Lect. Notes Log., 27, Assoc. Symbol. Logic, La Jolla, CA, 2006, 75–95 (cited: 13) |
55. |
L. Beklemishev, A. Visser, “Problems in the logic of provability”, Mathematical problems from applied logic. I, Int. Math. Ser. (N. Y.), 4, Springer, New York, NY, 2006, 77–136 |
56. |
L. Beklemishev, “Representing Worms as a term rewriting system”, Logic, combinatorics and independence results, Oberwolfach Report, 52/2006, eds. A. Bovykin, L. Carlucci, A. Weiermann, Mathematisches Forschungsinstitut Oberwolfach, 2006, 7–9 |
57. |
Л. Д. Беклемишев, И. Г. Лысëнок, А. А. Мальцев, С. П. Новиков, М. Р. Пентус, А. А. Разборов, А. Л. Семëнов, В. А. Успенский, “Сергей Иванович Адян (к 75-летию со дня рождения)”, УМН, 61:3(369) (2006), 179–191 (цит.: 1) ; L. D. Beklemishev, I. G. Lysenok, A. A. Mal'tsev, S. P. Novikov, M. R. Pentus, A. A. Razborov, A. L. Semenov, V. A. Uspenskii, “Sergei Ivanovich Adian (on his 75th birthday)”, Russian Math. Surveys, 61:3 (2006), 575–588 |
58. |
L. Beklemishev, “Review of “David Hilbert and the axiomatization of physics (1898–-1918)” by Leo Corry”, Studies In History and Philosophy of Science, Part B: Studies In History and Philosophy of Modern Physics, 37:2 (2006), 388–390 |
|
2005 |
59. |
L. D. Beklemishev, A. Visser, “On the limit existence principles in elementary arithmetic and $\Sigma^0_n$-consequences of theories”, Ann. Pure Appl. Logic, 136:1-2 (2005), 56–74 (cited: 10) (cited: 5) (cited: 9) |
60. |
L. D. Beklemishev, J. J. Joosten, M. Vervoort, “A finitary treatment of the closed fragment of Japaridze's provability logic”, J. Logic Comput., 15:4 (2005), 447–463 (cited: 16) (cited: 3) (cited: 19) |
61. |
Л. Д. Беклемишев, “Схемы рефлексии и алгебры доказуемости в формальной арифметике”, УМН, 60:2(362) (2005), 3–78 (цит.: 42) (цит.: 35) ; L. D. Beklemishev, “Reflection principles and provability algebras in formal arithmetic”, Russian Math. Surveys, 60:2 (2005), 197–268 (cited: 35) (cited: 21) (cited: 38) |
62. |
S. I. Adian, M. Baaz, L. D. Beklemishev, “Editorial”, J. Logic Computation, 15:4 (2005), 409 |
|
2004 |
63. |
L. D. Beklemishev, “Provability algebras and proof-theoretic ordinals. I”, Ann. Pure Appl. Logic, 128:1-3 (2004), 103–123 (cited: 42) (cited: 28) (cited: 50) |
|
2003 |
64. |
L. D. Beklemishev, “Proof-theoretic analysis by iterated reflection”, Arch. Math. Logic, 42:6 (2003), 515–552 (cited: 30) (cited: 16) (cited: 32) |
65. |
L. D. Beklemishev, “On the induction schema for decidable predicates”, J. Symbolic Logic, 68:1 (2003), 17–34 (cited: 8) (cited: 6) (cited: 7) |
66. |
Л. Д. Беклемишев, “Бескванторная индукция и принцип наименьшего числа”, Математическая логика и алгебра, Сборник статей. К 100-летию со дня рождения академика Петра Сергеевича Новикова, Тр. МИАН, 242, Наука, М., 2003, 59–76 ; L. D. Beklemishev, “Quantifier-Free Induction Schema and the Least Element Principle”, Proc. Steklov Inst. Math., 242 (2003), 50–66 |
|
2002 |
67. |
A. L. Rastsvetaev, L. D. Beklemishev, “On the query complexity of finding a local maximum point”, Inform. Process. Lett., 84:6 (2002), 327–332 (cited: 2) (cited: 2) |
|
2001 |
68. |
L. Beklemishev, “Review of “On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness” by U. Kohlenbach”, Bulletin of Symbolic Logic, 7:1 (2001), 75–77 |
|
2000 |
69. |
L. Beklemishev, “Another pathological well-ordering”, Logic Colloquium '98 (Prague, 1998), Lect. Notes Log., 13, Assoc. Symbol. Logic, Urbana, IL, 2000, 105–108 |
|
1999 |
70. |
L. D. Beklemishev, “Open least element principle and bounded query computation”, Computer science logic (Madrid, 1999), Lecture Notes in Comput. Sci., 1683, Springer, Berlin, 1999, 389–404 (cited: 3) |
71. |
L. D. Beklemishev, “Classification of propositional provability logics”, Provability, complexity, grammars, Amer. Math. Soc. Transl. Ser. 2, 192, Amer. Math. Soc., Providence, RI, 1999, 1–56 |
72. |
L. Beklemishev, M. Pentus, N. Vereshchagin, Provability, complexity, grammars, Amer. Math. Soc. Transl. Ser. 2, 192, Amer. Math. Soc., Providence, RI, 1999 , x+172 pp. |
73. |
L. D. Beklemishev, “Parameter free induction and provably total computable functions”, Theoret. Comput. Sci., 224:1-2 (1999), 13–33 (cited: 16) (cited: 13) (cited: 20) |
|
1998 |
74. |
L. D. Beklemishev, “A proof-theoretic analysis of collection”, Arch. Math. Logic, 37:5-6 (1998), 275–296 (cited: 20) (cited: 18) (cited: 22) |
75. |
Л. Д. Беклемишев, Схемы рефлексии в формальной арифметике, Дисс. … докт. физ.-матем. наук, Математический институт им. В.А. Стеклова, Москва, 1998 , 149 с. |
76. |
L. Beklemishev, “Review of “Aspects of Incompleteness” by P. Lindström”, The Journal of Symbolic Logic, 63:4 (1998), 1606–1608 |
|
1997 |
77. |
L. Beklemishev, “Notes on local reflection principles”, Theoria, 63:3 (1997), 139–146 (cited: 8) |
78. |
L. D. Beklemishev, “Parameter free induction and reflection”, Computational logic and proof theory (Vienna, 1997), Lecture Notes in Comput. Sci., 1289, Springer, Berlin, 1997, 103–113 |
79. |
L. D. Beklemishev, “Induction rules, reflection principles, and provably recursive functions”, Ann. Pure Appl. Logic, 85:3 (1997), 193–242 (cited: 30) (cited: 28) (cited: 33) |
|
1996 |
80. |
L. Beklemishev, “Remarks on Magari algebras of $\mathrm{PA}$ and $\mathrm{I}\Delta_0+\mathrm{EXP}$”, Logic and algebra (Pontignano, 1994), Lecture Notes in Pure and Appl. Math., 180, Marcel Dekker, New York, 1996, 317–325 (cited: 3) |
81. |
L. D. Beklemishev, “Bimodal logics for extensions of arithmetical theories”, J. Symbolic Logic, 61:1 (1996), 91–124 (cited: 3) (cited: 7) (cited: 7) |
82. |
L. Beklemishev, “Review of “Diagonalization and Self-reference” by R. Smullyan”, The Journal of Symbolic Logic, 61:3 (1996), 1052–1055 |
|
1995 |
83. |
L. Beklemishev, “Iterated local reflection versus iterated consistency”, Ann. Pure Appl. Logic, 75:1-2 (1995), 25–48 (cited: 15) (cited: 5) (cited: 16) |
84. |
Л. Д. Беклемишев, “Об ограниченном правиле индукции и итерированных схемах рефлексии над кальмаровской элементарной арифметикой”, Теоретические и прикладные аспекты математических исследований, ред. О. Б. Лупанов, МГУ, Москва, 1995, 36–39 |
|
1994 |
85. |
L. D. Beklemishev, “On bimodal logics of provability”, Ann. Pure Appl. Logic, 68:2 (1994), 115–159 (cited: 6) (cited: 4) (cited: 8) |
|
1993 |
86. |
S. N. Artemov, L. D. Beklemishev, “On propositional quantifiers in provability logic”, Notre Dame J. Formal Logic, 34:3 (1993), 401–419 (cited: 10) |
87. |
L. D. Beklemishev, “On the complexity of arithmetical interpretations of modal formulae”, Arch. Math. Logic, 32:3 (1993), 229–238 (cited: 4) (cited: 1) (cited: 5) |
88. |
L. Beklemishev, “Review of papers by D. de Jongh, F. Montagna, and A. Carbone”, The Journal of Symbolic Logic, 58 (1993), 715–717 (cited: 5) |
|
1992 |
89. |
Л. Д. Беклемишев, “Независимые нумерации теорий и рекурсивных прогрессий”, Сиб. матем. журн., 33:5 (1992), 22–46 (цит.: 1); L. D. Beklemishev, “Independent enumerations of theories and recursive progressions”, Siberian Math. J., 33:5 (1992), 760–783 (cited: 1) (cited: 1) (cited: 2) |
90. |
Л. Д. Беклемишев, Классификация пропозициональных логик доказуемости, Дисс. … канд. физ.-матем. наук, Математический институт им. В.А. Стеклова РАН, Москва, 1992 |
|
1991 |
91. |
L. D. Beklemishev, “Provability logics for natural Turing progressions of arithmetical theories”, Studia Logica, 50:1 (1991), 107–128 (cited: 2) (cited: 9) |
|
1989 |
92. |
Л. Д. Беклемишев, “О классификации пропозициональных логик доказуемости”, Изв. АН СССР. Сер. матем., 53:5 (1989), 915–943 (цит.: 1) (цит.: 1); L. D. Beklemishev, “On the classification of propositional provability logics”, Math. USSR-Izv., 35:2 (1990), 247–275 (cited: 1) (cited: 5) |
93. |
Л. Д. Беклемишев, “Логика доказуемости без интерполяционного свойства Крейга”, Матем. заметки, 45:6 (1989), 12–22 (цит.: 1) ; L. D. Beklemishev, “Provability logic without Craig's interpolation property”, Math. Notes, 45:6 (1989), 437–450 |
|
1987 |
94. |
Л. Д. Беклемишев, “Нормализация выводов и интерполяция для некоторых логик доказуемости”, УМН, 42:6(258) (1987), 179–180 ; L. D. Beklemishev, “Normalization of deductions and interpolation for some logics of provability”, Russian Math. Surveys, 42:6 (1987), 223–224 |
|