Home page
Home page
Home page
Russian page
English page
Math-Net.Ru | MMS | Web of Science | Scopus | MathSciNet | zbMATH | Web-mail 

   
 About the Institute
 Staff publications
 Administration
 Academic Council
 Dissertation Councils
 Departments
Staff 
 Chair at MIPT
 Seminars
 Conferences
 Events
 Journals and Books
 In memoriam
 Photogallery
 Charter


    Address
8 Gubkina St. Moscow,
119991, Russia
Tel.: +7(495) 984 81 41
Fax: +7(495) 984 81 39
Web site: www.mi-ras.ru
E-mail: steklov@mi-ras.ru

View Map
Directions

   

Department of Mathematical Logic

| Seminars | Publications |
Staff
Beklemishev Lev Dmitrievich

Doctor Phys.-Math. Sci., Academician of RAS, Science Deputy Director, Head of Department, Chief Scientific Researcher
office: 324; tel.: +7 (495) 984 81 43, +7 (495) 984 81 41 * 37 44; e-mail: bekl@mi-ras.ru
Principal fields of research: Mathematical logic. Proof theory. Provability logic. Modal logic. Fragments of arithmetic.
Beklemishev Lev Dmitrievich
Kuznetsov Stepan L'vovich

Candidate Phys.-Math. Sci., Senior Scientific Researcher
office: 515; tel.: +7 (495) 984 81 41 * 37 44; e-mail: skuzn@inbox.ru
Personal page: https://homepage.mi-ras.ru/~sk/
Kuznetsov Stepan L'vovich
Lysenok Igor Geront'evich

Doctor Phys.-Math. Sci., Leading Scientific Researcher
office: 507; tel.: +7 (495) 984 81 41 * 37 52; e-mail: lysionok@mi-ras.ru
Principal fields of research: Combinatorial group theory. Algorithmic problems of group theory.
Onoprienko Anastasiya Aleksandrovna

Junior Researcher
Pakhomov Fedor Nikolaevich

Candidate Phys.-Math. Sci., Senior Scientific Researcher
e-mail: pakhfn@gmail.com
Principal fields of research: Proof theory, modal logic, decision problems.
Podolskii Vladimir Vladimirovich

Candidate Phys.-Math. Sci., Senior Scientific Researcher
office: 506; tel.: +7 (495) 984 81 41 * 37 46; e-mail: podolskii@mi-ras.ru
Personal page: https://homepage.mi-ras.ru/~podolskii/
Principal fields of research: Computational complexity theory.
Podolskii  Vladimir  Vladimirovich
Razborov Aleksandr Aleksandrovich

Doctor Phys.-Math. Sci., Corresponding Member of RAS, Chief Scientific Researcher
office: 506; tel.: +7 (495) 984 81 41 * 37 46; e-mail: razborov@mi-ras.ru
Personal page: https://homepage.mi-ras.ru/~razborov/
Principal fields of research: Complexity of proofs and computations.
Shamkanov Daniyar Salkarbekovich

Candidate Phys.-Math. Sci., Scientific Researcher, Senior Scientific Researcher
office: 515; tel.: +7 (495) 984 81 43; e-mail: daniyar.shamkanov@gmail.com
Principal fields of research: Proof theory. Nonclassical logics. Combinatory logic.
Speranski Stanislav Olegovich

Candidate Phys.-Math. Sci., Scientific Researcher
office: 508; e-mail: katze.tail@gmail.com
Personal page: https://homepage.mi-ras.ru/~speranski
Principal fields of research: probability logic, modal logic, computability theory.
Speranski Stanislav Olegovich
Talambutsa Alexey Leonidovich

Candidate Phys.-Math. Sci., Scientific Researcher
office: 507; tel.: +7 (495) 984 81 41 * 37 52; e-mail: altal@mi-ras.ru
Principal fields of research: Combinatorial group theory. Algorithmic problems for groups and semigroups.

Adian Sergei Ivanovich (01.01.1931 – 05.05.2020)

Doctor Phys.-Math. Sci., Academician of RAS

Principal fields of research: Algorithmic problems in algebras. Semigroups theory. Groups theory.
Makanin Gennadii Semenovich (19.05.1938 – 18.05.2017)

Doctor Phys.-Math. Sci., Out-Of-Staff Member

Principal fields of research: Combinatorial group theory. Algorithmic problems of semigropus theory.
Top
Seminars
"Algorithmic problems in algebra and logic" (S.I.Adian seminar)
MSU, auditorium 16-04
"Geometric group theory"
Seminar organizers: I. G. Lysenok; A. L. Talambutsa
Seminars "Proof Theory" and "Logic Online Seminar"
Seminar organizer: L. D. Beklemishev
Steklov Mathematical Institute (8 Gubkina), room 530 + Zoom
Recent publications

| by years | scientific publications | by types |


1. A. A. Razborov, “More about sparse halves in triangle-free graphs”, Mat. Sb. (to appear)  mathnet

   2021
