RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
 
Semenov Aleksei L'vovich

Total publications: 36
Scientific articles: 28
in MathSciNet: 32
in zbMATH: 24
in Web of Science: 18
in Scopus: 6
Cited articles: 18
Citations in Math-Net.Ru: 86
Citations in MathSciNet: 120
Citations in Web of Science: 135
Citations in Scopus: 78
Presentations: 9

Number of views:
This page:3662
Abstract pages:7897
Full texts:2318
References:436
Member of the Russian Academy of Sciences
Professor
Doctor of physico-mathematical sciences
Birth date: 13.10.1950
E-mail:

http://www.mathnet.ru/eng/person19667
List of publications on Google Scholar
List of publications on ZentralBlatt
http://www.ams.org/mathscinet/search/author.html?return=viewitems&mrauthid=218197
https://www.researchgate.net/profile/Alexei_Semenov2

Full list of publications:
| by years | by types | by times cited | scientific publications | common list |



   2017
1. A. A. Agrachev, R. V. Gamkrelidze, E. S. Golod, A. B. Zhizhchenko, Yu. I. Zhuravlev, V. V. Kozlov, A. V. Mikhalev, A. V. Ovchinnikov, N. Kh. Rozov, A. L. Semenov, V. G. Chirskii, V. A. Shamolin, “Anniversary of Professor M. V. Shamolin”, Dynamical systems, Itogi Nauki i Tekhniki. Ser. Sovrem. Mat. Pril. Temat. Obz., 134, VINITI, Moscow, 2017, 3–5  mathnet

   2015
2. A. L. Semenov, S. F. Soprunov, “A combinatorial version of the Svenonius theorem on definability”, Log. J. IGPL, 23:6 (2015), 966–975  mathnet  crossref  isi

   2014
3. A. Semenov, S. Soprunov, V. Uspensky, “The lattice of definability. Origins, recent developments, and further directions”, Computer science—theory and applications, Lecture Notes in Comput. Sci., 8476, Springer, Cham, 2014, 23–38  crossref  mathscinet (cited: 1)  zmath  scopus
4. V. L. Arlazarov, E. A. Dinitz, Yu. S. Ilyashenko, A. V. Karzanov, S. M. Karpenko, A. A. Kirillov, N. N. Konstantinov, M. A. Kronrod, O. P. Kuznetsov, L. B. Okun', P. A. Pevzner, A. L. Semenov, I. A. Faradzhev, B. V. Cherkasskii, A. G. Khovanskii, “Georgy Maksimovich Adelson-Velsky (obituary)”, Russian Math. Surveys, 69:4 (2014), 743–751  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib
5. N. N. Andreev, V. M. Buchstaber, A. I. Garber, V. V. Kozlov, S. P. Konovalov, A. A. Mal'tsev, Yu. V. Nesterenko, S. P. Novikov, A. N. Parshin, I. Kh. Sabitov, A. L. Semenov, A. G. Sergeev, O. K. Sheinman, M. I. Shtogrin, E. V. Shchepin, “Nikolai Petrovich Dolbilin (on his 70th birthday)”, Russian Math. Surveys, 69:1 (2014), 181–182  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib

   2013
6. D. A. Archangelsky, B. S. Baizhanov, O. V. Belegradek, V. Ya. Belyaev, L. A. Bokut, M. K. Valiev, S. K. Vodopyanov, M. Gitik, Yu. S. Gurevich, D. O. Daderkin, A. M. Dekhtyar, M. I. Dekhtyar, A. Ya. Dikovsky, S. M. Dudakov, E. I. Zelmanov, B. I. Zilber, S. L. Krushkal, S. S. Kutateladze, Yu. V. Matiyasevich, G. E. Mints, I. Kh. Musikaev, A. K. Rebrov, Yu. G. Reshetnyak, A. L. Semenov, A. P. Stolboushkin, I. A. Taimanov, B. A. Trakhtenbrot, “Mikhail Abramovich Taitslin (1936–2013)”, Sib. Èlektron. Mat. Izv., 10 (2013), 54–65  mathnet

   2011
7. A. L. Semenov, S. F. Soprunov, “Finite quantifier hierarchies in relational algebras”, Proc. Steklov Inst. Math., 274 (2011), 267–272  mathnet  crossref  mathscinet  isi  elib (cited: 1)  elib (cited: 1)  scopus (cited: 1)
8. 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

   2009
