Steklov Mathematical Institute

Home page

Russian page

Dissertation Councils

Staff

Events

Library

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

Adian Sergei Ivanovich Doctor Phys.-Math. Sci., Academician of RAS, Head of Department, Chief Scientific Researcher office: 508; tel.: +7 (499) 941 01 83, +7 (495) 984 81 41 * 36 34; e-mail: sia@mi.ras.ru Principal fields of research: Algorithmic problems in algebras. Semigroups theory. Groups theory. List of publications
Beklemishev Lev Dmitrievich Doctor Phys.-Math. Sci., Corresponding Member of RAS, Science Deputy Director, 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. List of publications
Kuznetsov Stepan L'vovich Candidate Phys.-Math. Sci., Scientific Researcher office: 515; tel.: +7 (495) 984 81 41 * 37 44; e-mail: skuzn@inbox.ru List of publications
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. List of publications
Pakhomov Fedor Nikolaevich Candidate Phys.-Math. Sci., Scientific Researcher e-mail: pakhfn@gmail.com Principal fields of research: Proof theory, modal logic, decision problems. List of publications
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: http://www.mi.ras.ru/~podolskii/ Principal fields of research: Computational complexity theory. List of publications
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: http://www.mi.ras.ru/~razborov/ Principal fields of research: Complexity of proofs and computations. List of publications
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. List of publications
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. List of publications
Kudinov Andrey Valer'evich Candidate Phys.-Math. Sci., Senior Scientific Researcher e-mail: kudinov.andrey@gmail.com List of publications
Shapirovsky Ilya Borisovich Candidate Phys.-Math. Sci., Senior Scientific Researcher e-mail: shapir@iitp.ru List of publications
Shehtman Valentin Borisovich Doctor Phys.-Math. Sci., Leading Scientific Researcher e-mail: shehtman@mccme.ru List of publications

Makanin Gennadii Semenovich Doctor Phys.-Math. Sci., Out-Of-Staff Member e-mail: makanin@mi.ras.ru Principal fields of research: Combinatorial group theory. Algorithmic problems of semigropus theory. List of publications

Top

Seminars

Seminar of the Department of Mathematical Logic "Algorithmic problems in algebra and logic"

Seminar Chairman: S. I. Adian

MSU, auditorium 16-04

Seminar of the Department of Mathematical Logic "Proof Theory"

Seminar Chairman: L. D. Beklemishev

Special seminar "Geometric Theory of Groups", 2012

Seminar Chairman: I. G. Lysenok

Steklov Mathematical Institute, Room 430 (8 Gubkina)

Recent publications

Steklov Mathematical Institute staff Steklov Mathematical Institute staff and out-of-staff employees

by years

scientific publications

by types



2018
1.	Alexander Razborov, “On Space and Depth in Resolution”, Comput. Complexity, 2018, 1–49 (Published online)
2.	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
3.	Lev D. Beklemishev, “A universal algebra for the variable-free fragment of $RC^\nabla$”, Logical Foundations of Computer Science, International Symposium, LFCS 2018 (Deerfield Beach, FL, USA, January 8-11, 2018), Lecture Notes in Comput. Sci., 10703, eds. Sergei Artemov, Anil Nerode, Springer, Berlin, Heidelberg, 2018, 91–106
4.	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
5.	Dima Grigoriev, Vladimir V. Podolskii, “Tropical effective primary and dual nullstellensätze”, Discrete Comput. Geom., 59:3 (2018), 507–552
6.	M. Kanovich, S. Kuznetsov, V. Nigam, A. Scedrov, “Subexponentials in non-commutative linear logic”, Mathematical Structures in Computer Science, 2018 (to appear) , arXiv: 1709.03607