2. Dhruv Mubayi, Alexander Razborov, “Polynomial to exponential transition in Ramsey theory”, Proc. London Math. Soc., 122:1 (2021), 69-92  mathnet  crossref  isi (cited: 1)  scopus (cited: 1); (Published online)
3. 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  mathnet  crossref  crossref  mathscinet  isi  scopus
4. 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  mathnet  crossref  crossref  mathscinet  isi
5. Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov, “Clique is hard on average for regular resolution”, Journal of the ACM, 68:4 (2021), 23 , 26 pp.  mathnet  crossref;
6. A. Kolpakov, A. Talambutsa, “On free semigroups of affine maps on the real line”, Proceedings of AMS, 2021, 1–7 (to appear) , arXiv: 2105.09387
7. Alexander Kolpakov, Alexey Talambutsa, “Growth rates of Coxeter groups and Perron numbers”, Int. Math. Res. Not. IMRN, 2021, 1–22 (Published online) , arXiv: 1912.05608  mathnet  crossref; (Published online)
8. T. Hartnick, A. Talambutsa, 2021 \epreprint Efficient computations with counting functions on free groups and free monoids, 43 pp., arXiv: 2109.14947
9. L. Babai, K. A. Hansen, V. V. Podolskii, X. Sun, Izv. RAN. Ser. Mat., 85 (2021) (to appear)  mathnet
10. Yury Savateev, Daniyar Shamkanov, “Non-well-founded proofs for the Grzegorczyk modal logic”, Rev. Symb. Log., 14:1 (2021), 22–50  mathnet  crossref  isi  scopus;
11. S. O. Speranski, “Negation as a modality in a quantified setting”, Journal of Logic and Computation, 31:5 (2021), 1330–1355  mathnet  crossref  isi  scopus (cited: 1)
12. Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “The multiplicative-additive Lambek calculus with subexponential and bracket modalities”, J. Logic Lang. Inf., 30:1 (2021), 31–88  mathnet  crossref  isi (cited: 1)  scopus;
13. Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “Language models for some extensions of the Lambek calculus”, Inform. and Comput., 2021, 104760 (Published online) , 16 pp., arXiv: 2008.00070  mathnet  crossref  scopus; (Published online)
14. Stepan Kuznetsov, “Action logic is undecidable”, ACM Trans. Comput. Log., 22:2 (2021), 10 , 26 pp., arXiv: 1912.11273  mathnet  crossref;
15. Stepan L. Kuznetsov, “Relational models for the Lambek calculus with intersection and unit”, Relational and Algebraic Methods in Computer Science, 19th International Conference, RAMICS 2021 (Marseille, November 2–5, 2021), Lecture Notes in Comput. Sci., 13027, Springer, 2021, 258–274  crossref
16. Stepan L. Kuznetsov, “Complexity of a fragment of infinitary action logic with exponential via non-well-founded proofs”, Automated Reasoning with Analytic Tableaux and Related Methods, 30th International Conference, TABLEAUX 2021, Birmingham, UK, September 6–9, 2021, Lecture Notes in Comput. Sci., 12842, Springer, Cham, 2021, 317–334  mathnet  crossref  scopus;
17. Stepan L. Kuznetsov, Stanislav O. Speranski, “Infinitary action logic with exponentiation”, Ann. Pure Appl. Log., 2021 (to appear) , arXiv: 2001.06863
18. 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, Studies in Computational Intelligence, 999, eds. R. Loukanova, Springer, 2021 (to appear)

   2020
