Публикация сотрудников отдела

На главную страницу

English page

Об институте

Научная деятельность

Публикации

Правила оформления научных работ

Администрация

Ученый совет

Диссертационные советы

Отделы

Сотрудники

Аспирантура

Научно-образовательный центр

Базовая кафедра МФТИ

Базовая кафедра ФКН ВШЭ

Базовая кафедра матфака НИУ ВШЭ

Противодействие коррупции

Адрес института

Адрес: Россия, 119333, Москва, ул. Губкина, д. 8
Тел.: +7(495) 984 81 41
Сайт: www.mi-ras.ru
E-mail: steklov@mi-ras.ru

Посмотреть карту

Схема проезда

Отдел математической логики. Список публикаций

Штатные сотрудники МИАН Штатные и внештатные сотрудники МИАН

по годам

научные публикации

по типам




2026
1.	Karim F. Shamazov, Alexey L. Talambutsa, “On orbit sets generated by semigroups of one-dimensional affine functions”, Expo. Math., 44:3 (2026), 125765, 11 pp., arXiv: 2507.06875
2.	P.Kiyashko, A.Talambutsa, “A simple algorithm for checking equivalence of counting functions on free monoids”, International Journal of Algebra and Computation, 2026, 1–22 (to appear), arXiv: 2407.10569
3.	Daniyar Shamkanov, Cyclic proofs in the equational version of Primitive recursive arithmetic, 2026 (Published online), 10 pp., arXiv: https://arxiv.org/abs/2606.07166
4.	S. O. Speranski, A. V. Grefenshtein, “On the complexity of first-order logics of probability”, Изв. РАН. Сер. матем., 90:4 (2026), 105–126 ; S. O. Speranski, A. V. Grefenshtein, “On the complexity of first-order logics of probability”, Izv. Math., 90:4 (2026), 754–775
5.	S. O. Speranski, “On the theory of weak probability spaces”, Algebra and Logic, 2026 (to appear)
6.	С. О. Сперанский, “О замыкающих ординалах инфинитарных вероятностных исчислений”, Матем. заметки, 120:3 (2026), 470–483
7.	С. Л. Кузнецов, “Алгоритмическая сложность теорий с итерацией Клини”, УМН, 81:1(487) (2026), 137–204 ; S. L. Kuznetsov, “Algorithmic complexity of theories with Kleene iteration”, Russian Math. Surveys, 81:1 (2026), 125–188
8.	Stepan L. Kuznetsov, “On Lambek grammars with Kleene star”, Distributed Computing and Artificial Intelligence, Special Sessions I, 22nd International Conference (Lille, France, June 25–27, 2025), Lecture Notes in Networks and Systems, 1631, Springer, Cham, 2026, 85–95
9.	Max Kanovich, Stepan L. Kuznetsov, Andre Scedrov, “Complexity of equational theories for relational and language action lattices”, Relational and Algebraic Methods in Computer Science, 22nd International Conference, RAMiCS 2026 (Będlewo, Poland, April 7–10, 2026), Lecture Notes in Comput. Sci., 16526, eds. U. Fahrenberg, W. Fussner, L. Santocanale, Springer, 2026, 208–228	1 ^[x]
10.	Stepan L. Kuznetsov, “On syntactic concept lattice models for the Lambek calculus and infinitary action logic”, J. Logic Comput., 36:1 (2026), exaf078, 23 pp., arXiv: 2510.24853
11.	Stepan L. Kuznetsov, “A survey on language completeness of the Lambek calculus and its extensions”, Computational Linguistics, Information, Reasoning, and AI 2024, Stud. Comput. Intell., 1280, eds. R. Loukanova, Springer, 2026, 25–45
12.	Anupam Das, Abhishek De, Stepan L. Kuznetsov, “Undecidability for semirings with fixed points”, 11th International Conference on Formal Structures for Computation and Deduction (FSCD 2026) (Lisbon, July 20–23, 2026), Leibniz Internat. Proc. in Inform., 378, eds. F. Pfenning, Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, 2026, 15:1–15:18
13.	Stepan L. Kuznetsov, “Complexity of reasoning in Kleene algebra with sum-of-letters hypotheses”, Automated Reasoning, 13th International Conference, IJCAR 2026 (Lisbon, July 26–29, 2026), Part II, Lecture Notes in Artif. Intell., 16689, eds. A. Biere et al., Springer, 2026, 161–177