2017
7.	Alexander Razborov, “On the width of semi-algebraic proofs and algorithms”, Mathematics of Operation Research, 42:4 (2017), 1106–1134
8.	Oleg Pikhurko, Alexander Razborov, “Asymptotic structure of graphs with the minimum number of triangles”, Comb. Probab. Comput., 26:1 (2017), 138–160 (cited: 5) (cited: 2) (cited: 4)
9.	L. N. Coregliano, A. A. Razborov, “On the density of transitive tournaments”, J. Graph Theory, 85:1 (2017), 12–21 , arXiv: 1501.04074 (cited: 1) (cited: 2)
10.	Yuan Li, Alexander Razborov, Benjamin Rossman, “On the $AC^0$ Complexity of Subgraph Isomorphism”, SIAM Journal on Computing, 46:3 (2017), 936–971
11.	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 (cited: 1) (cited: 1)
12.	S. I. Adian, V. S. Atabekyan, “Periodic products of groups”, J. Contemp. Math. Anal., Armen. Acad. Sci., 52:3 (2017), 111–117 (cited: 2) (cited: 2)
13.	Lev D. Beklemishev, Reflection calculus and conservativity spectra, 2017 , 28 pp., arXiv: 1703.09314
14.	L. D. Beklemishev, “On the Reduction Property for GLP-Algebras”, Dokl. Math., 95:1 (2017), 50–54 (cited: 1)
15.	Lev D. Beklemishev, “On the reflection calculus with partial conservativity operators”, Lecture Notes in Comput. Sci., 10388, 2017, 48–67 (cited: 1)
16.	Michelle Bucher, Alexey Talambutsa, “Minimal exponential growth rates of metabelian Baumslag–Solitar groups and lamplighter groups”, Groups Geom. Dyn., 11:1 (2017), 189–209 , arXiv: 1506.03569
17.	A. V. Kudinov, I. B. Shapirovsky, “Partitioning Kripke frames of finite height”, Izv. Math., 81:3 (2017), 592–617
18.	Vladimir V. Podolskii, “Bounds in Ontology-Based Data Access via Circuit Complexity”, Theory Comput. Syst., 61:2 (2017), 464–493
19.	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 (cited: 2)
20.	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
21.	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
22.	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
23.	Fedor Pakhomov, “Solovay’s 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
24.	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 (cited: 1)
25.	Daniyar Shamkanov, “Global neighbourhood completeness of the Gödel-Lö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
26.	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
27.	S. Kuznetsov, G. Morrill, O. Valentí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
28.	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
29.	S. Kuznetsov, “Znanie — sila!”, Kvant, 2017, no. 6, 21–24
30.	S. Kuznetsov, “Rasstoyaniya na sfere”, Kvant, 2017, no. 4, 36–38
31.	S. Kuznetsov, “Ptichka vyletaet!”, Kvantik, 2017, no. 2, 10–11
32.	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 für Informatik, Dagstuhl, 2017, 22:1–22:17
33.	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
34.	S. Kuznetsov, Eliminating the unit constant in the Lambek calculus with brackets, 2017 , 7 pp., arXiv: 1711.06361
35.	S. Kuznetsov, “Teorema Shalya v trekh litsakh”, Kvant, 2017, no. 9 i 10, 10–14 i 2–5, 10 http://mmmf.msu.ru/archive/20152016/KNE/Chasles3.pdf

2016
36.	Alexander Razborov, “A new kind of tradeoffs in propositional proof complexity”, Journal of the ACM, 63:2 (2016), 16 , 14 pp. (cited: 1) (cited: 6)
37.	Igor Lysenok, Alexander Ushakov, “Spherical quadratic equations in free metabelian groups”, Proc. Amer. Math. Soc., 144:4 (2016), 1383–1390 , arXiv: 1304.4898 (cited: 2)
38.	Igor Lysenok, Alexei Miasnikov, Alexander Ushakov, “Quadratic equations in the Grigorchuk group”, Groups Geom. Dyn., 10:1 (2016), 201–239 , arXiv: 1304.5579 (cited: 2)
39.	S. I. Adian, V. S. Atabekyan, “$C^*$-Simplicity of $n$-Periodic Products”, Math. Notes, 99:5 (2016), 631–635 (cited: 2) (cited: 1)
40.	L. D. Beklemishev, “Proof theoretic analysis by iterated reflection”, Turing's revolution, Part II, Birkhäuser/Springer, Cham, 2016, 225–270
41.	Lev Beklemishev, Tommaso Flaminio, “Franco Montagna's work on provability logic and many-valued logic”, Studia Logica, 104:1 (2016), 1–46
42.	L. D. Beklemishev, Notes on a reduction property for GLP-algebras, 2016 , 8 pp., arXiv: 1606.00290
43.	Lev Beklemishev, Daniyar Shamkanov, “Some abstract versions of Gö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
44.	Gerald Berger, Lev D. Beklemishev, Hans Tompits, A Many-Sorted Variant of Japaridze's Polymodal Provability Logic, 2016 , 15 pp., arXiv: 1601.02857
45.	Advances in Modal Logic, v. 11, eds. Lev Beklemishev, Stephane Demri, Andras Mate, College Publications, London, 2016 , xii+570 pp.
46.	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
47.	Michelle Bucher, Alexey Talambutsa, “Exponential growth rates of free and amalgamated products”, Israel J. Math., 212:2 (2016), 521–546 , arXiv: 1209.4071 (cited: 1) (cited: 2) (cited: 2)
48.	A. Kudinov, I. Shapirovsky, “Finite model property of modal logics of finite depth”, Russian Math. Surveys, 71:1 (2016), 164–166
49.	V. B. Shehtman, “Bisimulation games and locally tabular logics”, Russian Math. Surveys, 71:5 (2016), 979–981
50.	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
51.	F. N. Pakhomov, “Linear $\mathrm{GLP}$-algebras and their elementary theories”, Izv. Math., 80:6 (2016), 1159–1199
52.	D. S. Shamkanov, “A realization theorem for the Gödel-Löb provability logic”, Sb. Math., 207:9 (2016), 1344–1360 (cited: 1)
53.	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 (cited: 1)
54.	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 (cited: 4)
55.	S. L. Kuznetsov, “On translating Lambek grammars with one division into context-free grammars”, Proc. Steklov Inst. Math., 294 (2016), 129–138 (cited: 1)
56.	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), Université Paris Diderot, 2016, 10 p. http://www.lsv.fr/~baelde/dale-fest/kanovich-etal.pdf

