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

   
 About the Institute
 Staff publications
 Administration
 Academic Council
 Dissertation Councils
 Departments
Staff 
 Seminars
 Conferences
 Events
 Journals and Books
 In memoriam
 Photogallery
 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
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.
Beklemishev Lev Dmitrievich

Doctor Phys.-Math. Sci., Corresponding Member of RAS, Science Deputy Director
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., Scientific Researcher
office: 515; tel.: +7 (495) 984 81 41 * 37 44; e-mail: skuzn@inbox.ru
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.
Pakhomov Fedor Nikolaevich

Candidate Phys.-Math. Sci., 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: http://www.mi.ras.ru/~podolskii/
Principal fields of research: Computational complexity theory.
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.
Shamkanov Daniyar Salkarbekovich

Candidate Phys.-Math. Sci., 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.
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.

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.
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 |


1. 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), 201–216

   2017
2. Alexander Razborov, “On the width of semi-algebraic proofs and algorithms”, Math. Oper. Res., 2017 (Published online)  mathnet  crossref
3. 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 (cited: 5)  isi (cited: 1)  scopus (cited: 1)
4. 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  scopus
5. S. I. Adjan, V. S. Atabekyan, “On free groups of infinitely based varieties of S.I.Adian”, Izv. RAN. Ser. Mat., 81:5 (2017) (to appear)  mathnet
6. S. I. Adian, V. S. Atabekyan, “Periodic products of groups”, J. Contemp. Math. Anal., Armen. Acad. Sci., 52:3 (2017), 111–117  mathnet  crossref  isi
7. Lev D. Beklemishev, Reflection calculus and conservativity spectra, 2017 , 28 pp., arXiv: 1703.09314 [math.LO]
8. L. D. Beklemishev, “On the Reduction Property for GLP-Algebras”, Dokl. Math., 95:1 (2017), 50–54  mathnet  crossref  crossref  isi  elib  scopus
9. L.D. Beklemishev, “On the reflection calculus with partial conservativity operators”, Logic, Language, Information, and Computation. 24th International Workshop , WoLLIC 2017, London, UK, July 18-21, 2017, Proceedings (July 18-21, 2017), Lecture Notes in Computer Science, LNCS 10388, eds. Juliette Kennedy, Ruy J.G.B. de Queiroz, Springer, Berlin, Heidelberg, 2017, 48–67  crossref
10. 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  mathnet  crossref  mathscinet  isi  scopus
11. 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, Proceedings, Lecture Notes in Computer Science, 10388, eds. Juliette Kennedy and Ruy de Queiroz, Springer, 2017, 358–371
12. 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, Proceedings, Lecture Notes in Computer Science, 10388, eds. Juliette Kennedy and Ruy de Queiroz, Springer, 2017, 321–336
13. S. Kuznetsov, “The Lambek calculus with iteration: two variants”, Logic, Language, Information, and Computation, WoLLIC 2017 (London, July 18–21, 2017), Lect. Notes Comput. Sci., 10388, eds. J. Kennedy, R. de Queiroz, Springer, 2017, 182–198  crossref
14. 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
15. 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

   2016