2025
14.	G. Blekherman, A. Raymond, A. Razborov, F. Wei, On Domination Exponents for Pairs of Graphs, 2025, 20 pp., arXiv: 2506.12151
15.	D. Ingram, A. Razborov, On the Range of the Permanent of (+1,-1)-Matrices, 2025, 13 pp., arXiv: 2507.09433
16.	I. G. Lysenok, “A sample iterated small cancellation theory for groups of Burnside type”, Изв. РАН. Сер. матем., 89:4 (2025), 111–218 ; Izv. Math., 89:4 (2025), 758–861
17.	С. В. Конягин, В. Ю. Протасов, А. Л. Таламбуца, “Единственность разложений в системах счисления и масштабирующие уравнения”, Матем. сб., 216:11 (2025), 135–149, arXiv: https://arxiv.org/abs/2502.13066 ; S. V. Konyagin, V. Yu. Protasov, A. L. Talambutsa, “Unique expansions in number systems via refinement equations”, Sb. Math., 216:11 (2025), 1614–1627	1 ^[x]
18.	A.Talambutsa, On the word problem for just infinite groups, 2025, 11 pp., arXiv: 2512.24266
19.	Lev D. Beklemishev, Fedor N. Pakhomov, “Automatic structures and the problem of natural well-orderings”, Model Theory, Computer Science, and Graph Polynomials: Festschrift in honor of Johann A. Makowsky, Trends in Mathematics, eds. K. Meyer, A. Rabinovich, E. Ravve, A. Villaveces, Birkhäuser, 2025, 91–109, arXiv: 2407.10198
20.	F. Pakhomov, G. Solda, “On Nash-Williams' Theorem regarding sequences with finite range”, Transactions of the AMS, 2025, 30 (to appear), arXiv: 2405.13842
21.	Hanul Jeon, Patrick Lutz, Fedor Pakhomov, James Walsh, Ranking theories via encoded β-models, 2025, 21 pp., arXiv: 2503.20470
22.	Fedor Pakhomov, Giovanni Soldà, Generalized Higman's Theorem and iterated ideals, 2025, 22 pp., arXiv: 2512.07685
23.	D. S. Shamkanov, “A realization theorem for the modal logic of transitive closure $\mathsf{K}^+$”, Изв. РАН. Сер. матем., 89:2 (2025), 189–212 ; Izv. Math., 89:2 (2025), 399–421	1 ^[x]
24.	Л. Д. Беклемишев, Д. С. Шамканов, И. Н. Смирнов, “Фрагменты арифметики и циклические выводы”, Матем. сб., 216:10 (2025), 3–28 ; L. D. Beklemishev, D. S. Shamkanov, I. N. Smirnov, “Fragments of arithmetic and cyclic proofs”, Sb. Math., 216:10 (2025), 1339–1362	1 ^[x]
25.	D. Shamkanov, (Non-)well-founded derivations in the provability logic GLP, 2025, 37 pp., arXiv: 2504.01388
26.	Stanislav O. Speranski, “Sharpening complexity results in quantified probability logic”, Log. J. IGPL, 33:3 (2025), jzae114, 21 pp.	5 ^[x]
27.	Stanislav O. Speranski, “An ‘elementary’ perspective on reasoning about probability spaces”, Log. J. IGPL, 33:2 (2025), jzae042, 23 pp.	4 ^[x]
28.	S. O. Speranski, “On the decision problem for quantified probability logics”, Изв. РАН. Сер. матем., 89:3 (2025), 193–211 ; S. O. Speranski, “On the decision problem for quantified probability logics”, Izv. Math., 89:3 (2025), 609–627	4 ^[x]
29.	В. Е. Карпов, С. О. Сперанский, “О наследственно неразрешимых фрагментах базовых элементарных теорий”, Матем. заметки, 118:1 (2025), 77–90 ; V. E. Karpov, S. O. Speranski, “On hereditarily undecidable fragments of basic elementary theories”, Mathematical Notes, 118:1 (2025), 95–107
30.	Stepan L. Kuznetsov, Tikhon Pshenitsyn, Stanislav O. Speranski, “Reasoning from hypotheses in *-continuous action lattices”, J. Symb. Log., 2025, 1–39 (Published online), arXiv: 2408.02118	1 ^[x]
31.	С. О. Сперанский, “О модификации Фиттинга теории истины по Крипке”, Докл. РАН. Матем., информ., проц. упр., 526 (2025), 36–39 ; S. O. Speranski, “On Fitting’s modification of Kripke’s theory of truth”, Doklady Mathematics, 2025 (to appear)
32.	С. Н. Артёмов, Л. Д. Беклемишев, С. С. Гончаров, Ю. Л. Ершов, С. П. Одинцов, В. В. Рыбаков, С. О. Сперанский, В. Б. Шехтман, В. Ф. Юн, “Лариса Львовна Максимова (некролог)”, УМН, 80:3(483) (2025), 179–182 ; S. N. Artemov, L. D. Beklemishev, S. S. Goncharov, Yu. L. Ershov, S. P. Odintsov, V. V. Rybakov, S. O. Speranski, V. B. Shehtman, V. F. Yun, “Larisa L'vovna Maksimova (obituary)”, Russian Math. Surveys, 80:3 (2025), 533–536
33.	А. Л. Семенов, М. А. Бабенко, А. Я. Белов, Н. К. Верещагин, М. Е. Вишникин, Е. Е. Золин, В. Н. Крупский, С. Л. Кузнецов, В. А. Любецкий, А. А. Оноприенко, М. Р. Пентус, С. Ф. Сопрунов, А. А. Сорокин, В. Б. Шехтман, Т. Л. Яворская, “Кафедра математической логики и теории алгоритмов”, Вестн. Моск. ун-та. Сер. 1. Матем., мех., 2025, № 1, 23–32 ; A. L. Semenov, M. A. Babenko, A. Ya. Belov, N. K. Vereshchagin, M. E. Vishnikin, E. E. Zolin, V. N. Krupski, S. L. Kuznetsov, V. A. Lyubetskii, A. A. Onoprienko, M. R. Pentus, S. F. Soprunov, A. A. Sorokin, V. B. Shehtman, T. L. Yavorskaya, “Chair of Mathematical Logic and Theory of Algorithms”, Moscow University Mathematics Bulletin, 80:1 (2025), 23–33	1 ^[x]
34.	Mikhail Valinkin, Stepan L. Kuznetsov, “Relational models for the Lambek calculus with local contraction subexponentials”, J. Logic Comput., 35:4 (2025), exaf030, 21 pp.