9. An. A. Muchnik, Yu. L. Pritykin, A. L. Semenov, “Sequences close to periodic”, Russian Math. Surveys, 64:5 (2009), 805–871  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi (cited: 6)  elib (cited: 6)  elib (cited: 6)  scopus (cited: 7)

   2007
10. S. I. Adian, A. L. Semenov, V. A. Uspenskii, “Andrei Al'bertovich Muchnik (obituary)”, Russian Math. Surveys, 62:4 (2007), 775–779  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi (cited: 1)  elib

   2006
11. A. Muchnik, A. Semenov, “Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets”, Ann. Pure Appl. Logic, 141:3 (2006), 437–441  mathscinet  zmath  isi  elib  scopus
12. 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  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib

   2003
13. An. A. Muchnik, A. L. Semenov, “On the Role of the Law of Large Numbers in the Theory of Randomness”, Problems Inform. Transmission, 39:1 (2003), 119–147  mathnet  crossref  mathscinet  zmath
14. A. L. Semenov, “Finiteness Conditions for Algebras of Relations”, Proc. Steklov Inst. Math., 242 (2003), 92–96  mathnet  mathscinet  zmath
15. A. L. Semenov, A. A. Muchnik, “On the sharpening of Kolmogorov bounds relating to random number generators and to the complexity definition of randomness”, Dokl. Akad. Nauk, 391:6 (2003), 738–740  mathnet  mathscinet  zmath
16. A. Muchnik, A. Semenov, M. Ushakov, “Almost periodic sequences”, Theoret. Comput. Sci., 304:1-3 (2003), 1–33  mathscinet (cited: 11)  zmath  isi (cited: 13)  scopus (cited: 21)
17. A. L. Semenov, M. M. Gorbunov-Possadov, T. A. Polilova, “The school on its way to the new literacy”, Keldysh Institute preprints, 2003, 55–20  mathnet

   1998
18. A. A. Muchnik, A. L. Semenov, V. A. Uspensky, “Mathematical metaphysics of randomness”, Theoret. Comput. Sci., 207:2 (1998), 263–317  mathscinet (cited: 25)  zmath  isi (cited: 42)  scopus (cited: 49)

   1993
19. V. Uspensky, A. Semenov, Algorithms: main ideas and applications, Mathematics and its Applications, 251, Kluwer Academic Publishers Group, Dordrecht, 1993 , xii+269 pp.  mathscinet (cited: 7)

   1992
20. A. V. Arkhangel'skii, B. A. Pasynkov, V. I. Ponomarev, V. V. Fedorchuk, S. P. Gul'ko, V. I. Malykhin, A. L. Semenov, E. V. Shchepin, G. P. Amirdzhanov, A. P. Kombarov, D. V. Ranchin, V. V. Uspenskii, L. B. Shapiro, A. P. Shostak, “Boris Émil'evich Shapirovskii (obituary)”, Russian Math. Surveys, 47:6 (1992), 199–201  mathnet  crossref  mathscinet  isi

   1990
21. V. A. Uspenskii, A. L. Semenov, A. Kh. Shen', “Can an individual sequence of zeros and ones be random?”, Russian Math. Surveys, 45:1 (1990), 121–189  mathnet  crossref  mathscinet  zmath  adsnasa  isi (cited: 52)

   1988
22. A. L. Semenov, “A simple detailed proof for Goedel's incompleteness theorem”, Kybernetika (Prague), 24:6 (1988), 447–451  mathscinet  zmath  isi
23. V. G. Vovk, A. L. Semenov, S. F. Soprunov, “A method for testing the correctness of programs on an assembler”, Voprosy Kibernet. (Moscow), 136, 1988, 56–78  mathscinet

   1987
24. V. A. Uspenskiĭ, A. L. Semenov, Teoriya algoritmov: osnovnye otkrytiya i prilozheniya, Bibliotechka Programmista. [Library for the Programmer], Nauka, Moscow, 1987 , 288 pp.  mathscinet  zmath

   1986
25. A. L. Semenov, V. A. Uspenskiĭ, “Mathematical logic in computer science and computer programming”, Vestnik Akad. Nauk SSSR, 1986, no. 7, 93–103  mathscinet (cited: 1)  isi (cited: 2)
26. A. L. Semenov, “Decision procedures for logical theories”, Cybernetics and computer technology, No. 2, Nauka, Moscow, 1986, 134–146  mathscinet

   1984