16. Alexander Razborov, “A new kind of tradeoffs in propositional proof complexity”, Journal of the ACM, 63:2 (2016), 16 , 14 pp.  mathnet  crossref  isi  elib  scopus (cited: 3)
17. 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: 1)
18. 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 (cited: 2)  zmath  isi  elib  scopus
19. 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  elib  elib  scopus
20. 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
21. L. D. Beklemishev, Notes on a reduction property for GLP-algebras, 2016 , 8 pp., arXiv: 1606.00290
22. 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
23. Gerald Berger, Lev D. Beklemishev, Hans Tompits, A Many-Sorted Variant of Japaridze's Polymodal Provability Logic, 2016 , 15 pp., arXiv: 1601.02857
24. Advances in Modal Logic, v. 11, eds. Lev Beklemishev, Stephane Demri, Andras Mate, College Publications, London, 2016 , xii+570 pp.
25. Lev Beklemishev, “Notes on a reduction property of GLP-algebras”, 11th International Conference on Advances in Modal Logic, Short Papers (Budapest, 30 August – 2 September, 2016), 2016, 7–13
26. Michelle Bucher, Alexey Talambutsa, “Exponential growth rates of free and amalgamated products”, Israel J. Math., 212:2 (2016), 521–546 , arXiv: 1209.4071  mathnet  crossref  mathscinet (cited: 1)  zmath  isi (cited: 2)  elib  scopus (cited: 2)
27. M. Bienvenu, S. Kikot, R. Kontchakov, V. Podolskii, M. Zakharyaschev, “Theoretically optimal datalog rewritings for OWL 2 QL ontology-mediated queries”, 29th International Workshop on Description Logics, DL 2016 (Cape Town, South Africa, 22 April 2016 – 25 April 2016), CEUR Workshop Proceedings, 1577, 2016 , arXiv: 1604.05258  mathnet  elib  scopus
28. Vladimir V. Podolskii, “Bounds in Ontology-Based Data Access via Circuit Complexity”, Theory Comput. Syst., 2016, 1–30  mathnet  crossref  elib  scopus
29. F. N. Pakhomov, “Linear $\mathrm{GLP}$-algebras and their elementary theories”, Izv. Math., 80:6 (2016), 1159–1199  mathnet  crossref  crossref  mathscinet  isi  elib  scopus
30. 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  isi  elib  elib  scopus
31. M. Kanovich, S. Kuznetsov, A. Scedrov, “On Lambek's restriction in the presence of exponential modalities”, Logical Foundations of Computer Science 2016, Lecture Notes in Comput. Sci., 9537, Springer, 2016, 146–158  mathnet  crossref  isi  elib  scopus (cited: 1)
32. M. Kanovich, S. Kuznetsov, A. Scedrov, “Undecidability of the Lambek calculus with a relevant modality”, Formal Grammar, 20th and 21st International Conferences, FG 2015, Barcelona, Spain, August 2015, Revised Selected Papers. FG 2016, Bozen, Italy, August 2016, Proceedings, Lecture Notes in Comput. Sci., 9804, eds. A. Foret, G. Morrill, R. Muskens, R. Osswald, S. Pogodalla, Springer, 2016, 240–256 , arXiv: 1601.06303  mathnet  crossref  elib  scopus (cited: 1)
33. 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  elib  elib  scopus
34. 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
35. 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 (cited: 11)  zmath  isi (cited: 2)  elib (cited: 2)  scopus (cited: 2)
36. 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: 1)
37. 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: 3)  elib (cited: 3)  elib (cited: 3)  scopus (cited: 1)
38. 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: 2)  elib
39. 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
40. L. D. Beklemishev, A note on strictly positive logics and word rewriting systems, 2015 , 8 pp., arXiv: 1509.00666
41. 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
42. L. D. Beklemishev, “Proof theoretic analysis by iterated reflection”, Turing’s Revolution, Part II, Springer, 2015, 225–270  crossref  scopus
43. 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  elib  elib  scopus
44. T. Hartnick, A. Talambutsa, Relations between counting functions on free groups and free monoids, 2015 , 28 pp., arXiv: 1508.03166
45. 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  elib  scopus
46. 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 (cited: 2)  zmath  isi (cited: 2)  scopus
47. 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 (cited: 1)  scopus (cited: 1)
48. 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
49. 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  scopus (cited: 6)
50. 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: 2)  elib (cited: 1)  elib (cited: 1)  scopus (cited: 1)
51. Fedor Pakhomov, Ordinal notations in Caucal hierarchy, 2015 , 15 pp., arXiv: 1512.05036
52. Daniyar Shamkanov, “Nested sequents for provability logic GLP”, Log. J. IGPL, 23:5 (2015), 789–815  mathnet  crossref  mathscinet  isi (cited: 1)  elib  scopus (cited: 1)
53. 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)
54. 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
55. A. A. Razborov, “On Turán's $(3,4)$-Problem with Forbidden Subgraphs”, Math. Notes, 95:2 (2014), 247–254  mathnet  crossref  crossref  isi (cited: 1)  elib (cited: 1)  elib (cited: 1)  scopus (cited: 1)
56. A. A. Razborov, “A product theorem in free groups”, Ann. of Math. (2), 179:2 (2014), 405–429  mathnet  crossref  mathscinet (cited: 5)  zmath  zmath  isi (cited: 1)  elib (cited: 1)  scopus (cited: 1)
57. Y. Li, A. Razborov, B. Rossman, “On the $AC^0$ complexity of subgraph isomorphism”, Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer Science (Philadelphia, October 2014), Journal version to appear in “SIAM Journal on Computing”, IEEE, 2014
58. S. I. Adian, V. S. Atabekyan, “The Hopfian Property of $n$-Periodic Products of Groups”, Math. Notes, 95:4 (2014), 443–449  mathnet  crossref  crossref  isi (cited: 2)  elib (cited: 1)  elib (cited: 1)  scopus (cited: 1)
59. L. D. Beklemishev, D. Fernández-Duque, J. J. Joosten, “On provability logics with linearly ordered modalities”, Studia Logica, 102:3 (2014), 541–566 , arXiv: 1210.4809  mathnet  crossref  mathscinet (cited: 5)  zmath  isi (cited: 4)  elib (cited: 1)  scopus
60. L. Beklemishev, “Positive provability logic for uniform reflection principles”, Ann. Pure Appl. Logic, 165:1 (2014), 82–105  crossref  mathscinet (cited: 1)  zmath  isi  elib  scopus
61. L. Beklemishev, Y. Gurevich, “Propositional primal logic with disjunction”, J. Logic Comput., 24:1 (2014), 257–282  crossref  mathscinet (cited: 2)  zmath  isi (cited: 4)  elib (cited: 5)  scopus (cited: 6)
62. 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  crossref
63. 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  crossref  isi
64. Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii, “Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries”, Description Logics 2014, CEUR Workshop Proceedings, 2014, 45–57 http://ceur-ws.org/Vol-1193/paper_43.pdf
65. 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  crossref  mathscinet  zmath  isi (cited: 7)  elib (cited: 13)  scopus (cited: 23)
66. 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
67. Fedor Pakhomov, “On the complexity of the closed fragment of Japaridze's provability logic”, Arch. Math. Logic, 53:7 (2014), 949–967  mathscinet  isi
68. 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
69. 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
70. D. S. Shamkanov, “Circular Proofs for the Gödel–Löb Provability Logic”, Math. Notes, 96:4 (2014), 575–585  mathnet  crossref  crossref  zmath  isi (cited: 2)  elib (cited: 1)  elib (cited: 1)  scopus (cited: 1)
71. 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
72. 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
73. 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  crossref  mathscinet  zmath  scopus
74. 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  crossref  mathscinet  scopus
75. 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. Retoré, 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
76. H. Hatami, J. Hladky, D. Král', S. Norin, A. Razborov, “On the number of pentagons in triangle-free graphs”, J. Combin. Theory Ser. A, 120:3 (2013), 722–732  crossref  mathscinet (cited: 20)  zmath  isi (cited: 15)  elib (cited: 11)  scopus (cited: 18)
77. A. Razborov, “On the Caccetta-Häggkvist conjecture with forbidden subgraphs”, J. Graph Theory, 74:2 (2013), 236–248 , arXiv: 1107.2247  mathnet  crossref  mathscinet (cited: 6)  zmath  isi (cited: 5)  elib (cited: 3)  scopus (cited: 6)
78. E. Viola, A. Razborov, “Real advantage”, ACM Trans. Comput. Theory, 5:4 (2013), 17 , 8 pp.  crossref  mathscinet (cited: 1)  scopus (cited: 2)
79. A. A. Razborov, “What is a Flag Algebra?”, Notices Amer. Math. Soc., 60:10 (2013), 1324–1327  crossref  mathscinet
80. A. Razborov, “Flag algebras: an interim report”, Mathematics of Paul Erdős II, Springer, 2013, 207–232  crossref
81. A. A. Agrachëv, D. V. Anosov, S. M. Aseev, V. M. Buchstaber, A. M. Vershik, Ya. B. Vorobets, V. A. Kaimanovich, B. S. Kashin, I. G. Lysë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  mathnet  crossref  crossref  mathscinet  adsnasa  isi  elib
82. L. Beklemishev, D. Gabelaia, “Topological completeness of the provability logic GLP”, Ann. Pure Appl. Logic, 164:12 (2013), 1201–1223  crossref  mathscinet (cited: 3)  isi (cited: 7)  elib (cited: 4)  scopus (cited: 5)
83. 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
84. V. V. Podolskii, “Lower bound on weights of large degree threshold functions”, Log. Methods Comput. Sci., 9:2 (2013), 13 , 17 pp.  crossref  mathscinet (cited: 1)  zmath  isi  elib  scopus (cited: 1)
85. 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/  crossref  mathscinet (cited: 1)  zmath  scopus (cited: 4)
86. S. Kikot, R. Kontchakov, V. 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, CEUR Workshop Proceedings, 2013, 316–327 http://ceur-ws.org/Vol-1014/paper_27.pdf  scopus (cited: 3)
87. K. A. Hansen, R. I. Jensen, V. V. Podolskii, E. P. Tsigaridas, “Patience of matrix games”, Discrete Appl. Math., 161:16–17 (2013), 2440–2459  mathnet  crossref  mathscinet  zmath  isi  elib  scopus
88. 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, Düsseldorf, Germany, August 2013, Proceedings, Lecture Notes in Comput. Sci., 8036, Springer, Berlin, 2013, 242–249  crossref  mathscinet  zmath  elib  scopus (cited: 1)

   2012