2015
57.	A. A. Razborov, “Pseudorandom generators hard for $k$-DNF resolution and polynomial calculus resolution”, Ann. of Math. (2), 181:2 (2015), 415–472 (cited: 3) (cited: 3) (cited: 5)
58.	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 (cited: 2) (cited: 1)
59.	S. I. Adian, “New Estimates of Odd Exponents of Infinite Burnside Groups”, Proc. Steklov Inst. Math., 289 (2015), 33–71 (cited: 8) (cited: 3) (cited: 3) (cited: 3)
60.	S. I. Adian, Varuzhan Atabekyan, “Characteristic properties and uniform non-amenability of $n$-periodic products of groups”, Izv. Math., 79:6 (2015), 1097–1110 (cited: 4)
61.	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
62.	L. D. Beklemishev, A note on strictly positive logics and word rewriting systems, 2015 , 8 pp., arXiv: 1509.00666
63.	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.
64.	L. D. Beklemishev, A. A. Onoprienko, “On some slowly terminating term rewriting systems”, Sb. Math., 206:9 (2015), 1173–1190 (cited: 1) (cited: 3)
65.	T. Hartnick, A. Talambutsa, Relations between counting functions on free groups and free monoids, 2015 , 28 pp., arXiv: 1508.03166
66.	K. A. Hansen, V. V. Podolskii, “Polynomial threshold functions and Boolean threshold circuits”, Inform. and Comput., 240 (2015), 56–73 (cited: 2)
67.	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 (cited: 1) (cited: 2) (cited: 3) (cited: 4)
68.	D. Grigoriev, V. V. Podolskii, “Tropical effective primary and dual Nullstellensä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 (cited: 1) (cited: 4)
69.	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 (cited: 1)
70.	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 (cited: 1) (cited: 9)
71.	F. N. Pakhomov, “On Elementary Theories of Ordinal Notation Systems Based on Reflection Principles”, Proc. Steklov Inst. Math., 289 (2015), 194–212 (cited: 2) (cited: 1) (cited: 1) (cited: 4)
72.	Fedor Pakhomov, Ordinal notations in Caucal hierarchy, 2015 , 15 pp., arXiv: 1512.05036
73.	Daniyar Shamkanov, “Nested sequents for provability logic GLP”, Log. J. IGPL, 23:5 (2015), 789–815 (cited: 1) (cited: 3)
74.	S. L. Kuznetsov, “On Translating Context-Free Grammars into Lambek Grammars”, Proc. Steklov Inst. Math., 290 (2015), 63–69 (cited: 1) (cited: 1) (cited: 1) (cited: 1)
75.	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

