Persons: Beklemishev, Lev Dmitrievich

Persons

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

Beklemishev, Lev Dmitrievich

Total publications:	103 (77)
in MathSciNet:	75 (59)
in zbMATH:	60 (48)
in Web of Science:	56 (42)
in Scopus:	53 (44)
Cited articles:	43
Citations:	584
Presentations:	156

Number of views:
This page:	16882
Abstract pages:	16527
Full texts:	6070
References:	947

Member of the Russian Academy of Sciences

Doctor of physico-mathematical sciences (1998)

Speciality:

01.01.06 (Mathematical logic, algebra, and number theory)

Birth date:

17.09.1967

E-mail:

Website:

https://www.mi.ras.ru/~bekl

Keywords:

mathematical logic, proof theory, provability logic, modal logic, fragments of arithmetic.

UDC:

510.2, 510.23, 510.58, 510.6, 510.643, 510.65, 510.652, 512

MSC:

03F45, 03F03, 03F40, 03F15, 03F20, 03F30, 03B45, 03B70

Subject:

Classification theorem for propositional provability logics is proved. A characterization of restricted induction rules in arithmetic in terms of iterated reflection principles is obtained. Classes of provably total computable functions for fragments of arithmetic with parameter-free induction are characterized. In particular, parameter-free induction for Π2-formulas corresponds to the class of primitive recursive functions. An approach to the theory of proof-theoretic ordinals on the basis of a notion of provability algebra is suggested.

Biography

Graduated from Faculty of Mathematics and Mechanics of M. V. Lomonossov Moscow State University in 1989 (department of Mathematical Logic); 1989–1992 — a Ph.D. student; since 1992 — staff member of V. A. Steklov Mathematical Institute of Russian Academy of Sciences. Ph.D. thesis was defended in 1992. Title: Classification of propositional provability logics. D.Sci. thesis was defended in 1998. Title: Reflection principles in formal arithmetic.
In 2000–2005 L. Beklemishev was a faculty member of Utrecht University (the Netherlands).
Moscow Mathematical Society prize was awarded in 1994 for the paper "On the classification of propositional provability logics". A. von Humboldt Fellowship (Germany) was awarded in 1998. In 2006 L. Beklemishev was elected a corresponding member of Russian Academy of Sciences.

Main publications:

L. D. Beklemishev, “On the classification of propositional provability logics”, Izv. Akad. Nauk SSSR Ser. Mat., 53:5 (1989), 915–943 ; English transl. Math. USSR-Izv., 35:2 (1990), 247–275
L. D. Beklemishev, “Iterated local reflection versus iterated consistency”, Ann. Pure Appl. Logic, 75 (1995), 25–48
L. D. Beklemishev, “A proof-theoretic analysis of collection”, Arch. Math. Logic, 37:5-6 (1998), 275–296
L. D. Beklemishev, “Parameter-free induction and provably total computable functions”, Theoret. Comput. Sci., 224 (1999), 13–33
L. D. Beklemishev, “Reflection principles and provability algebras in formal arithmetic”, Uspekhi Matematicheskikh Nauk, 60:2 (2005), 3–78 ; English transl. Russian Mathematical Surveys, 60:2 (2005), 197–268

https://www.mathnet.ru/eng/person17809

https://scholar.google.com/citations?user=QUJVc2UAAAAJ&hl=en

https://zbmath.org/authors/?q=ai:beklemishev.lev-d

https://mathscinet.ams.org/mathscinet/MRAuthorID/251033

https://elibrary.ru/author_items.asp?authorid=7524

ISTINA

https://istina.msu.ru/workers/2556926

https://orcid.org/0000-0002-2949-0600

https://www.webofscience.com/wos/author/record/F-7814-2013

https://www.scopus.com/authid/detail.url?authorId=6602096489

https://www.researchgate.net/profile/Lev_Beklemishev

Full list of publications:

scientific publications

		Citations (Crossref Cited-By Service + Math-Net.Ru)