2024
35.	А. А. Разборов, “Миша Алехнович. 1978–2006”, Матем. просв., 33, МЦНМО, M., 2024, 151–153
36.	Pablo Barceló, Alexander Kozachinskiy, Anthony Widjaja Lin, Vladimir V. Podolskii, “Logical Languages Accepted by Transformer Encoders with Hard Attention”, The Twelfth International Conference on Learning Representations, {ICLR} 2024, Vienna, Austria, May 7-11, 2024, OpenReview.net, 2024, 1-11 https://openreview.net/forum?id=gbrHZq07mq
37.	Vladimir V. Podolskii and Dmitrii Sluch, “One-Way Communication Complexity of Partial XOR Functions”, 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia, LIPIcs, 2024, 116, 16 pp.
38.	Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, Vladimir V. Podolskii, “Towards Simpler Sorting Networks and Monotone Circuits for Majority”, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2024, August 28-30, 2024, London School of Economics, London, UK, LIPIcs, 2024, 50, 18 pp.
39.	Vladimir Podolskii, Victor Selivanov, “Complexity Aspects of the Extension of Wagner's Hierarchy to k-Partitions”, Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications, Electronic Proceedings in Theoretical Computer Science, 407, Open Publishing Association, 2024, 186–197
40.	Alexander I. Bufetov, Gabriel Nivasch, Fedor Pakhomov, “Generalized fusible numbers and their ordinals”, Ann. Pure Appl. Logic, 175 (2024), 103355, 25 pp.	1 ^[x]
41.	Juvenal Murwanashyaka, Fedor Pakhomov, Albert Visser, “There are no minimal essentially undecidable theories”, J. Logic Comput., 34:6 (2024), 1159–1171	5 ^[x]
42.	Aguilera J. P., Pakhomov F., The Logic of Correct Models, 2024, 20 pp., arXiv: 2402.15382
43.	J. P. Aguilera, F. Pakhomov, A. Weiermann, “Functorial fast-growing hierarchies”, Forum Math. Sigma, 12 (2024), 15, 16 pp.	2 ^[x]
44.	Anton Freund, Fedor Pakhomov, Giovanni Soldà, “The logical strength of minimal bad arrays”, Proc. Amer. Math. Soc., 152 (2024), 4993–5005, arXiv: 2304.00278	2 ^[x]
45.	Daniyar Shamkanov, “On algebraic and topological semantics of the modal logic of common knowledge $S4^C_I$”, Log. J. IGPL, 32:1 (2024), 164–179, arXiv: 2111.05676	1 ^[x]
46.	Daniyar Shamkanov, “On structural proof theory of the modal logic $K^+$ extended with infinitary derivations”, Log. J. IGPL, 2024, jzae121, 46 pp., arXiv: 2310.10309	3 ^[x]
47.	А. В. Грефенштейн, С. О. Сперанский, “О кванторной версии модальной логики Белнапа–Данна”, Матем. сб., 215:3 (2024), 37–69 ; A. V. Grefenshtein, S. O. Speranski, “On the quantified version of the Belnap–Dunn modal logic”, Sb. Math., 215:3 (2024), 323–354	2 ^[x]
48.	С. О. Сперанский, Теория внутренних множеств: Аксиоматический подход к нестандартному анализу, Лекции летней школы «Современная математика», Издательство МЦНМО, Москва, 2024, 32 с. препринт
49.	С. Л. Кузнецов, “Алгоритмическая сложность теорий коммутативных алгебр Клини”, Изв. РАН. Сер. матем., 88:2 (2024), 44–79 ; S. L. Kuznetsov, “Algorithmic complexity for theories of commutative Kleene algebras”, Izv. Math., 88:2 (2024), 236–269	3 ^[x]
50.	Stepan L. Kuznetsov, “Syntactic concept lattice models for infinitary action logic”, Logic, Language, Information, and Computation, 30th International Workshop, WoLLIC 2024 (Bern, Switzerland, June 10–13, 2024), Lecture Notes in Comput. Sci., 14672, Springer, Cham, 2024, 93–107	1 ^[x]
51.	С. Л. Кузнецов, Алгоритмические вопросы для субструктурных логик с итерацией Клини, Дисс. … докт. физ.-матем. наук, Математический институт им. В. А. Стеклова РАН, Москва, 2024, 266 с. (.pdf)
52.	S. L. Kuznetsov, “Strong conservativity and completeness for fragments of infinitary action logic”, Сиб. электрон. матем. изв., 21:2 (2024), 789–809	2 ^[x]