2014
76.	A. A. Razborov, “On Turán's $(3,4)$-Problem with Forbidden Subgraphs”, Math. Notes, 95:2 (2014), 247–254 (cited: 2) (cited: 1) (cited: 1) (cited: 2)
77.	A. A. Razborov, “A product theorem in free groups”, Ann. of Math. (2), 179:2 (2014), 405–429 (cited: 5) (cited: 1) (cited: 1) (cited: 1)
78.	S. I. Adian, V. S. Atabekyan, “The Hopfian Property of $n$-Periodic Products of Groups”, Math. Notes, 95:4 (2014), 443–449 (cited: 3) (cited: 1) (cited: 1) (cited: 1)
79.	L. D. Beklemishev, D. Fernández-Duque, J. J. Joosten, “On provability logics with linearly ordered modalities”, Studia Logica, 102:3 (2014), 541–566 , arXiv: 1210.4809 (cited: 5) (cited: 6) (cited: 1)
80.	L. Beklemishev, “Positive provability logic for uniform reflection principles”, Ann. Pure Appl. Logic, 165:1 (2014), 82–105 (cited: 1)
81.	L. Beklemishev, Y. Gurevich, “Propositional primal logic with disjunction”, J. Logic Comput., 24:1 (2014), 257–282 (cited: 2) (cited: 4) (cited: 5) (cited: 7)
82.	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
83.	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
84.	Georg Gottlob, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Thomas Schwentick, Michael Zakharyaschev, “The price of query rewriting in ontology-based data access”, Artificial Intelligence, 213 (2014), 42–59 (cited: 13) (cited: 13) (cited: 34)
85.	Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev, “On the Succinctness of Query Rewriting over OWL 2 QL Ontologies with Bounded Chase”, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), ACM Digital Library, 2014, 57:1–57:10 , arXiv: 1401.4420
86.	M. Bienvenu, S. Kikot, V. Podolskii, “Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries”, Description Logics 2014, CEUR Workshop Proceedings, 1193, 2014, 45–57 http://ceur-ws.org/Vol-1193/paper_43.pdf (cited: 2)
87.	Fedor Pakhomov, “On the complexity of the closed fragment of Japaridze's provability logic”, Arch. Math. Logic, 53:7 (2014), 949–967 (cited: 1)
88.	F. Pakhomov, “Ordinal Notations and Fundamental Sequences in Caucal Hierarchy”, Logic Colloquium, Logic, Algebra and Truth Degrees. Abstract Booklet (Vienna, July 14–19), Kurt Gödel Society, 2014, 88
89.	Fedor Pakhomov, “Complexity of Fragments of the Logic GLP”, Proof Theory, Modal Logic and Re ection Principles (Mexico City, September 29 – October 2, 2014), ITAM, 2014, 4
90.	D. S. Shamkanov, “Circular Proofs for the Gödel–Löb Provability Logic”, Math. Notes, 96:4 (2014), 575–585 (cited: 3) (cited: 1) (cited: 1) (cited: 5)
91.	Daniyar Shamkanov, “Circular proofs for provability logic”, LOGIC COLLOQUIUM '13 (Evora, Portugal, July 22–27, 2013), The Bulletin of Symbolic Logic, 20, no. 2, 2014, 242–243 http://www.jstor.org/stable/23800717
92.	D. Shamkanov, “Nested sequents for provability logic GLP”, Proof Theory, Modal Logic and Reflection Principles (Mexico City, Mexico, September 29 – October 2, 2014), Instituto Tecnologico Autonomo de Mexico, Mexico City, 2014, 20
93.	S. Kuznetsov, “$L$-completeness of the Lambek calculus with the reversal operation allowing empty antecedents”, Categories and types in logic, language, and physics. Essays dedicated to Jim Lambek on the occasion of his 90th birthday, Lecture Notes in Comput. Sci., 8222, eds. C. Casadio, B. Coecke, M. Moortgat, P. Scott, Springer, Berlin, Heidelberg, 2014, 268–278
94.	S. L. Kuznetsov, “Trivalent logics arising from L-models for the Lambek calculus with constants”, J. Appl. Non-Class. Log., 14:1-2 (2014), 132–137
95.	S. Kuznetsov, “On translating context-free grammars into Lambek categorial grammars”, Joint Proceedings of the Second Workshop on Natural Language and Computer Science (NLCS’14) & 1st International Workshop on Natural Language Services for Reasoners (NLSR 2014), Affliated to RTA-TLCA, VSL 2014 (Vienna, July 17–18, 2014), eds. V. de Paiva, W. Neuper, P. Quaresma, C. Retoré, L. S. Moss, J. Saludes, Center for Informatics and Systems of the University of Coimbra, Coimbra, Portugal, 2014, 137–142 https://www.cisuc.uc.pt/ckfinder/userfiles/files/TR 2014-02.pdf