89. 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.  crossref  scopus (cited: 7)
90. H. Hatami, J. Hladký, D. Král, S. Norin, A. Razborov, “Non-three-colourable common graphs exist”, Combin. Probab. Comput., 21:5 (2012), 734–742  crossref  mathscinet (cited: 9)  zmath  isi (cited: 8)  elib (cited: 8)  scopus (cited: 11)
91. A. A. Razborov, Kommunikatsionnaya slozhnost, MTsNMO, 2012 s saita MTsNMO
92. S. I. Adian, “On a method for proving exact bounds on derivational complexity in Thue systems”, Math. Notes, 92:1 (2012), 3–15  mathnet  crossref  crossref  zmath  isi  elib  elib  scopus
93. L. D. Beklemishev, “Calibrating provability logic: from modal logic to reflection calculus”, Advances in Modal Logic, 9, eds. T. Bolander, T. Braüner, S. Ghilardi, L. Moss, College Publications, London, 2012, 89–94  zmath  elib
94. L. Beklemishev, D. Gabelaia, Topological interpretations of provability logic, 2012 , 37 pp., arXiv: 1210.7317
95. 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  crossref  mathscinet  isi  scopus
96. L. Beklemishev, “DKAL: A Distributed Knowledge Authorization Language and Its Logic of Information”, Computer Science – Theory and Applications. 7th International Computer Science Symposium in Russia, CSR 2012 (Nizhny Novgorod, Russia, July 3–7, 2012), Lecture Notes in Computer Science, 7353, eds. E. Hirsch, J. Karhumäki, A. Lepistö, M. Prilutskii, Springer, 2012, XIII–XIV  crossref
97. 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
98. V. V. Podolskii, “Exponential lower bound for bounded depth circuits with few threshold gates”, Inform. Process. Lett., 112:7 (2012), 267–271  crossref  mathscinet  zmath  isi  elib (cited: 1)  scopus (cited: 2)
99. 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  crossref  mathscinet  zmath  scopus
100. K. A. Hansen, R. Ibsen-Jensen, V. V. Podolskii, E. P. Tsigaridas, Patience of matrix games, 2012 , 32 pp., arXiv: 1206.1751
101. 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  crossref  mathscinet  zmath  elib (cited: 11)  scopus (cited: 25)
102. F. N. Pakhomov, “Undecidability of the elementary theory of the semilattice of GLP-words”, Sb. Math., 203:8 (2012), 1211–1229  mathnet  crossref  crossref  mathscinet  zmath  isi (cited: 4)  elib (cited: 2)  elib (cited: 2)  scopus (cited: 2)
103. 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  crossref  mathscinet (cited: 2)  scopus (cited: 1)
104. 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  crossref  zmath  scopus (cited: 1)
105. S. Kuznetsov, “Lambek grammars with one division and one primitive type”, Log. J. IGPL, 20:1 (2012), 207–221  crossref  mathscinet (cited: 1)  zmath  isi (cited: 1)  scopus (cited: 4)
106. 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
107. 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  crossref  mathscinet (cited: 2)  zmath  scopus (cited: 3)
108. 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  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib
109. Alexander A. Razborov, “On the Fon-Der-Flaass interpretation of extremal examples for Turán's $(3,4)$-problem”, Proc. Steklov Inst. Math., 274 (2011), 247–266  mathnet  crossref  mathscinet  isi (cited: 6)  elib  scopus (cited: 7)
110. J. Nordströ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  crossref  mathscinet (cited: 2)  zmath  scopus (cited: 1)
111. M. Alekhnovich, A. Razborov, “Satisfiability, branch-width and Tseitin tautologies”, Comput. Complexity, 20:4 (2011), 649–678  crossref  mathscinet (cited: 4)  zmath  isi (cited: 2)  elib (cited: 3)  scopus (cited: 4)
112. A. Borodin, T. Pitassi, A. Razborov, “Special Issue In Memory of Misha Alekhnovich. Foreword”, Computational Complexity, 20:4 (2011), 579–590  crossref  mathscinet  zmath  isi  elib  scopus
113. 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  mathnet  crossref  mathscinet  isi (cited: 2)  elib  scopus (cited: 2)
114. S. Adian, L. Beklemishev, A. Visser, “Proof and Computation”, J. Logic Computation, 21:4 (2011), 541–542  crossref  isi  scopus
115. П. С. Новиков, С. И. Адян, “Об одной полунепрерывной функции”, Алгоритмические вопросы алгебры и логики, Сборник статей. К 80-летию со дня рождения академика Сергея Ивановича Адяна, Proc. Steklov Inst. Math., Тр. МИАН, 274, МАИК, М., 2011, 10–14  mathnet  crossref  mathscinet  isi  elib  scopus
116. L. Beklemishev, D. Gabelaia, Topological completeness of the provability logic GLP, 2011 , 26 pp., arXiv: 1106.5693
117. 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
118. L. D. Beklemishev, “A simplified proof of arithmetical completeness theorem for provability logic GLP”, Proc. Steklov Inst. Math., 274:1 (2011), 25–33  mathnet  crossref  mathscinet  isi (cited: 6)  elib (cited: 3)  elib (cited: 3)  scopus (cited: 3)
119. 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.  crossref  zmath
120. 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  crossref  mathscinet (cited: 3)  zmath  isi (cited: 3)  scopus (cited: 3)
121. 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, M., 2011 , 351 pp.  mathnet
122. L. D. Beklemishev, “Foreword”, Proc. Steklov Inst. Math., 274 (2011), 1–3  mathnet  crossref  mathscinet  scopus (cited: 6)  scopus (cited: 6)
123. 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  mathnet  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib  elib  scopus
124. 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  mathnet  crossref  mathscinet  isi (cited: 2)  elib (cited: 1)  elib (cited: 1)  scopus (cited: 2)
125. Vladimir V. Podolskii, “Degree-uniform lower bound on the weights of polynomials with given sign function”, Proc. Steklov Inst. Math., 274 (2011), 231–246  mathnet  crossref  mathscinet  isi (cited: 1)  elib  scopus (cited: 1)
126. Daniyar S. Shamkanov, “Interpolation properties for provability logics GL and GLP”, Proc. Steklov Inst. Math., 274 (2011), 303–316  mathnet  crossref  mathscinet  isi (cited: 2)  elib  scopus
127. 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  crossref  zmath  isi  scopus
128. S. L. Kuznetsov, “On the Lambek calculus with a unit and one division”, Moscow University Math. Bull., 66:4 (2011), 173–175  crossref  mathscinet  elib  elib  scopus
Home page

© Steklov Mathematical Institute of RAS, 2004–2017