19. Alexander Razborov, An Extremal Problem Motivated by Triangle-Free Strongly Regular Graphs, 2020 , 34 pp., arXiv: 2006.01937
20. Nathan Mull, Shuo Pang, Alexander Razborov, “On CDCL-Based Proof Systems with the Ordered Decision Strategy”, Theory and Applications of Satisfiability Testing SAT 2020, International Conference on Theory and Applications of Satisfiability Testing, Lecture Notes in Comput. Sci., 12178, Springer, Cham, 2020, 149–165  mathnet  crossref  scopus (cited: 3);
21. L. Coregliano, A. Razborov, Natural Quasirandom Properties, 2020 , 84 pp., arXiv: 2012.11773
22. A. Razborov, Kvant, 2020, no. 10, 7–16  mathnet  crossref
23. L. N. Coregliano, A. A. Razborov, “Semantic limits of dense combinatorial objects”, Russian Math. Surveys, 75:4 (2020), 627–723  mathnet  crossref  crossref  mathscinet  isi (cited: 1)  elib  scopus (cited: 1)
24. S. I. Adian, V. M. Buchstaber, E. I. Zelmanov, S. V. Kislyakov, V. V. Kozlov, Yu. V. Matiyasevich, S. P. Novikov, D. O. Orlov, A. N. Parshin, V. L. Popov, D. V. Treschev, “Vladimir Petrovich Platonov (on his 80th birthday)”, Russian Math. Surveys, 75:2 (2020), 387–391  mathnet  crossref  crossref  isi
25. S. I. Adian, V. S. Atabekyan, “Normal Automorphisms of Free Groups of Infinitely Based Varieties”, Math. Notes, 108:2 (2020), 149–154  mathnet  crossref  crossref  mathscinet  isi (cited: 1)  elib  scopus
26. 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  mathnet  crossref  crossref  mathscinet  isi
27. L. Beklemishev, A. Dmitrieva, J. Makowsky, Axiomatizing Origami planes, 2020 , 25 pp., arXiv: 2012.03250
28. Alexander Kolpakov, Alexey Talambutsa, “Spherical and geodesic growth rates of right-angled Coxeter and Artin groups are Perron numbers”, Discrete Math., 343:3 (2020), 111763 , 8 pp., arXiv: 1809.09591  mathnet  crossref  mathscinet  zmath  isi  scopus;
29. A. Talambutsa, “On subquadratic derivational complexity of semi-thue systems”, CSR 2020: Computer Science Theory and Applications, 15th International Computer Science Symposium in Russia, Yekaterinburg, Russian Federation, 29 June 2020 - 3 July 2020, Lecture Notes in Comput. Sci., 12159, Springer, 2020, 379–392  mathnet  crossref  scopus;
30. Fedor V. Fomin, Vladimir V. Podolskii, “CSR 2018 Special Issue on TOCS”, Theory Comput. Syst., 64 (2020), 1–2  mathnet  crossref  mathscinet  zmath  isi  scopus;
31. Olga Gerasimova, Stanislav Kikot, Agi Kurucz, Vladimir Podolskii, Michael Zakharyaschev, “A Data Complexity and Rewritability Tetrachotomy of Ontology-Mediated Queries with a Covering Axiom”, Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, IJCAI Organization, 2020, 403–413  crossref
32. Alexander Kozachinskiy, Vladimir Podolski, “Multiparty Karchmer – Wigderson Games and Threshold Circuits”, 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany, Leibniz Internat. Proc. in Inform., 169, Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, 24 , 23 pp.  mathnet  crossref  scopus;
33. Anastasiya Chistopolskaya, Vladimir V. Podolskii, “On the Decision Tree Complexity of Threshold Functions”, Computer Science - Theory and Applications - 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 - July 3, 2020, Lecture Notes in Comput. Sci., 12159, Springer, Cham, 2020, 198–210  mathnet  crossref  scopus;
34. Dima Grigoriev, Vladimir V. Podolskii, “Tropical Combinatorial Nullstellensatz and sparse polynomials”, Found. Comput. Math., 20 (2020), 753–781  mathnet  crossref  mathscinet  isi  scopus;
35. Vladimir V. Podolskii, Alexander A. Sherstov, “Inner Product and Set Disjointness: Beyond Logarithmically Many Parties”, ACM Trans. Comput. Theory, 12:4 (2020), 26 , 28 pp.  mathnet  crossref  isi  scopus;
36. A. Freund, F. Pakhomov, “Short proofs for slow consistency”, Notre Dame J. Formal Logic, 61:1 (2020), 31–49 , arXiv: 1712.03251  mathnet  crossref  mathscinet  isi (cited: 1)  scopus (cited: 2);
37. Fedor Pakhomov, James Walsh, “Reflection ranks and ordinal analysis”, J. Symb. Log., 2020, 1–34 (Published online) , arXiv: 1805.02095  mathnet  crossref; (Published online)
38. Fedor Pakhomov, Alexander Zapryagaev, “Multi-dimensional Interpretations of Presburger Arithmetic in Itself”, J. Logic Comput., 30:8 (2020), 1681–1693 , arXiv: 2004.03404  mathnet  crossref  mathscinet  isi  scopus;
39. Daniyar Shamkanov, “Global neighbourhood completeness of the provability logic GLP”, Advances in Modal Logic (Helsinki, Finland, August 2428, 2020), Advances in Modal Logic, 13, eds. Nicola Olivetti, Rineke Verbrugge, Sara Negri and Gabriel Sandu, College Publications, London, 2020, 581–596
40. Daniyar Shamkanov, “Non-well-founded derivations in the Gödel-Löb provability logic”, Rev. Symb. Log., 13:4 (2020), 776–796  mathnet  crossref  mathscinet  isi  scopus;
41. S. P. Odintsov, S. O. Speranski, “BelnapDunn modal logics: truth constants vs. truth values”, Review of Symbolic Logic, 13:2 (2020), 416–435  mathnet  crossref  mathscinet  zmath  isi (cited: 3)  scopus (cited: 4)
42. Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities”, J. Logic Comput., 30:1 (2020), 239–256  mathnet  crossref  mathscinet  isi (cited: 1)  scopus (cited: 2)
43. S. L. Kuznetsov, N. S. Ryzhkova, “A restricted fragment of the Lambek calculus with iteration and intersection operations”, Algebra and Logic, 59:2 (2020), 129–146  mathnet  crossref  crossref  mathscinet  isi  scopus (cited: 1)
44. Max Kanovich, Stepan Kuznetsov, Vivek Nigam, Andre Scedrov, “Soft subexponentials and multiplexing”, Automated Reasoning, 10th International Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Lecture Notes in Comput. Sci., 12166, Springer, 2020, 500–517  mathnet  crossref  scopus
45. Stepan Kuznetsov, “Complexity of the infinitary Lambek calculus with Kleene star”, Rev. Symb. Log., 2020, 1–28 (Published online) , arXiv: 2005.00404  mathnet  crossref  scopus (cited: 1)
46. Stepan Kuznetsov, “The ‘long rule’ in the Lambek calculus with iteration: undecidability without meets and joins”, AiML 2020, Helsinki, Finland, August 24–28, 2020, Advances in Modal Logic, 13, College Publications, London, 2020, 425–449  mathnet
47. Stepan L. Kuznetsov, “A $\Pi^0_1$-bounded fragment of infinitary action logic with exponential”, Logic, Language, and Security: Scedrov Festschrift, Lecture Notes in Comput. Sci., 12300, Springer, Cham, 2020, 3–16  mathnet  crossref  scopus (cited: 1);
48. Stepan Kuznetsov, “Complexity of Commutative Infinitary Action Logic”, Dynamic Logic. New Trends and Applications, Third International Workshop, DaLi 2020, Prague, Czech Republic, October 9–10, 2020, Lecture Notes in Comput. Sci., 12569, Springer, Cham, 2020, 155–169  mathnet  crossref  scopus (cited: 1);
49. S. Kuznetsov, Kvant, 2020, no. 10, 32–33  mathnet

   2019