2013
96.	H. Hatami, J. Hladky, D. Král', S. Norin, A. Razborov, “On the number of pentagons in triangle-free graphs”, J. Combin. Theory Ser. A, 120:3 (2013), 722–732 (cited: 20) (cited: 19) (cited: 11) (cited: 25)
97.	A. Razborov, “On the Caccetta-Häggkvist conjecture with forbidden subgraphs”, J. Graph Theory, 74:2 (2013), 236–248 , arXiv: 1107.2247 (cited: 6) (cited: 8) (cited: 3) (cited: 8)
98.	E. Viola, A. Razborov, “Real advantage”, ACM Trans. Comput. Theory, 5:4 (2013), 17 , 8 pp. (cited: 1) (cited: 4)
99.	A. A. Razborov, “What is a Flag Algebra?”, Notices Amer. Math. Soc., 60:10 (2013), 1324–1327
100.	A. Razborov, “Flag algebras: an interim report”, Mathematics of Paul Erdős II, Springer, 2013, 207–232
101.	A. A. Agrachëv, D. V. Anosov, S. M. Aseev, V. M. Buchstaber, A. M. Vershik, Ya. B. Vorobets, V. A. Kaimanovich, B. S. Kashin, I. G. Lysënok, A. Yu. Ol'shanskii, V. N. Remeslennikov, Ya. G. Sinai, S. K. Smirnov, A. M. Stepin, I. A. Taimanov, E. V. Shchepin, “Rostislav Ivanovich Grigorchuk (on his sixtieth birthday)”, Russian Math. Surveys, 68:5 (2013), 967–971
102.	L. Beklemishev, D. Gabelaia, “Topological completeness of the provability logic GLP”, Ann. Pure Appl. Logic, 164:12 (2013), 1201–1223 , arXiv: 1106.5693 (cited: 3) (cited: 8) (cited: 4) (cited: 6)
103.	L. D. Beklemishev, “Pozitivnye logiki dokazuemosti”, Mezhdunarodnaya konferentsiya “Maltsevskie chteniya”. Tezisy dokladov (Novosibirsk, 11–15 noyabrya 2013 g.), FGBUN Institut matematiki im. S.L. Soboleva SO RAN; Novosibirskii gosudarstvennyi universitet, Novosibirsk, 2013, 10 www.math.nsc.ru/conference/malmeet/13/maltsev13.pdf
104.	V. V. Podolskii, “Lower bound on weights of large degree threshold functions”, Log. Methods Comput. Sci., 9:2 (2013), 13 , 17 pp. (cited: 1) (cited: 1)
105.	K. A. Hansen, V. V. Podolskii, “Polynomial threshold functions and Boolean threshold circuits”, Mathematical Foundations of Computer Science 2013, 38th International Symposium, MFCS 2013 (Klosterneuburg, Austria, August 26–30, 2013), Proceedings, Lecture Notes in Computer Science, 8087, Springer, Berlin–Heidelberg, 2013, 516–527 http://eccc.hpi-web.de/report/2013/021/ (cited: 1) (cited: 2) (cited: 4)
106.	S. Kikot, R. Kontchakov, V. Podolskii, M. Zakharyaschev, “Query Rewriting over Shallow Ontologies”, Description Logics 2013, Informal Proceedings of the 26th International Workshop on Description Logics (Ulm, Germany, July 23–26, 2013), CEUR Workshop Proceedings, 1014, 2013, 316–327 (cited: 3)
107.	K. A. Hansen, R. Ibsen-Jensen, V. V. Podolskii, E. Tsigaridas, “Patience of matrix games”, Discrete Appl. Math., 161:16 (2013), 2440–2459
108.	S. Kuznetsov, “Conjunctive grammars in Greibach normal form and the Lambek calculus with additive connectives”, Formal grammar. 17th and 18th international conferences, FG 2012, Opole, Poland, August 2012, revised selected papers, FG 2013, Düsseldorf, Germany, August 2013, Proceedings, Lecture Notes in Comput. Sci., 8036, Springer, Berlin, 2013, 242–249 (cited: 1)