2023
53.	Theodoros Papamakarios, Alexander Razborov, “Space characterizations of complexity measures and size-space trade-offs in propositional proof systems”, J. Comput. Syst. Sci., 137 (2023), 20–36	1 ^[x]
54.	Leonardo N. Coregliano, Alexander A. Razborov, “Natural quasirandomness properties”, Random Structures Algorithms, 63:3 (2023), 624–688	3 ^[x]
55.	Аlexander Razborov, “Propositional Proof Complexity”, Proceedings of the 8th European Congress of Mathematics (Portoroz, 20–26 June 2021), EMS Press, 2023, 439-464 https://ems.press/content/book-files/28311
56.	А. Л. Таламбуца, Т. Хартник, “Быстрые алгоритмы для считающих функций на свободных группах и свободных моноидах”, Матем. сб., 214:10 (2023), 116–162, arXiv: 2109.14947 ; A. L. Talambutsa, T. Hartnick, “Efficient computations with counting functions on free groups and free monoids”, Sb. Math., 214:10 (2023), 1458–1499
57.	Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, Vladimir Podolskii, “Constant-Depth Sorting Networks”, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), Leibniz Internat. Proc. in Inform., 251, 2023, 43, 19 pp.
58.	J. P. Aguilera, F. Pakhomov, “The $\Pi^1_2$ consequences of a theory”, J. London Math. Soc., 107:3 (2023), 1045–1073, arXiv: 2109.11652	2 ^[x]
59.	Fedor Pakhomov, James Walsh, “Reducing $\omega$-model reflection to iterated syntactic reflection”, J. Math. Log., 23:2 (2023), 2250001, 38 pp.	2 ^[x]
60.	Anton Freund, Alberto Marcone, Fedor Pakhomov, Giovanni Soldà, Provable better quasi orders, 2023, 3 pp., arXiv: 2305.01066
61.	J. P. Aguilera, F. Pakhomov, A. Weiermann, “Modern perspectives in Proof Theory”, Philos. Trans. R. Soc. A, 381 (2023), 20220020, 11 pp.
62.	J. P. Aguilera, F. Pakhomov, “The spectrum of $\Pi^1_3$-soundness”, Philos. Trans. R. Soc. A, 381 (2023), 20220013, 18 pp.	1 ^[x]
63.	Stepan L. Kuznetsov, Stanislav O. Speranski, “Infinitary action logic with multiplexing”, Studia Logica, 111:2 (2023), 251–280	6 ^[x]
64.	С. О. Сперанский, “Элементарные инварианты для кванторной вероятностной логики”, Докл. РАН. Матем., информ., проц. упр., 510 (2023), 8–12 ; S. O. Speranski, “Elementary invariants for quantified probability logic”, Doklady Mathematics, 107 (2023), 93–96
65.	Stepan L. Kuznetsov, “Commutative action logic”, J. Logic Comput., 33:6 (2023), 1427–1462, arXiv: 2102.11639	4 ^[x]
66.	Stepan L. Kuznetsov, “Complexity of the Lambek calculus and its extensions”, Logic and Algorithms in Computational Linguistics 2021, LACompLing2021, Stud. Comput. Intell., 1081, Springer, Cham, 2023, 1–29
67.	Stepan L. Kuznetsov, “Proof disbalancing for proving complexity results: towards infinitary focusing”, The Proof Society Summer School and Workshop 2023. Booklet of Abstracts (Barcelona, July 10–14, 2023), University of Barcelona, 2023, 69–72 (pdf)
68.	Eben Blaisdell, Max Kanovich, Stepan L. Kuznetsov, Elaine Pimentel, Andre Scedrov, “Explorations in subexponential non-associative non-commutative linear logic”, Proceedings Modalities in substructural logics: Applications at the interfaces of logic, language and computation (AMSLO 2023), Ljubljana, Slovenia, August 7-8, 2023, Electron. Proc. Theor. Comput. Sci., 381, Open Publishing Association, 2023, 4–19, arXiv: 2308.05537v1
69.	Stepan L. Kuznetsov, “On the complexity of reasoning in Kleene algebra with commutativity conditions”, Theoretical Aspects of Computing – ICTAC 2023, Lima, Peru, December 4–8, 2023, Lecture Notes in Comput. Sci., 14446, Springer, Cham, 2023, 83–99	8 ^[x]
70.	Stepan L. Kuznetsov, “Relational models for the Lambek calculus with intersection and constants”, Log. Methods Comput. Sci., 19:4 (2023), 32, 27 pp., arXiv: 2210.00654	3 ^[x]