50. A. A. Razborov, “Teoriya slozhnosti”, Matematicheskaya sostavlyayuschaya, 2-e izd., rassh. i dop., eds. N. N. Andreev, S. P. Konovalov, N. M. Panyunin, Matematicheskie etyudy, M., 2019, 262 https://book.etudes.ru/toc/complexity/
51. 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  mathnet  crossref  crossref  mathscinet  adsnasa  isi  elib
52. S. I. Adian, V. S. Atabekyan, “$n$-torsion Groups”, J. Contemp. Math. Anal., Armen. Acad. Sci., 54:6 (2019), 319–327  mathnet  crossref  mathscinet
53. Lev D. Beklemishev, Fedor N. Pakhomov, Reflection algebras and conservation results for theories of iterated truth, 2019 , 48 pp., arXiv: 1908.10302
54. E. A. Kolmakov, L. D. Beklemishev, “Axiomatization of provable $n$-provability”, J. Symb. Log., 84:2 (2019), 849–869  mathnet  crossref  mathscinet  isi (cited: 1)  scopus (cited: 2)
55. 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  mathnet  crossref  crossref  mathscinet  adsnasa  isi
56. L.D. Beklemishev, “Matematika i logika”, Matematicheskaya sostavlyayuschaya, eds. N.N. Andreev, S.P. Konovalov i N.A. Panyunin, 2019, 242–261 book.etudes.ru/toc/mathnlogic/
57. Alexander S. Kulikov, Vladimir V. Podolskii, “Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates”, Theory Comput. Syst., 63:5 (2019), 956–986  mathnet  crossref  mathscinet  zmath  isi  scopus
58. A. S. Kulikov, I. Mikhailin, A. Mokhov, V. V. Podolskii, “Complexity of Linear Operators”, 30th International Symposium on Algorithms and Computation (ISAAC 2019), Shanghai University of Finance and Economics, in ShanghaiShanghai; China; 8 December 2019 – 11 December 2019, Leibniz Internat. Proc. in Inform., 149, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019, 17, 1–12  mathnet  crossref  scopus;
59. Luka Mikec, Fedor Pakhomov, Mladen Vuković, “Complexity of the interpretability logic IL”, Log. J. IGPL, 27:1 (2019), 1–7 , arXiv: 1710.05599  mathnet  crossref  mathscinet  isi  scopus (cited: 1)
60. Fedor Pakhomov, Albert Visser, “On a question of Krajewski's”, J. Symb. Log., 84:1 (2019), 343–358 , arXiv: 1712.01713  mathnet  crossref  mathscinet  zmath  isi (cited: 2)  scopus (cited: 2)
61. Ali Enayat, Fedor Pakhomov, “Truth, disjunction, and induction”, Arch. Math. Logic, 58 (2019), 753–766 , arXiv: 1805.09890  mathnet  crossref  mathscinet  zmath  isi  scopus (cited: 1)
62. F. Pakhomov, A weak set theory that proves its own consistency, 2019 , 25 pp., arXiv: 1907.00877
63. Yury Savateev, Daniyar Shamkanov, “Cut Elimination for the Weak Modal Grzegorczyk Logic via Non-well-Founded Proofs”, WoLLIC 2019: Logic, Language, Information, and Computation (International Workshop on Logic, Language, Information, and Computation), Lecture Notes in Comput. Sci., 11541, Springer, Berlin, Heidelberg, 2019, 569–583  mathnet  crossref  mathscinet  zmath  scopus
64. L. Horsten, S. O. Speranski, “Reasoning about arbitrary natural numbers from a Carnapian perspective”, Journal of Philosophical Logic, 48:4 (2019), 685–707  crossref  mathscinet  zmath  isi  scopus (cited: 1)
65. Max Kanovich, Stepan Kuznetsov, Vivek Nigam, Andre Scedrov, “Subexponentials in non-commutative linear logic”, Math. Structures Comput. Sci., 29:8, A special issue on structural proof theory, automated reasoning and computation in celebration of Dale Millers 60th birthday (2019), 1217–1249 , arXiv: 1709.03607  mathnet  crossref  mathscinet  isi (cited: 6)  scopus (cited: 10)
66. Stepan Kuznetsov, Valentina Lugovaya, Anastasiia Ryzhova, “Craigs trick and a non-sequential system for the Lambek calculus and its fragments”, Log. J. IGPL, 27:3 (2019), 252–266  mathnet  crossref  mathscinet  zmath  isi (cited: 1)  scopus (cited: 1)
67. Stepan Kuznetsov, “The logic of action lattices is undecidable”, Proc. 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019 (Vancouver, B.C., June 24–27, 2019), IEEE, 2019, 1–9  crossref  isi (cited: 1)  scopus (cited: 6)
68. S. L. Kuznetsov, Kvant, 2019, no. 3, 29–31  mathnet  crossref
69. Stepan Kuznetsov, “Complexity of reasoning in residuated Kleene algebras”, 5th International Workshop on Structures and Deduction (Dortmund, June 29–30, 2019), 2019 http://www.anupamdas.com/sd19/papers/SD19_paper_9.pdf
70. Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “The complexity of multiplicative-additive Lambek calculus: 25 years later”, WoLLIC 2019: Logic, Language, Information, and Computation, International Workshop on Logic, Language, Information, and Computation (Utrecht, July 2–5, 2019), Lecture Notes in Comput. Sci., 11541, Springer, Berlin, Heidelberg, 2019, 356–372  mathnet  crossref  mathscinet  zmath  scopus (cited: 3)
71. Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “L-models and R-models for Lambek calculus enriched with additives and the multiplicative unit”, WoLLIC 2019: Logic, Language, Information, and Computation, International Workshop on Logic, Language, Information, and Computation (Utrecht, July 2–5, 2019), Lecture Notes in Comput. Sci., 11541, Springer, Berlin, Heidelberg, 2019, 373–391  mathnet  crossref  mathscinet  zmath  scopus (cited: 3)
72. Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “Undecidability of a Newly Proposed Calculus for CatLog3”, Formal Grammar, 24th International Conference, FG 2019, Riga, Latvia, August 11, 2019, Lecture Notes in Comput. Sci., 11668, Springer, Berlin, Heidelberg, 2019, 67–83  mathnet  crossref  mathscinet  scopus (cited: 2)
73. Stepan Kuznetsov, “Half a way towards circular proofs for Kleene lattices”, Circularity in Syntax and Semantics (Gothenburg, November 20–22, 2019), University of Gothenburg, Gothenburg, 2019, 42–45 http://www.cse.chalmers.se/~bahafs/CiSS2019/CiSS2019BoA.pdf
74. S. Kuznetsov, Kvant, 2019, no. 12, 10–11  mathnet  crossref

   2018