27. A. L. Semenov, “Decidability of monadic theories”, Mathematical foundations of computer science, 1984 (Prague, 1984), Lecture Notes in Comput. Sci., 176, Springer, Berlin, 1984, 162–175  mathscinet (cited: 15)

   1983
28. A. L. Semënov, “Logicheskie teorii odnomestnykh funktsii na naturalnom ryade”, Izv. AN SSSR. Ser. matem., 47:3 (1983), 623–658  mathnet (cited: 19)  mathscinet (cited: 9)  zmath; A. L. Semenov, “Logical theories of one-place functions on the set of natural numbers”, Math. USSR-Izv., 22:3 (1984), 587–618  crossref  mathscinet  zmath

   1982
29. A. L. Semenov, “On the definability of arithmetic in its fragments”, Dokl. Akad. Nauk SSSR, 263:1 (1982), 44–47  mathscinet (cited: 2)  zmath  isi (cited: 3)

   1981
30. V. A. Uspensky, A. L. Semenov, “What are the gains of the theory of algorithms: basic developments connected with the concept of algorithm and with its application in mathematics”, Algorithms in modern mathematics and computer science (Urgench, 1979), Lecture Notes in Comput. Sci., 122, Springer, Berlin-New York, 1981, 100–234  mathscinet (cited: 2)

   1980
31. A. L. Semenov, “An interpretation of free algebras in free groups”, Dokl. Akad. Nauk SSSR, 252:6 (1980), 1329–1332  mathscinet (cited: 1)  zmath  isi (cited: 1)

   1979
32. A. L. Semënov, “O nekotorykh rasshireniyakh arifmetiki slozheniya naturalnykh chisel”, Izv. AN SSSR. Ser. matem., 43:5 (1979), 1175–1195  mathnet (cited: 11)  mathscinet (cited: 4)  zmath; A. L. Semenov, “On certain extensions of the arithmetic of addition of natural numbers”, Math. USSR-Izv., 15:2 (1980), 401–418  crossref  mathscinet  zmath  isi (cited: 15)

   1978
33. A. L. Semenov, “Some algorithmic problems for systems of algorithmic algebras”, Dokl. Akad. Nauk SSSR, 239:5 (1978), 1063–1066  mathscinet  zmath

   1977
34. A. L. Semenov, “The Presburger nature of predicates that are regular in two number systems”, Sibirsk. Mat. Ž., 18:2 (1977), 403–418, 479  mathscinet (cited: 18)  zmath

   1974
35. A. L. Semenov, “Regularity of languages that are $k$-linear for different $k$'s”, Dokl. Akad. Nauk SSSR, 215 (1974), 278–281  mathscinet  zmath

   1973
36. A. L. Semenov, “Algorithmic problems for power series and for context-free grammars”, Dokl. Akad. Nauk SSSR, 212 (1973), 50–52  mathscinet (cited: 2)  zmath

Presentations in Math-Net.Ru
1. Российская школьная информатика. Эволюция содержания 1986 - 2016 (в рамках дискуссии «Преподавание информатики в XXI веке»)
International Conference "Strategies for higher educational results"
October 7, 2015 15:00   
2. Welcome speech
International Conference "Strategies for higher educational results"
October 7, 2015 10:00   
3. Круглый стол «Математика и информатика в школе»
Conference "Moscow Mathematical Society and Lomonosov Moscow State University" dedicated to the 150th anniversary of Moscow Mathematical Society
December 25, 2014 10:00
4. Российское школьное математическое образование: история и современность
General Meeting of the Branch of Mathematical Sciences, RAS, 2012
December 17, 2012 13:35   
5. Qualitative theory of algorithms
Summer School "Contemporary Mathematics", 2012
July 21, 2012 12:45   
6. The lattice of relational algebras definable in integers with successor
International workshop "Logical Models of Reasoning and Computation"
February 3, 2012 12:45   
7. Modal logics
Summer School "Contemporary Mathematics", 2011
July 23, 2011 12:45   
8. Proof of impossibility in mathematical logic and theory of algorithms
Summer School "Contemporary Mathematics", 2010
July 23, 2010 12:45   
9. Выразимость и разрешимость
Summer School "Contemporary Mathematics", 2009
July 22, 2009 09:30   

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2017