2022
71.	А. А. Разборов, “Еще раз о разреженных вершинных полуграфах в графах без треугольников”, Матем. сб., 213:1 (2022), 119–140 ; A. A. Razborov, “More about sparse halves in triangle-free graphs”, Sb. Math., 213:1 (2022), 109–128	4 ^[x]
72.	Alexander Razborov, “An extremal problem motivated by triangle-free strongly regular graphs”, J. Comb. Theory, Ser. B, 155 (2022), 52–82	1 ^[x]
73.	Nathan Mull, Shuo Pang, Alexander Razborov, “On CDCL-based proof systems with the ordered decision strategy”, SIAM J. Comput., 51:4 (2022), 1368–1399
74.	A. A. Razborov, Improved Convergence Guarantees for Shallow Neural Networks, 2022, arXiv: 2212.02323
75.	Theodoros Papamakarios, Alexander Razborov, “Space characterizations of complexity measures and size-space trade-offs in propositional proof systems”, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), July 4–8, 2022, Paris, France, Leibniz Internat. Proc. in Inform., 229, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, 100:1–100:20
76.	Laurent Bartholdi, Thorsten Groth, Igor Lysenok, “Commutator width in the first Grigorchuk group”, Groups Geom. Dyn., 16:2 (2022), 493–522	4 ^[x]
77.	Alexander Kolpakov, Alexey Talambutsa, “On free semigroups of affine maps on the real line”, Proc. Amer. Math. Soc., 150:6 (2022), 2301–2307, arXiv: 2105.09387	3 ^[x]
78.	Jean-Camille Birget, Alexey L. Talambutsa, “The symmetric Post Correspondence Problem, and errata for the freeness problem for matrix semigroups”, Int. J. Algebra Comput., 32:6 (2022), 1261–1274, arXiv: 2112.02408
79.	Alexander Kolpakov, Alexey Talambutsa, “Growth rates of Coxeter groups and Perron numbers”, Int. Math. Res. Not. IMRN, 2022:19 (2022), 14675–14696, arXiv: 1912.05608
80.	Anastasiya Chistopolskaya, Vladimir V. Podolskii, “On the Decision Tree Complexity of Threshold Functions”, Theory Comput. Syst., 66 (2022), 1074–1098	2 ^[x]
81.	Olga Gerasimova, Stanislav Kikot, Agi Kurucz, Vladimir Podolskii, Michael Zakharyaschev, “A tetrachotomy of ontology-mediated queries with a covering axiom”, Artif. Intell., 309 (2022), 103738, 46 pp.	1 ^[x]
82.	Vladimir Podolskii, Nikolay V. Proskurin, “Polynomial threshold functions for decision lists”, 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Leibniz Internat. Proc. in Inform., 248, 2022, 52:1–52:12
83.	Alexander Kozachinskiy, Vladimir Podolskii, “Multiparty Karchmer–Wigderson games and threshold circuits”, Theory Comput., 18 (2022), 15, 33 pp.
84.	С. О. Сперанский, Ф. Н. Пахомов, “Об отношении взаимной простоты с точки зрения монадической логики второго порядка”, Изв. РАН. Сер. матем., 86:6 (2022), 207–222 ; S. O. Speranski, F. N. Pakhomov, “On the coprimeness relation from the viewpoint of monadic second-order logic”, Izv. Math., 86:6 (2022), 1225–1239	2 ^[x]
85.	Lev D. Beklemishev, Fedor N. Pakhomov, “Reflection algebras and conservation results for theories of iterated truth”, Ann. Pure Appl. Logic, 173:5 (2022), 103093, 41 pp.	11 ^[x]
86.	Fedor Pakhomov, Albert Visser, “Finitely axiomatized theories lack self-comprehension”, Bull. Lond. Math. Soc., 54:6 (2022), 2513–2531, arXiv: 2109.02548	4 ^[x]
87.	Stepan L. Kuznetsov, Stanislav O. Speranski, “Infinitary action logic with exponentiation”, Annals of Pure and Applied Logic, 173:2 (2022), 103057, 29 pp., arXiv: 2001.06863	13 ^[x]
88.	S. O. Speranski, “Some remarks on Došen's logic N and its extensions”, Сиб. электрон. матем. изв., 19:2 (2022), 562–577
89.	Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “Language models for some extensions of the Lambek calculus”, Inform. and Comput., 287 (2022), 104760, 16 pp., arXiv: 2008.00070	8 ^[x]
90.	Max I. Kanovich, Stepan G. Kuznetsov, Stepan L. Kuznetsov, Andre Scedrov, “Decidable fragments of calculi used in CatLog”, Natural Language Processing in Artificial Intelligence — NLPinAI 2021, Stud. Comput. Intell., 999, Springer, Cham, 2022, 1–24	1 ^[x]
91.	Stepan L. Kuznetsov, “Reasoning in commutative Kleene algebras from *-free hypotheses”, Logica Yearbook 2021, College Publications, London, 2022, 99–113
92.	Eben Blaisdell, Max Kanovich, Stepan L. Kuznetsov, Elaine Pimentel, Andre Scedrov, “Non-associative, non-commutative multi-modal linear logic”, Automated Reasoning, 11th International Conference, IJCAR 2022 (Haifa, Israel, August 8–10, 2022), Lecture Notes in Comput. Sci., 13385, Springer, Cham, 2022, 449–467	4 ^[x]