75. Alexander Razborov, “On Space and Depth in Resolution”, Computational Complexity, 27:3 (2018), 511-559  mathnet  crossref  mathscinet  isi (cited: 4)  scopus (cited: 5)
76. I. G. Lysenok, “An Approach to the Study of Finitely Presented Groups Based on the Notion of Discrete Curvature”, Math. Notes, 103:4 (2018), 610–615  mathnet  crossref  crossref  mathscinet  isi  elib  scopus (cited: 1)
77. S. I. Adian, “On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups”, Russian Math. Surveys, 73:3 (2018), 553–568  mathnet  crossref  crossref  mathscinet  adsnasa  isi  elib
78. S. I. Adian, V. S. Atabekyan, “Central extensions of free periodic groups”, Sb. Math., 209:12 (2018), 1677–1689  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi (cited: 6)  elib  scopus (cited: 4)
79. 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  mathnet  crossref  mathscinet  isi (cited: 3)  scopus (cited: 5)
80. L. D. Beklemishev, “Reflection calculus and conservativity spectra”, Russian Math. Surveys, 73:4 (2018), 569–613  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib  scopus (cited: 2)
81. 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  mathnet  crossref  mathscinet  zmath  isi (cited: 2)  scopus (cited: 4)
82. 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  mathnet  crossref  mathscinet  isi  scopus
83. L. D. Beklemishev, A universal Kripke frame for the variable-free fragment of $RC^\nabla$, 2018 , 5 pp., arXiv: 1804.02641
84. E. A. Kolmakov, L. D. Beklemishev, “Axiomatizing provable $n$-provability”, Dokl. Math., 98:3 (2018), 582–585  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  scopus
85. Tobias Hartnick, Alexey Talambutsa, “Relations between counting functions on free groups and free monoids”, Groups, Geometry and Dynamics, 12:4 (2018), 1485–1521 , arXiv: 1508.03166  mathnet  crossref  mathscinet  zmath  isi  scopus (cited: 1)
86. Dima Grigoriev, Vladimir V. Podolskii, “Tropical effective primary and dual nullstellensätze”, Discrete Comput. Geom., 59:3 (2018), 507–552  mathnet  crossref  mathscinet  isi (cited: 3)  scopus (cited: 3)
87. Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev, “Ontology-mediated queries: Combined complexity and succinctness of rewritings via circuit complexity”, Journal of the ACM, 65:5 (2018), 28 , 51 pp.  mathnet  crossref  mathscinet  zmath  isi (cited: 8)  scopus (cited: 16)
88. Fedor V. Fomin, Vladimir V. Podolskii (eds.), Computer Science - Theory and Applications - 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6-10, 2018, Proceedings, Lecture Notes in Computer Science 10846, Springer, 2018 https://link.springer.com/book/10.1007  mathscinet
89. Alexander Zapryagaev, Fedor Pakhomov, “Interpretations of Presburger Arithmetic in Itself”, International Symposium on Logical Foundations of Computer Science (Deerfield Beach, FL, USA, January 811, 2018), Lecture Notes in Comput. Sci., 10703, Springer, 2018, 354–367 , arXiv: 1709.07341  mathnet  crossref  mathscinet  zmath  isi  scopus (cited: 1)
90. Y. Savateev, D. Shamkanov, Cut Elimination for Weak Modal Grzegorczyk Logic via Non-Well-Founded Proofs, 2018 , 17 pp., arXiv: 1804.01432  mathscinet
91. Y. Savateev, D. Shamkanov, Non-Well-Founded Proofs for the Grzegorczyk Modal Logic, 2018 , 31 pp., arXiv: 1804.00955
92. S. P. Odintsov, S. O. Speranski, I. Yu. Shevchenko, “Hintikka's independence-friendly logic meets Nelson's realizability”, Studia Logica, 106:3 (2018), 637–670  crossref  mathscinet  zmath  isi (cited: 1)  scopus (cited: 2)
93. Glyn Morrill, Stepan Kuznetsov, Max Kanovich, Andre Scedrov, “Bracket induction for the Lambek calculus with bracket modalities”, Formal Grammar 2018, 23rd International Conference, FG 2018 (Sofia, Bulgaria, August 11–12, 2018), Lecture Notes in Comput. Sci., 10950, Springer-Verlag, Berlin, Heidelberg, 2018, 84–101  mathnet  crossref  mathscinet  scopus (cited: 2)
94. Max Kanovich, Stepan Kuznetsov, Vivek Nigam, Andre Scedrov, “A logical framework with commutative and non-commutative subexponentials”, Automated Reasoning, IJCAR 2018 (Oxford, UK, July 14-17, 2018), Lecture Notes in Comput. Sci., 10900, eds. D. Galmiche, S. Schulz, R. Sebastiani, Springer, Cham, 2018, 228–245  mathnet  crossref  mathscinet  zmath  isi (cited: 3)  scopus (cited: 7)
95. S. L. Kuznetsov, “O polnote fragmenta ischisleniya Lambeka s operatsiyami iteratsii i peresecheniya otnositelno relyatsionnykh modelei”, Maltsevskie chteniya 2018 (Novosibirsk, 19–22 noyabrya 2018 g.), Institut matematiki im. S. L. Soboleva SO RAN; Novosibirskii gos. universitet, Novosibirsk, 2018, 224 http://www.math.nsc.ru/conference/malmeet/18/maltsev18.pdf
96. S. L. Kuznetsov, Kvant, 2018, no. 11, 9  mathnet  mathscinet
97. S. L. Kuznetsov, Kvant, 2018, no. 5, 24  mathnet
98. S. L. Kuznetsov, Kvant, 2018, no. 3, 32–33  mathnet
99. Stepan Kuznetsov, “$*$-continuity vs. induction: divide and conquer”, 12th Conference on ""Advances in Modal Logic"", AiML 2018, Advances in Modal Logic, 12, University of Bern, Bern, Switzerland, 2018, 493–510  mathnet  zmath  scopus (cited: 3);

   2017