2012
109.	O. Beyersdorff, N. Galesi, M. Lauria, A. A. Razborov, “Parameterized bounded-depth Frege is not optimal”, ACM Transactions on Computation Theory, 4:3 (2012), 7 , 16 pp. (cited: 9)
110.	H. Hatami, J. Hladký, D. Král, S. Norin, A. Razborov, “Non-three-colourable common graphs exist”, Combin. Probab. Comput., 21:5 (2012), 734–742 (cited: 9) (cited: 8) (cited: 8) (cited: 12)
111.	A. A. Razborov, Kommunikatsionnaya slozhnost, MTsNMO, 2012 s saita MTsNMO
112.	S. I. Adian, “On a method for proving exact bounds on derivational complexity in Thue systems”, Math. Notes, 92:1 (2012), 3–15
113.	L. D. Beklemishev, “Calibrating provability logic: from modal logic to reflection calculus”, Advances in Modal Logic, 9, eds. T. Bolander, T. Braüner, S. Ghilardi, L. Moss, College Publications, London, 2012, 89–94
114.	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
115.	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. Karhumäki, A. Lepistö, M. Prilutskii, Springer, 2012, XIII–XIV
116.	M. Bucher, A. Talambutsa, Exponential growth rates of free and amalgamated products, Report No. 36, 2011/2012, spring, Institut Mittag-Leffler, Swedish Royal Academy of Science, Djursholm, 2012 , 17 pp. IML-1112s-36.pdf
117.	V. B. Shehtman, “Squares of modal logics with additional connectives”, Russian Math. Surveys, 67:4 (2012), 721–777
118.	V. V. Podolskii, “Exponential lower bound for bounded depth circuits with few threshold gates”, Inform. Process. Lett., 112:7 (2012), 267–271 (cited: 1) (cited: 2)
119.	V. V. Podolskii, “Lower bound on weights of large degree threshold functions”, How the World Computes, Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012 (Cambridge, UK, June 18–23, 2012), Proceedings, Lecture Notes in Comput. Sci., 7318, Springer–Berlin–Heidelberg, 2012, 599–608 , arXiv: 1204.2652
120.	K. A. Hansen, R. Ibsen-Jensen, V. V. Podolskii, E. P. Tsigaridas, Patience of matrix games, 2012 , 32 pp., arXiv: 1206.1751
121.	S. Kikot, R. Kontchakov, V. V. Podolskii, M. Zakharyaschev, “Exponential lower bounds and separation for query rewriting”, Automata, Languages, and Programming, 39th International Colloquium, ICALP 2012 (Warwick, UK, July 9–13, 2012), Proceedings, Part II, Lecture Notes in Comput. Sci., 7392, Springer Berlin Heidelberg, 2012, 263–274 , arXiv: 1202.4193 (cited: 10) (cited: 11) (cited: 27)
122.	F. N. Pakhomov, “Undecidability of the elementary theory of the semilattice of GLP-words”, Sb. Math., 203:8 (2012), 1211–1229 (cited: 4) (cited: 2) (cited: 2) (cited: 2)
123.	S. Kuznetsov, “L-completeness of the Lambek calculus with the reversal operation”, Logical aspects of computational linguistics, Lecture Notes in Comput. Sci., 7351, Springer, Heidelberg, 2012, 151–160 (cited: 2) (cited: 1)
124.	S. Kuznetsov, “Lambek grammars with the unit”, Formal grammar. 15th and 16th international conferences, FG 2010, Copenhagen, Denmark, August 2010, FG 2011, Ljubljana, Slovenia, August 2011. Revised selected papers, Lecture Notes in Comput. Sci., 7395, Springer, Berlin, 2012, 262–266 (cited: 1)
125.	S. Kuznetsov, “Lambek grammars with one division and one primitive type”, Log. J. IGPL, 20:1 (2012), 207–221 (cited: 1) (cited: 1) (cited: 5)
126.	S. L. Kuznetsov, Kategorialnye grammatiki, osnovannye na variantakh ischisleniya Lambeka, Diss. … kand. fiz.-matem. nauk, MGU imeni M. V. Lomonosova, M., 2012 , 70 pp. polnyi tekst (PDF), avtoreferat (PDF), English translation (PDF), English summary (PDF)