1.	L. D. Beklemishev, “On the unification problem for GLP”, Izv. RAN. Ser. Mat. (to appear)
2.	Lev D. Beklemishev, Fedor N. Pakhomov, “Automatic structures and the problem of natural well-orderings”, Model Theory, Computer Science, and Graph Polynomials: Festschrift in honor of Johann A. Makowsky, Trends in Mathematics, eds. K. Meyer, A. Rabinovich, E. Ravve, A. Villaveces, Birkhäuser, 2025, 1–19 (to appear); arXiv: 2407.10198
3.	Lev D. Beklemishev, Yunsong Wang, Periodic frames, 2024 , 32 pp., arXiv: https://arxiv.org/abs/2407.10190
4.	Lev Beklemishev, Anna Dmitrieva, Johann A. Makowsky, “Axiomatizing Origami Planes”, Dick de Jongh on Intuitionistic and Provability Logics, Outst. Contrib. Log., 28, Springer, Cham, 2024, 353–377 ;
5.	L. D. Beklemishev, “Conservativity spectra and Joosten–Fernández model”, Dokl. Math., 106:1 (2022), 213–217
6.	Lev D. Beklemishev, Fedor N. Pakhomov, “Reflection algebras and conservation results for theories of iterated truth”, Ann. Pure Appl. Logic, 173:5 (2022), 103093 , 41 pp. ;	8 ^[x]
7.	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
8.	L. Beklemishev, A. Dmitrieva, J. Makowsky, Axiomatizing Origami planes, 2020 , 25 pp., arXiv: 2012.03250
9.	Lev D. Beklemishev, Fedor N. Pakhomov, Reflection algebras and conservation results for theories of iterated truth, 2019 , 48 pp., arXiv: 1908.10302
10.	E. A. Kolmakov, L. D. Beklemishev, “Axiomatization of provable $n$-provability”, J. Symb. Log., 84:2 (2019), 849–869	3 ^[x]
11.	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	6 ^[x]
12.	L. D. Beklemishev, “Reflection calculus and conservativity spectra”, Russian Math. Surveys, 73:4 (2018), 569–613
13.	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	4 ^[x]
14.	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
15.	L. D. Beklemishev, A universal Kripke frame for the variable-free fragment of $RC^\nabla$, 2018 , 5 pp., arXiv: 1804.02641
16.	E. A. Kolmakov, L. D. Beklemishev, “Axiomatizing provable $n$-provability”, Dokl. Math., 98:3 (2018), 582–585
17.	Lev D. Beklemishev, Reflection calculus and conservativity spectra, 2017 , 28 pp., arXiv: 1703.09314
18.	L. D. Beklemishev, “On the Reduction Property for GLP-Algebras”, Dokl. Math., 95:1 (2017), 50–54
19.	Lev D. Beklemishev, “On the reflection calculus with partial conservativity operators”, Lecture Notes in Comput. Sci., 10388, 2017, 48–67	6 ^[x]
20.	L. D. Beklemishev, “Proof theoretic analysis by iterated reflection”, Turing's revolution, Part II, Birkhäuser/Springer, Cham, 2016, 225–270	3 ^[x]
21.	Lev Beklemishev, Tommaso Flaminio, “Franco Montagna's work on provability logic and many-valued logic”, Studia Logica, 104:1 (2016), 1–46
22.	L. D. Beklemishev, Notes on a reduction property for GLP-algebras, 2016 , 8 pp., arXiv: 1606.00290
23.	Lev Beklemishev, Daniyar Shamkanov, “Some abstract versions of 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
24.	Gerald Berger, Lev D. Beklemishev, Hans Tompits, A Many-Sorted Variant of Japaridze's Polymodal Provability Logic, 2016 , 15 pp., arXiv: 1601.02857
25.	Lev Beklemishev, “Notes on a reduction property of GLP-algebras”, 11th International Conference on Advances in Modal Logic, Short Papers (Budapest, 30 August – 2 September, 2016), 2016, 7–13
26.	L. D. Beklemishev, A note on strictly positive logics and word rewriting systems, 2015 , 8 pp., arXiv: 1509.00666
27.	L. D. Beklemishev, A. A. Onoprienko, “On some slowly terminating term rewriting systems”, Sb. Math., 206:9 (2015), 1173–1190
28.	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	15 ^[x]
29.	L. Beklemishev, “Positive provability logic for uniform reflection principles”, Ann. Pure Appl. Logic, 165:1 (2014), 82–105	15 ^[x]
30.	L. Beklemishev, Y. Gurevich, “Propositional primal logic with disjunction”, J. Logic Comput., 24:1 (2014), 257–282	13 ^[x]
31.	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	12 ^[x]
32.	L. Beklemishev, D. Gabelaia, “Topological completeness of the provability logic GLP”, Ann. Pure Appl. Logic, 164:12 (2013), 1201–1223 , arXiv: 1106.5693	15 ^[x]
33.	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
34.	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
35.	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	1 ^[x]
36.	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
37.	L. D. Beklemishev, “A simplified proof of arithmetical completeness theorem for provability logic GLP”, Proc. Steklov Inst. Math., 274:1 (2011), 25–33
38.	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	3 ^[x]
39.	L. D. Beklemishev, “Gödel incompleteness theorems and the limits of their applicability. I”, Russian Math. Surveys, 65:5 (2010), 857–899
40.	L. D. Beklemishev, “Kripke semantics for provability logic GLP”, Ann. Pure Appl. Logic, 161:6 (2010), 756–774	21 ^[x]
41.	L. Beklemishev, V. Goranko, V. Shehtman (eds.), Advances in Modal Logic, 8, College Publications, London, 2010 , ix+505 pp.
42.	L. Beklemishev, G. Bezhanishvili, T. Icard, “On topological models of GLP”, Ways of proof theory, Ontos Mathematical Logic, 2, eds. R. Schindler, Ontos Verlag, Frankfurt, 2010, 133–153
43.	L. Beklemishev, “On the Craig interpolation and the fixed point properties of GLP”, Proofs, categories and computations, Tributes, 13, eds. S. Feferman et al., College Publications, London, 2010, 49–60
44.	L. D. Beklemishev, “The Worm principle”, Logic Colloquium '02 (Münster, 2002), Lect. Notes Log., 27, Assoc. Symbol. Logic, La Jolla, CA, 2006, 75–95
45.	L. Beklemishev, A. Visser, “Problems in the logic of provability”, Mathematical problems from applied logic. I, Int. Math. Ser. (N. Y.), 4, Springer, New York, NY, 2006, 77–136	14 ^[x]
46.	L. Beklemishev, “Representing Worms as a term rewriting system”, Logic, combinatorics and independence results, Oberwolfach Report, 52/2006, eds. A. Bovykin, L. Carlucci, A. Weiermann, Mathematisches Forschungsinstitut Oberwolfach, 2006, 7–9
47.	L. D. Beklemishev, A. Visser, “On the limit existence principles in elementary arithmetic and $\Sigma^0_n$-consequences of theories”, Ann. Pure Appl. Logic, 136:1-2 (2005), 56–74	10 ^[x]
48.	L. D. Beklemishev, J. J. Joosten, M. Vervoort, “A finitary treatment of the closed fragment of Japaridze's provability logic”, J. Logic Comput., 15:4 (2005), 447–463	21 ^[x]
49.	L. D. Beklemishev, “Reflection principles and provability algebras in formal arithmetic”, Russian Math. Surveys, 60:2 (2005), 197–268
50.	L. D. Beklemishev, “Provability algebras and proof-theoretic ordinals. I”, Ann. Pure Appl. Logic, 128:1-3 (2004), 103–123	61 ^[x]
51.	L. D. Beklemishev, “Proof-theoretic analysis by iterated reflection”, Arch. Math. Logic, 42:6 (2003), 515–552	44 ^[x]
52.	L. D. Beklemishev, “On the induction schema for decidable predicates”, J. Symbolic Logic, 68:1 (2003), 17–34	8 ^[x]
53.	L. D. Beklemishev, “Quantifier-Free Induction Schema and the Least Element Principle”, Proc. Steklov Inst. Math., 242 (2003), 50–66
54.	A. L. Rastsvetaev, L. D. Beklemishev, “On the query complexity of finding a local maximum point”, Inform. Process. Lett., 84:6 (2002), 327–332	2 ^[x]
55.	L. Beklemishev, “Another pathological well-ordering”, Logic Colloquium '98 (Prague, 1998), Lect. Notes Log., 13, Assoc. Symbol. Logic, Urbana, IL, 2000, 105–108	5 ^[x]
56.	L. D. Beklemishev, “Open least element principle and bounded query computation”, Computer science logic (Madrid, 1999), Lecture Notes in Comput. Sci., 1683, Springer, Berlin, 1999, 389–404	2 ^[x]
57.	L. D. Beklemishev, “Classification of propositional provability logics”, Provability, complexity, grammars, Amer. Math. Soc. Transl. Ser. 2, 192, Amer. Math. Soc., Providence, RI, 1999, 1–56
58.	L. Beklemishev, M. Pentus, N. Vereshchagin, Provability, complexity, grammars, Amer. Math. Soc. Transl. Ser. 2, 192, Amer. Math. Soc., Providence, RI, 1999 , x+172 pp.
59.	L. D. Beklemishev, “Parameter free induction and provably total computable functions”, Theoret. Comput. Sci., 224:1-2 (1999), 13–33	21 ^[x]
60.	L. D. Beklemishev, “A proof-theoretic analysis of collection”, Arch. Math. Logic, 37:5-6 (1998), 275–296	23 ^[x]
61.	L. D. Beklemishev, Skhemy refleksii v formalnoi arifmetike, Diss. … dokt. fiz.-matem. nauk, Matematicheskii institut im. V.A. Steklova, Moskva, 1998 , 149 pp.
62.	L. Beklemishev, “Notes on local reflection principles”, Theoria, 63:3 (1997), 139–146	10 ^[x]
63.	L. D. Beklemishev, “Parameter free induction and reflection”, Computational logic and proof theory (Vienna, 1997), Lecture Notes in Comput. Sci., 1289, Springer, Berlin, 1997, 103–113	3 ^[x]
64.	L. D. Beklemishev, “Induction rules, reflection principles, and provably recursive functions”, Ann. Pure Appl. Logic, 85:3 (1997), 193–242	40 ^[x]
65.	L. Beklemishev, “Remarks on Magari algebras of $\mathrm{PA}$ and $\mathrm{I}\Delta_0+\mathrm{EXP}$”, Logic and algebra (Pontignano, 1994), Lecture Notes in Pure and Appl. Math., 180, Marcel Dekker, New York, 1996, 317–325
66.	L. D. Beklemishev, “Bimodal logics for extensions of arithmetical theories”, J. Symbolic Logic, 61:1 (1996), 91–124	9 ^[x]
67.	L. Beklemishev, “Iterated local reflection versus iterated consistency”, Ann. Pure Appl. Logic, 75:1-2 (1995), 25–48	19 ^[x]
68.	L. D. Beklemishev, “Ob ogranichennom pravile induktsii i iterirovannykh skhemakh refleksii nad kalmarovskoi elementarnoi arifmetikoi”, Teoreticheskie i prikladnye aspekty matematicheskikh issledovanii, eds. O. B. Lupanov, MGU, Moskva, 1995, 36–39
69.	L. D. Beklemishev, “On bimodal logics of provability”, Ann. Pure Appl. Logic, 68:2 (1994), 115–159	13 ^[x]
70.	S. N. Artemov, L. D. Beklemishev, “On propositional quantifiers in provability logic”, Notre Dame J. Formal Logic, 34:3 (1993), 401–419	14 ^[x]
71.	L. D. Beklemishev, “On the complexity of arithmetical interpretations of modal formulae”, Arch. Math. Logic, 32:3 (1993), 229–238	5 ^[x]
72.	L. D. Beklemishev, “Independent enumerations of theories and recursive progressions”, Siberian Math. J., 33:5 (1992), 760–783
73.	L. D. Beklemishev, Klassifikatsiya propozitsionalnykh logik dokazuemosti, Diss. … kand. fiz.-matem. nauk, Matematicheskii institut im. V.A. Steklova RAN, Moskva, 1992
74.	L. D. Beklemishev, “Provability logics for natural Turing progressions of arithmetical theories”, Studia Logica, 50:1 (1991), 107–128	11 ^[x]
75.	L. D. Beklemishev, “On the classification of propositional provability logics”, Math. USSR-Izv., 35:2 (1990), 247–275
76.	L. D. Beklemishev, “Provability logic without Craig's interpolation property”, Math. Notes, 45:6 (1989), 437–450
77.	L. D. Beklemishev, “Normalization of deductions and interpolation for some logics of provability”, Russian Math. Surveys, 42:6 (1987), 223–224
78.	A. N. Abyzov, L. D. Beklemishev, S. S. Goncharov, Yu. L. Ershov, I. Sh. Kalimullin, V. L. Selivanov, A. L. Semenov, A. Tuganbaev, M. Kh. Faizrahmanov, “Marat Mirzaevich Arslanov (on his eightieth birthday)”, Russian Math. Surveys, 79:2 (2024), 369–373
79.	S. N. Artemov, L. D. Beklemishev, L. Ya. Borkin, A. M. Vershik, E. A. Hirsch, E. Ya. Dantsin, I. A. Ibragimov, E. V. Kalmens, V. Ya. Kreinovich, D. A. Koubenski, A. A. Lodkin, Yu. V. Matiyasevich, B. A. Novikov, V. P. Orevkov, A. L. Semenov, A. O. Slissenko, A. Kh. Shen, “Gregory Samuilovich Tseytin (obituary)”, Russian Math. Surveys, 78:3 (2023), 555–561
80.	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
81.	L. D. Beklemishev, Mat. Pros., 28, MCCME, Moscow, 2021, 9–14
82.	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
83.	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
84.	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
85.	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/
86.	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
87.	Advances in Modal Logic, v. 11, eds. Lev Beklemishev, Stephane Demri, Andras Mate, College Publications, London, 2016 , xii+570 pp.
88.	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.	1 ^[x]
89.	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
90.	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	1 ^[x]
91.	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
92.	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.	1 ^[x]
93.	Algoritmicheskie voprosy algebry i logiki, Sbornik statei. K 80-letiyu so dnya rozhdeniya akademika Sergeya Ivanovicha Adyana, Trudy MIAN, 274, ed. L. D. Beklemishev, E. F. Mischenko, MAIK «Nauka/Interperiodika», M., 2011 , 351 pp.
94.	L. D. Beklemishev, “Foreword”, Proc. Steklov Inst. Math., 274 (2011), 1–3
95.	S. Adian, L. Beklemishev, A. Visser, “Proof and Computation”, J. Logic Computation, 21:4 (2011), 541–542
96.	L. Beklemishev, “Review of “Gödel's Theorem: an incomplete guide to its use and abuse” by Torkel Franzén”, Bulletin of Symbolic Logic, 13:2 (2007), 241–243
97.	L. D. Beklemishev, I. G. Lysenok, A. A. Mal'tsev, S. P. Novikov, M. R. Pentus, A. A. Razborov, A. L. Semenov, V. A. Uspenskii, “Sergei Ivanovich Adian (on his 75th birthday)”, Russian Math. Surveys, 61:3 (2006), 575–588
98.	L. Beklemishev, “Review of “David Hilbert and the axiomatization of physics (1898–-1918)” by Leo Corry”, Studies In History and Philosophy of Science, Part B: Studies In History and Philosophy of Modern Physics, 37:2 (2006), 388–390
99.	S. I. Adian, M. Baaz, L. D. Beklemishev, “Editorial”, J. Logic Computation, 15:4 (2005), 409
100.	L. Beklemishev, “Review of “On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness” by U. Kohlenbach”, Bulletin of Symbolic Logic, 7:1 (2001), 75–77
101.	L. Beklemishev, “Review of “Aspects of Incompleteness” by P. Lindström”, The Journal of Symbolic Logic, 63:4 (1998), 1606–1608
102.	L. Beklemishev, “Review of “Diagonalization and Self-reference” by R. Smullyan”, The Journal of Symbolic Logic, 61:3 (1996), 1052–1055
103.	L. Beklemishev, “Review of papers by D. de Jongh, F. Montagna, and A. Carbone”, The Journal of Symbolic Logic, 58 (1993), 715–717