100. Alexander Razborov, “On the width of semi-algebraic proofs and algorithms”, Mathematics of Operation Research, 42:4 (2017), 1106–1134  mathnet  crossref  mathscinet  isi (cited: 1)  scopus (cited: 4)
101. Oleg Pikhurko, Alexander Razborov, “Asymptotic structure of graphs with the minimum number of triangles”, Comb. Probab. Comput., 26:1 (2017), 138–160  mathnet  crossref  mathscinet  isi (cited: 16)  scopus (cited: 15)
102. L. N. Coregliano, A. A. Razborov, “On the density of transitive tournaments”, J. Graph Theory, 85:1 (2017), 12–21 , arXiv: 1501.04074  mathnet  crossref  mathscinet  isi (cited: 10)  elib  scopus (cited: 11)
103. Yuan Li, Alexander Razborov, Benjamin Rossman, “On the $AC^0$ Complexity of Subgraph Isomorphism”, SIAM Journal on Computing, 46:3 (2017), 936–971  mathnet  crossref  mathscinet  isi (cited: 6)  scopus (cited: 9)
104. S. I. Adian, V. S. Atabekyan, “On free groups in the infinitely based varieties of S. I. Adian”, Izv. Math., 81:5 (2017), 889–900  mathnet  crossref  crossref  mathscinet  mathscinet  adsnasa  isi (cited: 8)  elib  scopus (cited: 6)
105. S. I. Adian, V. S. Atabekyan, “Periodic products of groups”, J. Contemp. Math. Anal., Armen. Acad. Sci., 52:3 (2017), 111–117  mathnet  crossref  mathscinet  adsnasa  isi (cited: 5)  elib  scopus (cited: 4)
106. Lev D. Beklemishev, Reflection calculus and conservativity spectra, 2017 , 28 pp., arXiv: 1703.09314
107. L. D. Beklemishev, “On the Reduction Property for GLP-Algebras”, Dokl. Math., 95:1 (2017), 50–54  mathnet  crossref  crossref  mathscinet  isi (cited: 3)  elib  scopus (cited: 3)
108. Lev D. Beklemishev, “On the reflection calculus with partial conservativity operators”, Lecture Notes in Comput. Sci., 10388, 2017, 48–67  mathnet  crossref  mathscinet  zmath  isi (cited: 5)  scopus (cited: 7)
109. 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  crossref  mathscinet  zmath  isi  scopus
110. M. Bucher, A. Talambutsa, “Minimal exponential growth rates of metabelian Baumslag–Solitar groups and lamplighter groups”, Groups, Geometry and Dynamics, 11:1 (2017), 189–209 , arXiv: 1506.03569  mathnet  crossref  mathscinet  isi (cited: 5)  elib  scopus (cited: 5)
111. Vladimir V. Podolskii, “Bounds in Ontology-Based Data Access via Circuit Complexity”, Theory Comput. Syst., 61:2 (2017), 464–493  mathnet  crossref  mathscinet  isi (cited: 1)  elib  scopus (cited: 1)
112. M. Bienvenu, S. Kikot, R. Kontchakov, V. V. Podolskii, V. Ryzhikov, M. Zakharyaschev, “The complexity of ontology-based data access with OWL2QL and bounded treewidth queries”, Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Volume Part F127745, 9 May 2017 (Chicago, United States, 14 May 2017 do 19 May 2017, Kod 127745), 2017, 201–216  crossref  mathscinet  isi (cited: 4)  scopus (cited: 14)
113. O. A. Gerasimova, S. P. Kikot, V. V. Podolskii, M. Zakharyaschev, “More on the Data Complexity of Answering Ontology-Mediated Queries with a Covering Axiom”, International Conference on Knowledge Engineering and the Semantic Web KESW 2017: Knowledge Engineering and Semantic Web, Commun. Comput. Inf. Sci., 786, Springer, 2017, 143–158  mathnet  crossref  mathscinet  elib  scopus (cited: 1)
114. A. S. Kulikov, V. V. Podolskii, “Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates”, 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Leibniz Internat. Proc. in Inform., 66, no. 49, 2017, 1–14  mathnet  crossref  isi (cited: 4)  scopus (cited: 3)
115. D. Yu. Grigor'ev, V. V. Podolskii, “Tropical Combinatorial Nullstellensatz and Fewnomials Testing”, International Symposium on Fundamentals of Computation Theory FCT 2017: Fundamentals of Computation Theory, Lecture Notes in Comput. Sci., 10472, Springer, 2017, 284–297  mathnet  crossref  mathscinet  scopus (cited: 2)
116. O. Gerasimova, S. Kikot, V. Podolskii, M. Zakharyaschev, “On the data complexity of ontology-mediated queries with a covering axiom”, Proceedings of the 30th International Workshop on Description Logics (Montpellier, France, 18 July 2017 - 21 July 2017), CEUR Workshop Proceedings, 1879, CEUR-WS, 2017, 39 , 12 pp.  mathnet  scopus (cited: 2)
117. Fedor Pakhomov, “Solovays completeness without fixed points”, Logic, Language, Information, and Computation, 24th International Workshop, WoLLIC 2017 (London, UK, July 18-21, 2017), Lecture Notes in Comput. Sci., 10388, eds. Kennedy J., de Queiroz R., Springer, Berlin, 2017, 281–294 arxiv: 1703.10262  mathnet  crossref  mathscinet  isi (cited: 1)  scopus (cited: 2)
118. Yury Savateev, Daniyar Shamkanov, “Cut-elimination for the modal Grzegorczyk logic via non-well-founded proofs”, Logic, Language, Information, and Computation, 24th International Workshop, WoLLIC 2017 (London, UK, July 18-21, 2017), Lecture Notes in Comput. Sci., 10388, eds. Juliette Kennedy and Ruy de Queiroz, Springer, 2017, 321–336  mathnet  crossref  mathscinet  isi (cited: 2)  scopus (cited: 3)
119. Daniyar Shamkanov, “Global neighbourhood completeness of the Gödel-Löb provability logic”, Logic, Language, Information, and Computation, 24th International Workshop, WoLLIC 2017 (London, UK, July 18-21, 2017), Lecture Notes in Comput. Sci., 10388, eds. Juliette Kennedy and Ruy de Queiroz, Springer, 2017, 358–371  mathnet  crossref  mathscinet  isi (cited: 1)  scopus (cited: 1)
120. S. O. Speranski, “Quantifying over events in probability logic: an introduction”, Mathematical Structures in Computer Science, 27:8 (2017), 1581–1600  crossref  mathscinet  zmath  isi (cited: 1)  scopus (cited: 2)
121. S. O. Speranski, “Notes on the computational aspects of Kripkes theory of truth”, Studia Logica, 105:2 (2017), 407–429  crossref  mathscinet  zmath  isi (cited: 3)  scopus (cited: 3)
122. S. Kuznetsov, A. Okhotin, “Conjunctive categorial grammars”, Proceedings of the 15th Meeting on the Mathematics of Language (London, July 13–14, 2017), ACL Anthology, 2017, 140–151 (W17-3414) http://aclweb.org/anthology/W17-3414  crossref
123. S. Kuznetsov, G. Morrill, O. Valentín, “Count-invariance including exponentials”, Proceedings of the 15th Meeting on the Mathematics of Language (London, July 13–14, 2017), ACL Anthology, 2017, 128–139 (W17-3413) http://www.aclweb.org/anthology/W17-3413  crossref
124. Stepan Kuznetsov, “The Lambek calculus with iteration: two variants”, WoLLIC 2017 (London, July 18–21, 2017), Lecture Notes in Comput. Sci., 10388, 2017, 182–198  mathnet  crossref  mathscinet  isi (cited: 3)  scopus (cited: 6)
125. S. Kuznetsov, “Ptichka vyletaet!”, Kvantik, 2017, no. 2, 10–11
126. Max Kanovich, Stepan Kuznetsov, Glyn Morrill, Andre Scedrov, “A polynomial-time algorithm for the Lambek calculus with brackets of bounded order”, 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017) (Oxford, September 3–9, 2017), Leibniz Internat. Proc. in Inform., 84, eds. D. Miller, Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, 2017, 22:1–22:17  mathnet  crossref  mathscinet  mathscinet  scopus (cited: 4)
127. Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “Undecidability of the Lambek calculus with subexponential and bracket modalities”, Fundamentals of Computation Theory, FCT 2017 (Bordeaux, September 11–13, 2017), Lecture Notes in Comput. Sci., 10472, eds. R. Klasing, M. Zeitoun, Springer, 2017, 326–340  mathnet  crossref  mathscinet  scopus (cited: 6)
128. S. Kuznetsov, Eliminating the unit constant in the Lambek calculus with brackets, 2017 , 7 pp., arXiv: 1711.06361
129. S. L. Kuznetsov, Kvant, 2017, no. 10, 2–5  mathnet  zmath
130. S. L. Kuznetsov, Kvant, 2017, no. 9, 10–14  mathnet
131. S. L. Kuznetsov, Kvant, 2017, no. 6, 21–24  mathnet
132. S. L. Kuznetsov, Kvant, 2017, no. 4, 36–38  mathnet
133. S. L. Kuznetsov, Kvant, 2017, no. 1, 30–31  mathnet  mathscinet

   2016