2021
93.	Dhruv Mubayi, Alexander Razborov, “Polynomial to exponential transition in Ramsey theory”, Proc. London Math. Soc., 122:1 (2021), 69-92	9 ^[x]
94.	В. С. Атабекян, Л. Д. Беклемишев, В. С. Губа, И. Г. Лысёнок, А. А. Разборов, А. Л. Семенов, “Вопросы алгебры и математической логики. Научное наследие С. И. Адяна”, УМН, 76:1(457) (2021), 3–30 ; V. S. Atabekyan, L. D. Beklemishev, V. S. Guba, I. G. Lysenok, A. A. Razborov, A. L. Semenov, “Questions in algebra and mathematical logic. Scientific heritage of S. I. Adian”, Russian Math. Surveys, 76:1 (2021), 1–27
95.	В. С. Атабекян, Л. Д. Беклемишев, В. М. Бухштабер, С. С. Гончаров, В. С. Губа, Ю. Л. Ершов, В. В. Козлов, И. Г. Лысёнок, С. П. Новиков, Ю. С. Осипов, М. Р. Пентус, В. В. Подольский, А. А. Разборов, В. А. Садовничий, А. Л. Семенов, А. Л. Таламбуца, Д. В. Трещев, Л. Н. Шеврин, “Сергей Иванович Адян (некролог)”, УМН, 76:1(457) (2021), 191–194 ; V. S. Atabekyan, L. D. Beklemishev, V. M. Buchstaber, S. S. Goncharov, V. S. Guba, Yu. L. Ershov, V. V. Kozlov, I. G. Lysenok, S. P. Novikov, Yu. S. Osipov, M. R. Pentus, V. V. Podolskii, A. A. Razborov, V. A. Sadovnichii, A. L. Semenov, A. L. Talambutsa, D. V. Treschev, L. N. Shevrin, “Sergei Ivanovich Adian (obituary)”, Russian Math. Surveys, 76:1 (2021), 177–181
96.	Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov, “Clique is hard on average for regular resolution”, Journal of the ACM, 68:4 (2021), 23, 26 pp.	1 ^[x]
97.	L. N. Coregliano, A. A. Razborov, Biregularity in Sidorenkos Conjecture, 2021, 31 pp., arXiv: 2108.06599
98.	А. А. Разборов, “Первопроходцы теоретической информатики”, Троицкий вариант, Март 2021, 1-3 https://trv-science.ru/2021/03/pervoproxodcy-teoreticheskoj-informatiki/
99.	Igor Lysenok, Alexander Ushakov, “Orientable quadratic equations in free metabelian groups”, J. Algebra, 581 (2021), 303–326	6 ^[x]
100.	Л. Бабаи, К. А. Хансен, В. В. Подольский, Сяомин Сюн, “Веса точных пороговых функций”, Изв. РАН. Сер. матем., 85:6 (2021), 5–26 ; L. Babai, K. A. Hansen, V. V. Podolskii, Xiaoming Sun, “Weights of exact threshold functions”, Izv. Math., 85:6 (2021), 1039–1059
101.	М. Н. Вялый, В. В. Подольский, А. А. Рубцов, Д. А. Шварц, А. Шень, Лекции по дискретной математике, Издательский дом Высшей Школы Экономики, 2021, 496 с. https://id.hse.ru/books/429927775.html	1 ^[x]
102.	Fedor Pakhomov, James Walsh, “Reflection ranks and ordinal analysis”, J. Symb. Log., 86:4 (2021), 1350–1384, arXiv: 1805.02095	10 ^[x]
103.	Fedor Pakhomov and James Walsh, Reflection ranks via infinitary derivations, 2021, 11 pp., arXiv: 2107.03521
104.	Yury Savateev, Daniyar Shamkanov, “Non-well-founded proofs for the Grzegorczyk modal logic”, Rev. Symb. Log., 14:1 (2021), 22–50	11 ^[x]
105.	Stanislav O. Speranski, “Negation as a modality in a quantified setting”, Journal of Logic and Computation, 31:5 (2021), 1330–1355	6 ^[x]
106.	С. О. Сперанский, “О модальной логике бирешёток и её расширениях”, Алгебра и логика, 60:6 (2021), 612–635 ; S. O. Speranski, “Modal bilattice logic and its extensions”, Algebra and Logic, 60:6 (2022), 407–424