2011
127.	O. Beyersdorff, N. Galesi, M. Lauria, A. Razborov, “Parameterized bounded-depth Frege is not optimal”, Automata, languages and programming, Part I, Lecture Notes in Comput. Sci., 6755, Springer, Heidelberg, 2011, 630–641 (cited: 2) (cited: 3)
128.	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
129.	Alexander A. Razborov, “On the Fon-Der-Flaass interpretation of extremal examples for Turán's $(3,4)$-problem”, Proc. Steklov Inst. Math., 274 (2011), 247–266 (cited: 6) (cited: 7)
130.	J. Nordström, A. Razborov, “On minimal unsatisfiability and time-space trade-offs for $k$-DNF resolution”, Automata, languages and programming. Part I, 38th International Colloquium, ICALP 2011 (Zurich, Switzerland, July 4–8, 2011), Lecture Notes in Computer Science, 6755, eds. Luca Aceto, Monika Henzinger, Jiri Sgall, Springer, Heidelberg, 2011, 642–653 (cited: 2) (cited: 1)
131.	M. Alekhnovich, A. Razborov, “Satisfiability, branch-width and Tseitin tautologies”, Comput. Complexity, 20:4 (2011), 649–678 (cited: 4) (cited: 3) (cited: 3) (cited: 5)
132.	A. Borodin, T. Pitassi, A. Razborov, “Special Issue In Memory of Misha Alekhnovich. Foreword”, Computational Complexity, 20:4 (2011), 579–590
133.	Igor G. Lysenok, Alexei G. Myasnikov, “A polynomial bound on solutions of quadratic equations in free groups”, Proc. Steklov Inst. Math., 274 (2011), 136–173 (cited: 2) (cited: 2)
134.	S. Adian, L. Beklemishev, A. Visser, “Proof and Computation”, J. Logic Computation, 21:4 (2011), 541–542
135.	P. S. Novikov, S. I. Adyan, “Ob odnoi polunepreryvnoi funktsii”, Algoritmicheskie voprosy algebry i logiki, Sbornik statei. K 80-letiyu so dnya rozhdeniya akademika Sergeya Ivanovicha Adyana, Tr. MIAN, 274, MAIK, M., 2011, 10–14
136.	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
137.	L. D. Beklemishev, “A simplified proof of arithmetical completeness theorem for provability logic GLP”, Proc. Steklov Inst. Math., 274:1 (2011), 25–33 (cited: 7) (cited: 3) (cited: 3) (cited: 4)
138.	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.
139.	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: 3) (cited: 3) (cited: 3)
140.	Algoritmicheskie voprosy algebry i logiki, Sbornik statei. K 80-letiyu so dnya rozhdeniya akademika Sergeya Ivanovicha Adyana, Tr. MIAN, 274, ed. L. D. Beklemishev, E. F. Mischenko, MAIK «Nauka/Interperiodika», M., 2011 , 351 pp.
141.	L. D. Beklemishev, “Foreword”, Proc. Steklov Inst. Math., 274 (2011), 1–3 (cited: 6) (cited: 6)
142.	A. L. Talambutsa, “On the attainability of the minimal growth exponent of free products of cyclic groups”, Russian Math. Surveys, 66:1 (2011), 179–180
143.	A. L. Talambutsa, “Attainability of the minimal exponential growth rate for free products of finite cyclic groups”, Proc. Steklov Inst. Math., 274 (2011), 289–302 (cited: 2) (cited: 1) (cited: 1) (cited: 2)
144.	V. B. Shehtman, “On squares of modal logics with additional connectives”, Proc. Steklov Inst. Math., 274 (2011), 317–325 (cited: 1) (cited: 1)
145.	Vladimir V. Podolskii, “Degree-uniform lower bound on the weights of polynomials with given sign function”, Proc. Steklov Inst. Math., 274 (2011), 231–246 (cited: 1) (cited: 1)
146.	Daniyar S. Shamkanov, “Interpolation properties for provability logics GL and GLP”, Proc. Steklov Inst. Math., 274 (2011), 303–316 (cited: 2)
147.	D. S. Shamkanov, “Strong normalization and confluence for reflexive combinatory logic”, Logic, language, information and computation, 18th international workshop, WoLLIC 2011 (Philadelphia, PA, USA, May 18–20, 2011), Proceedings, Lecture Notes in Computer Science, 6642, eds. L. D. Beklemishev et al., Springer, Berlin, 2011, 228–238
148.	S. L. Kuznetsov, “On the Lambek calculus with a unit and one division”, Moscow University Math. Bull., 66:4 (2011), 173–175 (cited: 1)