134. Alexander Razborov, “A new kind of tradeoffs in propositional proof complexity”, Journal of the ACM, 63:2 (2016), 16 , 14 pp.  mathnet  crossref  mathscinet  isi (cited: 10)  elib  scopus (cited: 16)
135. Igor Lysenok, Alexander Ushakov, “Spherical quadratic equations in free metabelian groups”, Proc. Amer. Math. Soc., 144:4 (2016), 1383–1390 , arXiv: 1304.4898  mathnet  crossref  mathscinet  zmath  isi  elib  scopus (cited: 4)
136. Igor Lysenok, Alexei Miasnikov, Alexander Ushakov, “Quadratic equations in the Grigorchuk group”, Groups Geom. Dyn., 10:1 (2016), 201–239 , arXiv: 1304.5579  mathnet  crossref  mathscinet  zmath  isi  elib  scopus (cited: 5)
137. S. I. Adian, V. S. Atabekyan, “$C^*$-Simplicity of $n$-Periodic Products”, Math. Notes, 99:5 (2016), 631–635  mathnet  crossref  crossref  mathscinet  zmath  isi (cited: 2)  elib  elib  scopus (cited: 1)
138. L. D. Beklemishev, “Proof theoretic analysis by iterated reflection”, Turing's revolution, Part II, Birkhäuser/Springer, Cham, 2016, 225–270  crossref  mathscinet  scopus (cited: 1)
139. Lev Beklemishev, Tommaso Flaminio, “Franco Montagna's work on provability logic and many-valued logic”, Studia Logica, 104:1 (2016), 1–46  mathnet  crossref  mathscinet  zmath  isi  elib  scopus
140. L. D. Beklemishev, Notes on a reduction property for GLP-algebras, 2016 , 8 pp., arXiv: 1606.00290
141. 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  mathscinet  zmath
142. Gerald Berger, Lev D. Beklemishev, Hans Tompits, A Many-Sorted Variant of Japaridze's Polymodal Provability Logic, 2016 , 15 pp., arXiv: 1601.02857
143. Advances in Modal Logic, v. 11, eds. Lev Beklemishev, Stephane Demri, Andras Mate, College Publications, London, 2016 , xii+570 pp.  mathscinet  zmath
144. 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
145. M. Bucher, A. Talambutsa, “Exponential growth rates of free and amalgamated products”, Israel J. Math., 212:2 (2016), 521–546 , arXiv: 1209.4071  mathnet  crossref  mathscinet  zmath  isi (cited: 4)  elib  scopus (cited: 4)
146. M. Bienvenu, S. Kikot, R. Kontchakov, V. Podolskii, M. Zakharyaschev, “Theoretically optimal datalog rewritings for OWL 2 QL ontology-mediated queries” (Cape Town, South Africa, 22 April 2016 – 25 April 2016), CEUR Workshop Proceedings, 1577, 2016 , arXiv: 1604.05258  mathnet  elib  scopus
147. F. N. Pakhomov, “Linear $\mathrm{GLP}$-algebras and their elementary theories”, Izv. Math., 80:6 (2016), 1159–1199  mathnet  crossref  crossref  mathscinet  adsnasa  isi  elib  elib  scopus
148. D. S. Shamkanov, “A realization theorem for the Gödel-Löb provability logic”, Sb. Math., 207:9 (2016), 1344–1360  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi (cited: 2)  elib  elib  scopus (cited: 4)
149. S. O. Speranski, “A note on hereditarily $\Pi^0_1$- and $\Sigma^0_1$-complete sets of sentences”, Journal of Logic and Computation, 26:5 (2016), 1729–1741  crossref  mathscinet  zmath  isi (cited: 2)  scopus (cited: 2)
150. S. P. Odintsov, S. O. Speranski, “The lattice of Belnapian modal logics: special extensions and counterparts”, Logic and Logical Philosophy, 25:1 (2016), 3–33  crossref  mathscinet  zmath  isi (cited: 11)  scopus (cited: 13)
151. M. Kanovich, S. Kuznetsov, A. Scedrov, “On Lambek's restriction in the presence of exponential modalities”, Lecture Notes in Comput. Sci., 9537, 2016, 146–158  mathnet  crossref  mathscinet  zmath  isi (cited: 2)  elib  scopus (cited: 4)
152. Max Kanovich, Stepan Kuznetsov, Andre Scedrov, “Undecidability of the Lambek calculus with a relevant modality”, Lecture Notes in Comput. Sci., 9804, eds. A. Foret, G. Morrill, R. Muskens, R. Osswald, S. Pogodalla, 2016, 240–256 , arXiv: 1601.06303  mathnet  crossref  mathscinet  zmath  elib  scopus (cited: 11)
153. S. L. Kuznetsov, “On translating Lambek grammars with one division into context-free grammars”, Proc. Steklov Inst. Math., 294 (2016), 129–138  mathnet  crossref  crossref  mathscinet  isi (cited: 2)  elib  elib  scopus (cited: 4)
154. M. Kanovich, S. Kuznetsov, V. Nigam, A. Scedrov, “On the proof theory of non-commutative subexponentials”, Dale Fest!, Seminar in honor of the 60th birthday of Dale Miller (Paris, December 15–16, 2017), Université Paris Diderot, 2016, 10 p. http://www.lsv.fr/~baelde/dale-fest/kanovich-etal.pdf

   2015