Presentations in Math-Net.Ru

1.	Логика и топология: родственные связи. Семинар 4 L. D. Beklemishev Summer School “Contemporary Mathematics” Named After Vitaly Arnold, 2024 July 26, 2024 12:45
2.	Логика и топология: родственные связи. Семинар 3 L. D. Beklemishev Summer School “Contemporary Mathematics” Named After Vitaly Arnold, 2024 July 25, 2024 09:30
3.	Логика и топология: родственные связи. Семинар 2 L. D. Beklemishev Summer School “Contemporary Mathematics” Named After Vitaly Arnold, 2024 July 23, 2024 15:30
4.	Логика и топология: родственные связи. Семинар 1 L. D. Beklemishev Summer School “Contemporary Mathematics” Named After Vitaly Arnold, 2024 July 22, 2024 09:30
5.	Lecture 14. Introduction to Model Theory L. D. Beklemishev Course by L. D. Beklemishev "Introduction to Model Theory" May 21, 2024 16:00
6.	Отдел математической логики L. D. Beklemishev Conference MIAN-90, dedicated to the 90th anniversary of Steklov Mathematical Institute May 15, 2024 10:00
7.	Lecture 13. Introduction to Model Theory L. D. Beklemishev Course by L. D. Beklemishev "Introduction to Model Theory" May 14, 2024 16:00
8.	Lecture 12. Introduction to Model Theory L. D. Beklemishev Course by L. D. Beklemishev "Introduction to Model Theory" May 7, 2024 16:00
9.	Lecture 11. Introduction to Model Theory L. D. Beklemishev Course by L. D. Beklemishev "Introduction to Model Theory" April 23, 2024 16:00
10.	Lecture 10. Introduction to Model Theory L. D. Beklemishev Course by L. D. Beklemishev "Introduction to Model Theory" April 16, 2024 16:00
11.	Lecture 9. Introduction to Model Theory L. D. Beklemishev Course by L. D. Beklemishev "Introduction to Model Theory" April 9, 2024 16:00
12.	Lecture 8. Introduction to Model Theory L. D. Beklemishev Course by L. D. Beklemishev "Introduction to Model Theory" April 2, 2024 16:00
13.	Lecture 7. Introduction to Model Theory L. D. Beklemishev Course by L. D. Beklemishev "Introduction to Model Theory" March 26, 2024 16:00
14.	Lecture 6. Introduction to Model Theory L. D. Beklemishev Course by L. D. Beklemishev "Introduction to Model Theory" March 19, 2024 16:00
15.	Lecture 5. Introduction to Model Theory L. D. Beklemishev Course by L. D. Beklemishev "Introduction to Model Theory" March 12, 2024 16:00
16.	Lecture 4. Introduction to Model Theory L. D. Beklemishev Course by L. D. Beklemishev "Introduction to Model Theory" March 5, 2024 16:00
17.	Lecture 3. Introduction to Model Theory L. D. Beklemishev Course by L. D. Beklemishev "Introduction to Model Theory" February 27, 2024 16:00
18.	Lecture 2. Introduction to Model Theory L. D. Beklemishev Course by L. D. Beklemishev "Introduction to Model Theory" February 20, 2024 16:00
19.	Lecture 1. Introduction to Model Theory L. D. Beklemishev Course by L. D. Beklemishev "Introduction to Model Theory" February 13, 2024 16:00
20.	Lecture 13. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Course by L. D. Beklemishev and T. L. Yavorskaya "Provability and Formal Arithmetic II" December 12, 2023 16:45
21.	Lecture 12. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Course by L. D. Beklemishev and T. L. Yavorskaya "Provability and Formal Arithmetic II" December 5, 2023 16:45
22.	Lecture 11. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Course by L. D. Beklemishev and T. L. Yavorskaya "Provability and Formal Arithmetic II" November 21, 2023 16:45
23.	Lecture 10. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Course by L. D. Beklemishev and T. L. Yavorskaya "Provability and Formal Arithmetic II" November 14, 2023 16:45
24.	Lecture 9. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Course by L. D. Beklemishev and T. L. Yavorskaya "Provability and Formal Arithmetic II" November 7, 2023 16:45
25.	Lecture 8. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Course by L. D. Beklemishev and T. L. Yavorskaya "Provability and Formal Arithmetic II" October 31, 2023 16:45
26.	Lecture 7. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Course by L. D. Beklemishev and T. L. Yavorskaya "Provability and Formal Arithmetic II" October 24, 2023 16:45
27.	Lecture 6. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Course by L. D. Beklemishev and T. L. Yavorskaya "Provability and Formal Arithmetic II" October 17, 2023 16:45
28.	Lecture 5. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Course by L. D. Beklemishev and T. L. Yavorskaya "Provability and Formal Arithmetic II" October 10, 2023 16:45
29.	Lecture 4. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Course by L. D. Beklemishev and T. L. Yavorskaya "Provability and Formal Arithmetic II" October 3, 2023 16:45
30.	General topological frames for polymodal provability logic based on periodic sets of ordinals L. D. Beklemishev, Yunsong Wang Seminars "Proof Theory" and "Logic Online Seminar" October 2, 2023 18:30
31.	Lecture 3. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Course by L. D. Beklemishev and T. L. Yavorskaya "Provability and Formal Arithmetic II" September 26, 2023 16:45
32.	Lecture 2. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Course by L. D. Beklemishev and T. L. Yavorskaya "Provability and Formal Arithmetic II" September 19, 2023 16:45
33.	Lecture 1. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Course by L. D. Beklemishev and T. L. Yavorskaya "Provability and Formal Arithmetic II" September 12, 2023 16:45
34.	Гёдель и антигёдель: о граничных условиях теорем Гёделя о неполноте L. D. Beklemishev Summer School “Contemporary Mathematics” Named After Vitaly Arnold, 2023 July 27, 2023 17:15
35.	Быстрорастущие функции и недоказуемые комбинаторные утверждения L. D. Beklemishev Conference "Kolmogorov-120. MIAN" April 26, 2023 13:20
36.	Reflection algebras and conservativity spectra of theories L. D. Beklemishev Beijing–Moscow Mathematics Colloquium April 7, 2023 12:00
37.	Reflection Algebras for Predicative Extensions of Peano Arithmetic L. D. Beklemishev Steklov Mathematical Institute Seminar February 16, 2023 16:00
38.	Lecture 13. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic December 13, 2022 14:45
39.	Алгебры рефлексии для предикативных расширений арифметики Пеано L. D. Beklemishev, F. N. Pakhomov Scientific session of the Steklov Mathematical Institute of RAS dedicated to the results of 2022 November 23, 2022 11:00
40.	Lecture 11. Provability and Formal Arithmetic L. D. Beklemishev Provability and Formal Arithmetic November 22, 2022 14:45
41.	Lecture 10. Provability and Formal Arithmetic L. D. Beklemishev Provability and Formal Arithmetic November 15, 2022 14:45
42.	Lecture 8. Provability and Formal Arithmetic L. D. Beklemishev Provability and Formal Arithmetic November 1, 2022 14:45
43.	Lecture 7. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic October 25, 2022 14:45
44.	Lecture 6. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic October 18, 2022 14:45
45.	Lecture 5. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic October 11, 2022 14:45
46.	Lecture 4. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic October 4, 2022 14:45
47.	Lecture 3. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic September 27, 2022 14:45
48.	Lecture 2. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic September 20, 2022 14:45
49.	Lecture 1. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic September 13, 2022 14:45
50.	Беседы об основаниях математики. Беседа 2 L. D. Beklemishev Summer School “Contemporary Mathematics” Named After Vitaly Arnold, 2022 July 27, 2022 18:45
51.	Беседы об основаниях математики. Беседа 1 L. D. Beklemishev Summer School “Contemporary Mathematics” Named After Vitaly Arnold, 2022 July 26, 2022 18:45
52.	Reading Kreisel: what we do (not) understand L. D. Beklemishev Seminars "Proof Theory" and "Logic Online Seminar" March 28, 2022 18:30
53.	Conservativity spectra and generalized Ignatiev model L. D. Beklemishev Seminars "Proof Theory" and "Logic Online Seminar" March 14, 2022 18:30
54.	Lecture 1. Nonclassical Logics L. D. Beklemishev Nonclassical Logics February 8, 2022 14:45
55.	Lecture 14. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic December 14, 2021 14:45
56.	Lecture 13. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic December 7, 2021 14:45
57.	Lecture 12. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic November 30, 2021 14:45
58.	Lecture 11. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic November 23, 2021 14:45
59.	Lecture 10. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic November 16, 2021 14:45
60.	Lecture 9. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic November 9, 2021 14:45
61.	Lecture 8. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic November 2, 2021 14:45
62.	Lecture 7. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic October 26, 2021 14:45
63.	Lecture 6. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic October 19, 2021 14:45
64.	Lecture 5. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic October 12, 2021 14:45
65.	Lecture 4. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic October 5, 2021 14:45
66.	Lecture 3. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic September 28, 2021 14:45
67.	Lecture 2. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic September 21, 2021 14:45
68.	Lecture 1. Provability and Formal Arithmetic L. D. Beklemishev, T. L. Yavorskaya Provability and Formal Arithmetic September 14, 2021 14:45
69.	Модели и интерпретации. Семинар Л. Д. Беклемишев Summer School "Contemporary Mathematics" Named After Vitaly Arnold, 2021 July 29, 2021 09:30
70.	Модели и интерпретации. Лекция Л. Д. Беклемишев Summer School "Contemporary Mathematics" Named After Vitaly Arnold, 2021 July 27, 2021 09:30
71.	Лекция 14. Аспекты теоремы о неполноте L. D. Beklemishev Provability and Formal Arithmetic December 22, 2020 14:30
72.	Лекция 13. Доказуемость как модальность L. D. Beklemishev Provability and Formal Arithmetic December 15, 2020 14:30
73.	Лекция 12. Формализация синтаксиса в арифметике L. D. Beklemishev Provability and Formal Arithmetic December 8, 2020 14:30
74.	Лекция 11. Доказуемо рекурсивные функции L. D. Beklemishev Provability and Formal Arithmetic December 1, 2020 14:30
75.	Лекция 10. Неподвижная точка Россера L. D. Beklemishev Provability and Formal Arithmetic November 24, 2020 14:30
76.	Лекция 9. Теорема Лёба и вторая теорема Гёделя о неполноте L. D. Beklemishev Provability and Formal Arithmetic November 17, 2020 14:30
77.	Лекция 8. Лемма о диагонализации L. D. Beklemishev Provability and Formal Arithmetic November 10, 2020 14:30
78.	Лекция 7. Представимость функций L. D. Beklemishev Provability and Formal Arithmetic November 3, 2020 14:30
79.	Лекция 6. Теорема Гёделя-Россера L. D. Beklemishev Provability and Formal Arithmetic October 27, 2020 14:30
80.	Лекция 5. Первая теорема Гёделя о неполноте L. D. Beklemishev Provability and Formal Arithmetic October 20, 2020 14:30
81.	Лекция 4. Определимость перечислимых предикатов арифметическими $\Sigma_1$-формулами L. D. Beklemishev Provability and Formal Arithmetic October 13, 2020 14:30
82.	Лекция 3.Определимость в языке арифметики L. D. Beklemishev Provability and Formal Arithmetic October 6, 2020 14:30
83.	Лекция 2. Слабые фрагменты арифметики Пеано и их модели L. D. Beklemishev Provability and Formal Arithmetic September 29, 2020 14:30
84.	Лекция 1. Язык и аксиомы арифметики Пеано L. D. Beklemishev Provability and Formal Arithmetic September 22, 2020 14:30
85.	Introductory words L. D. Beklemishev S. I. Adian Memorial Conference May 26, 2020 14:55
86.	Lecture 21. Applications of functional interpretation. Interpretation by absence of counterexample. T system models L. D. Beklemishev L. D. Beklemishev, S. L. Kuznetsov. Computational proof theory and lambda calculus May 12, 2020 16:30
87.	Лекция 20. Гёделевская система Т. Интерпретация формальной арифметики в Т (продолжение) L. D. Beklemishev L. D. Beklemishev, S. L. Kuznetsov. Computational proof theory and lambda calculus April 28, 2020 16:30
88.	Лекция 19. Гёделевская система $Т$. Функциональная интерпретация интуиционистской арифметики в $Т$ L. D. Beklemishev L. D. Beklemishev, S. L. Kuznetsov. Computational proof theory and lambda calculus April 21, 2020
89.	Лекция 18. Интуиционистская арифметика L. D. Beklemishev L. D. Beklemishev, S. L. Kuznetsov. Computational proof theory and lambda calculus April 14, 2020 16:30
90.	Лекция 17. Примитивно рекурсивная арифметика L. D. Beklemishev L. D. Beklemishev, S. L. Kuznetsov. Computational proof theory and lambda calculus April 7, 2020
91.	Лекция 16. Негативная интерпретация классической логики в интуиционистской L. D. Beklemishev L. D. Beklemishev, S. L. Kuznetsov. Computational proof theory and lambda calculus March 26, 2020 16:00
92.	Лекция 15. Интуиционистское исчисление предикатов. Гильбертовский и генценовский формат. Теорема об устранении сечения. Дизъюнктивное и экзистенциальное свойства интуиционистской логики. L. D. Beklemishev L. D. Beklemishev, S. L. Kuznetsov. Computational proof theory and lambda calculus March 23, 2020 16:30
93.	Лекция 13. Слабо экстенсиональные лямбда-алгебры. Модель Плоткина $\mathcal{P}\omega$. L. D. Beklemishev L. D. Beklemishev, S. L. Kuznetsov. Computational proof theory and lambda calculus March 2, 2020 16:30
94.	Лекция 12. Комбинаторные алгебры, лямбда-алгебры. L. D. Beklemishev L. D. Beklemishev, S. L. Kuznetsov. Computational proof theory and lambda calculus February 17, 2020 16:30
95.	Лекция 11. Модели лямбда-исчисления L. D. Beklemishev, S. L. Kuznetsov L. D. Beklemishev, S. L. Kuznetsov. Computational proof theory and lambda calculus February 10, 2020 16:30
96.	Лекция 10. Комбинаторная логика L. D. Beklemishev L. D. Beklemishev, S. L. Kuznetsov. Computational proof theory and lambda calculus December 9, 2019 16:30
97.	Об открытых вопросах теории доказательств L. D. Beklemishev Seminars "Proof Theory" and "Logic Online Seminar" October 14, 2019
98.	Лекция 1.Введение. Бестиповое лямбда-исчисление. Представление натуральных чисел в бестиповом лямбда-исчислении L. D. Beklemishev, S. L. Kuznetsov L. D. Beklemishev, S. L. Kuznetsov. Computational proof theory and lambda calculus September 30, 2019
99.	Итерированные определения истинности и исчисление рефлексий L. D. Beklemishev Seminars "Proof Theory" and "Logic Online Seminar" April 29, 2019 18:30
100.	Лекция 16. Соотношение между принципом Червя и доказуемо-вычислимыми функциями PA. L. D. Beklemishev March 4, 2019 16:30
101.	Лекция 15. Теоретико-доказательственный анализ $\mathsf{PA}$ с помощью схем рефлексии. L. D. Beklemishev February 25, 2019 16:30
102.	Ordinals and conservativity spectra of arithmetical theories L. D. Beklemishev Steklov Mathematical Institute Seminar February 21, 2019 16:00
103.	Лекция 14. Лемма о редукции для схем рефлексии. L. D. Beklemishev February 18, 2019 16:30
104.	Лекция 13. Доказуемо вычислимые функции $\mathsf{PA}$, принцип Червя, схемы рефлексии. L. D. Beklemishev February 11, 2019 16:30
105.	Лекция 9. Иерархия Веблена. L. D. Beklemishev November 26, 2018 16:30
106.	Исчисление для схем рефлексии и спектры консервативности L. D. Beklemishev Scientific session of the Steklov Mathematical Institute of RAS dedicated to the results of 2018 November 21, 2018 14:00
107.	Лекция 8. Ординалы. Канторовская система ординальных обозначений для ординала $\varepsilon_0$. L. D. Beklemishev November 19, 2018 16:30
108.	Лекция 7. Теорема Парсонса-Минца-Такеути о доказуемо вычислимых функциях $\mathsf{I}\Sigma_1$ (Часть 2). F. N. Pakhomov, L. D. Beklemishev November 12, 2018 16:30
109.	О спектрах консервативности арифметических теорий L. D. Beklemishev "Algorithmic problems in algebra and logic" (S.I.Adian seminar) November 6, 2018 18:30
110.	Как теория доказательств пришла к своим ординалам L. D. Beklemishev MIPT Interdepartmental Seminar on Discrete Mathematics October 17, 2018 18:30
111.	Лекция 4. Исчисление секвенций в формате Тейта и теорема о полноте для него. L. D. Beklemishev, F. N. Pakhomov October 15, 2018 16:30
112.	Лекция 3. Доказуемо вычислимые функции теории $\mathsf{EA}$. L. D. Beklemishev October 8, 2018 16:30
113.	Лекция 2. Арифметка элементарных функций $\mathsf{EA}$. L. D. Beklemishev October 1, 2018 16:30
114.	Лекция 1. Программа Гильберта и основания математики. Элементарные по Кальмару функции. L. D. Beklemishev September 24, 2018 16:30
115.	Доказуемо рекурсивные функции, занятие 4 L. D. Beklemishev Summer School "Contemporary Mathematics" named Vitaly Arnold, 2018 July 25, 2018 11:15
116.	Доказуемо рекурсивные функции, занятие 3 L. D. Beklemishev Summer School "Contemporary Mathematics" named Vitaly Arnold, 2018 July 24, 2018 15:30
117.	Доказуемо рекурсивные функции, занятие 2 L. D. Beklemishev Summer School "Contemporary Mathematics" named Vitaly Arnold, 2018 July 22, 2018 11:15
118.	Доказуемо рекурсивные функции, занятие 1 L. D. Beklemishev Summer School "Contemporary Mathematics" named Vitaly Arnold, 2018 July 21, 2018 17:15
119.	Об универсальной модели Крипке для позитивной логики доказуемости с операторами, выражающими консервативность L. D. Beklemishev "Algorithmic problems in algebra and logic" (S.I.Adian seminar) October 24, 2017 18:30
120.	Модель Игнатьева как универсальная алгебра для замкнутого фрагмента позитивной логики доказуемости с операторами консервативности L. D. Beklemishev Seminars "Proof Theory" and "Logic Online Seminar" March 13, 2017 18:30
121.	О позитивной логике доказуемости с операторами консервативности L. D. Beklemishev Seminars "Proof Theory" and "Logic Online Seminar" November 28, 2016 18:30
122.	О позитивной логике доказуемости с операторами консервативности L. D. Beklemishev Seminars "Proof Theory" and "Logic Online Seminar" November 21, 2016 18:30
123.	О позитивной логике доказуемости с операторами, выражающими консервативность L. D. Beklemishev "Algorithmic problems in algebra and logic" (S.I.Adian seminar) November 1, 2016 18:30
124.	Strictly positive fragments of modal and description logic L. D. Beklemishev Colloquium of the Faculty of Computer Science September 20, 2016 18:10
125.	Доказуемость и модальная логика. Занятие 4 L. D. Beklemishev Summer School "Contemporary Mathematics", 2016 July 27, 2016 11:15
126.	Доказуемость и модальная логика. Занятие 3 L. D. Beklemishev Summer School "Contemporary Mathematics", 2016 July 26, 2016 15:30
127.	Доказуемость и модальная логика. Занятие 2 L. D. Beklemishev Summer School "Contemporary Mathematics", 2016 July 24, 2016 11:15
128.	Доказуемость и модальная логика. Занятие 1 L. D. Beklemishev Summer School "Contemporary Mathematics", 2016 July 22, 2016 11:15
129.	Positive provability logic and reflection calculus L. D. Beklemishev Mathematical Logic, Algebra and Computation: A two-day conference dedicated to 85-th anniversary of S. I. Adian July 19, 2016 11:00
130.	О недавних результатах по теории WQO, представленных на конференции Well-quasiorders in Computer Science, Dagstuhl, Jan 2016 (продолжение) L. D. Beklemishev Seminars "Proof Theory" and "Logic Online Seminar" March 14, 2016 18:30
131.	О недавних результатах по теории WQO, представленных на конференции Well-quasiorders in Computer Science, Dagstuhl, Jan 2016 L. D. Beklemishev Seminars "Proof Theory" and "Logic Online Seminar" February 29, 2016 18:30
132.	Логика интерпретируемости. Часть 2 L. D. Beklemishev Seminars "Proof Theory" and "Logic Online Seminar" November 23, 2015 18:30
133.	Логика интерпретируемости. Часть 1 L. D. Beklemishev Seminars "Proof Theory" and "Logic Online Seminar" November 16, 2015 18:30
134.	Интерпретации моделей и логических теорий L. D. Beklemishev MIPT Interdepartmental Seminar on Discrete Mathematics October 21, 2015
135.	О медленно сходящихся системах подстановок термов в логике первого порядка (по совместной работе с А.А. Оноприенко; продолжение) L. D. Beklemishev "Algorithmic problems in algebra and logic" (S.I.Adian seminar) May 19, 2015 18:30
136.	О медленно сходящихся системах подстановок термов в логике первого порядка (по совместной работе с А.А. Оноприенко) L. D. Beklemishev "Algorithmic problems in algebra and logic" (S.I.Adian seminar) May 12, 2015 18:30
137.	Positive logic for reflection principles in arithmetic L. D. Beklemishev Steklov Mathematical Institute Seminar January 22, 2015 16:00
138.	Positive logic for reflection principles in arithmetic L. D. Beklemishev Scientific session of the Steklov Mathematical Institute dedicated to the results of 2014 November 12, 2014 12:00
139.	Доказуемость и разреженная топология L. D. Beklemishev MIPT Interdepartmental Seminar on Discrete Mathematics October 22, 2014
140.	Элементарная геометрия с точки зрения логики. Лекция 3 L. D. Beklemishev Summer School "Contemporary Mathematics", 2014 July 23, 2014 17:00
141.	Элементарная геометрия с точки зрения логики. Лекция 2 L. D. Beklemishev Summer School "Contemporary Mathematics", 2014 July 21, 2014 11:15
142.	Элементарная геометрия с точки зрения логики. Лекция 1 L. D. Beklemishev Summer School "Contemporary Mathematics", 2014 July 20, 2014 17:00
143.	О позитивных логиках доказуемости L. D. Beklemishev "Algorithmic problems in algebra and logic" (S.I.Adian seminar) December 10, 2013 18:30
144.	Probably recursive functions L. D. Beklemishev Colloquium of Steklov Mathematical Institute of Russian Academy of Sciences December 5, 2013 16:00
145.	Что такое логика доказуемости? L. D. Beklemishev Summer School "Contemporary Mathematics", 2013 July 21, 2013 12:45
146.	Прогрессии Тьюринга L. D. Beklemishev MIPT Interdepartmental Seminar on Discrete Mathematics April 17, 2013 18:30
147.	On an arithmetically complete calculus for uniform reflection schemata L. D. Beklemishev "Algorithmic problems in algebra and logic" (S.I.Adian seminar) March 19, 2013 18:30
148.	Fast-growing functions (“Faster, higher, stronger”). Lecture 4 L. D. Beklemishev Summer School "Contemporary Mathematics", 2012 July 26, 2012 15:30
149.	Fast-growing functions (“Faster, higher, stronger”). Lecture 3 L. D. Beklemishev Summer School "Contemporary Mathematics", 2012 July 25, 2012 15:30
150.	Fast-growing functions (“Faster, higher, stronger”). Lecture 2 L. D. Beklemishev Summer School "Contemporary Mathematics", 2012 July 24, 2012 11:15
151.	Fast-growing functions (“Faster, higher, stronger”). Lecture 1 L. D. Beklemishev Summer School "Contemporary Mathematics", 2012 July 22, 2012 17:00
152.	Fast-growing functions (“Faster, higher, stronger”). Introductory lecture L. D. Beklemishev Summer School "Contemporary Mathematics", 2012 July 21, 2012 11:15
153.	Алгебры доказуемости L. D. Beklemishev Meetings of the Moscow Mathematical Society February 28, 2012 18:30
154.	Provability algebras L. D. Beklemishev Globus Seminar February 16, 2012 15:40
155.	Provability algebra and sparse topology L. D. Beklemishev Traditional Christmas session MIAN-POMI, 2009 "Logic and Theoretical Computer Science" December 17, 2009 12:50
156.	Provability algebras and fragments of arithmetic L. D. Beklemishev Steklov Mathematical Institute Seminar October 19, 2006 16:00

Books in Math-Net.Ru

Algorithmic aspects of algebra and logic, Collected papers. Dedicated to Academician Sergei Ivanovich Adian on the occasion of his 80th birthday, Trudy Mat. Inst. Steklova, 274, ed. L. D. Beklemishev, E. F. Mishchenko, 2011, 351 с.
http://mi.mathnet.ru/book1359

Organisations

Registration to the website

Logotypes