155. A. A. Razborov, “Pseudorandom generators hard for $k$-DNF resolution and polynomial calculus resolution”, Ann. of Math. (2), 181:2 (2015), 415–472  mathnet (cited: 3)  crossref  mathscinet  zmath  isi (cited: 13)  elib  scopus (cited: 22)
156. S. I. Adian, V. V. Benyash-Krivets, V. M. Buchstaber, E. I. Zelmanov, V. V. Kozlov, G. A. Margulis, S. P. Novikov, A. N. Parshin, G. Prasad, A. S. Rapinchuk, L. D. Faddeev, V. I. Chernousov, “Vladimir Petrovich Platonov (on his 75th birthday)”, Russian Math. Surveys, 70:1 (2015), 197–201  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi (cited: 2)  elib  scopus (cited: 6)
157. S. I. Adian, “New Estimates of Odd Exponents of Infinite Burnside Groups”, Proc. Steklov Inst. Math., 289 (2015), 33–71  mathnet  crossref  crossref  isi (cited: 15)  elib (cited: 3)  elib (cited: 3)  scopus (cited: 8)
158. S. I. Adian, Varuzhan Atabekyan, “Characteristic properties and uniform non-amenability of $n$-periodic products of groups”, Izv. Math., 79:6 (2015), 1097–1110  mathnet  crossref  crossref  mathscinet  adsnasa  isi (cited: 6)  elib  elib
159. S. I. Adian, V. V. Benyash-Krivets, V. M. Buchstaber, E. I. Zel'manov, V. V. Kozlov, G. A. Margulis, S. P. Novikov, A. N. Parshin, G. Prasad, A. S. Rapinchuk, L. D. Faddeev, V. I. Chernousov, “Vladimir Petrovich Platonov (to the 75 anniversary since the birth of)”, Chebyshevskii Sb., 16:4 (2015), 6–10  mathnet
160. G. S. Makanin, A. Sh. Malkhasyan, “General solution of quadratic equations in free groups”, Proceedings of the Yerevan State University. Physical and Mathematical Sciences., 2015, no. 2, 62–65  mathnet  zmath
161. L. D. Beklemishev, A note on strictly positive logics and word rewriting systems, 2015 , 8 pp., arXiv: 1509.00666
162. 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.  crossref  mathscinet  zmath  scopus
163. L. D. Beklemishev, A. A. Onoprienko, “On some slowly terminating term rewriting systems”, Sb. Math., 206:9 (2015), 1173–1190  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi (cited: 4)  elib  elib  scopus (cited: 4)
164. K. A. Hansen, V. V. Podolskii, “Polynomial threshold functions and Boolean threshold circuits”, Inform. and Comput., 240 (2015), 56–73  mathnet  crossref  mathscinet  zmath  isi (cited: 6)  elib  scopus (cited: 2)
165. Dima Grigoriev, Vladimir V. Podolskii, “Complexity of tropical and min-plus linear prevarieties”, Comput. Complexity, 24:1 (2015), 31–64 http://www.mpim-bonn.mpg.de/preblob/5202, arXiv: 1204.4578  mathnet (cited: 1)  crossref  mathscinet  zmath  isi (cited: 8)  scopus (cited: 11)
166. D. Grigoriev, V. V. Podolskii, “Tropical effective primary and dual Nullstellensätze”, 32nd International Symposium on Theoretical Aspects of Computer Science, LIPIcs. Leibniz Int. Proc. Inform., 30, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2015, 379–391  mathnet  crossref  mathscinet  zmath  scopus (cited: 5)
167. V. V. Podolskii, “Circuit complexity meets ontology-based data access”, 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13–17, 2015, Proceedings, Lecture Notes in Comput. Sci., 9139, 2015, 7–26 , arXiv: 1506.01296  mathnet  crossref  mathscinet  zmath  scopus (cited: 2)
168. Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii, “Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results”, 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), IEEE, 2015, 317–328  mathnet  crossref  isi (cited: 3)  scopus (cited: 11)
169. F. N. Pakhomov, “On Elementary Theories of Ordinal Notation Systems Based on Reflection Principles”, Proc. Steklov Inst. Math., 289 (2015), 194–212  mathnet  crossref  crossref  isi (cited: 5)  elib (cited: 1)  elib (cited: 1)  scopus (cited: 5)
170. Fedor Pakhomov, Ordinal notations in Caucal hierarchy, 2015 , 15 pp., arXiv: 1512.05036
171. Daniyar Shamkanov, “Nested sequents for provability logic GLP”, Log. J. IGPL, 23:5 (2015), 789–815  mathnet  crossref  mathscinet  isi (cited: 3)  elib  scopus (cited: 4)
172. S. O. Speranski, “Some new results in monadic second-order arithmetic”, Computability, 4:2 (2015), 159–174  crossref  mathscinet  zmath  isi (cited: 1)  scopus (cited: 1)
173. S. L. Kuznetsov, “On Translating Context-Free Grammars into Lambek Grammars”, Proc. Steklov Inst. Math., 290 (2015), 63–69  mathnet  crossref  crossref  isi (cited: 1)  elib (cited: 1)  elib (cited: 1)  scopus (cited: 1)
174. S. L. Kuznetsov, N. S. Ryzhkova, “Fragment ischisleniya Lambeka s iteratsiei”, Maltsevskie chteniya 2015 (Novosibirsk, 3–7 maya 2015 g.), Institut matematiki im. S.L. Soboleva SO RAN; Novosibirskii gos. universitet, Novosibirsk, 2015, 213 http://www.math.nsc.ru/conference/malmeet/15/malmeet15.pdf
Home page

© Steklov Mathematical Institute of RAS, 2004–2021