Birth date: 13.10.1950
E-mail:
Keywords: Decidability of logical theories, definability in structures word combinatorics, symbolic dynamics, almost periodic sequences definability, reducts, Svenonius theorem
UDC: 517.11, 519.9, 510.53, 510.6, 621.391.1, 519.2, 510.5, 519.101, 517.938, 510.635

Subject:

Mathematical Foundation of Computer Science

Main publications:

1. S. A. Polikarpov, A. L. Semenov, “Mathematics for the 21th Century School: The Russian Experience and International Prospects”, Proceedings of the 13th international Congress on Mathematical Education (ICME-13). (Hamburg 2016), eds. Gabriele Kaiser, Springer International Publishing AG, Cham, Switzerland, 2017, 675–676  
2. A. L. Semenov, “O realizatsii kontseptsii matematicheskogo obrazovaniya”, Nauka i shkola, 6 (2016), 3
3. A. L. Semenov, S. F. Soprunov, “A combinatorial version of the Svenonius theorem on definability”, Log. J. IGPL, 23:6 (2015), 966–975      
4. A. L. Semenov, “O fundamentalnykh ponyatiyakh kibernetiki i informatiki”, Vestnik kibernetiki, 3(19) (2015), 22–26  
5. 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        
6. A. L. Semenov, S. F. Soprunov, “Finite quantifier hierarchies in relational algebras”, Proc. Steklov Inst. Math., 274 (2011), 267–272              
7. A. L. Semenov, S. F. Soprunov, Lattice of relational algebras definable in integers with successor, 2011 , arXiv: 1201.4439
8. An. A. Muchnik, Yu. L. Pritykin, A. L. Semenov, “Sequences close to periodic”, Russian Math. Surveys, 64:5 (2009), 805–871                    
9. Alexei Semenov, Information and Communication Technologies in Schools. A Handbook for Teachers or How ICT Can Create New, Open Learning Environments, UNESCO, Paris, 2005 , 327 pp.; A. L. Semenov, Informatsionnye i kommunikatsionnye tekhnologii v obschem obrazovanii: teoriya i praktika. Avtorizovannyi per. s angl., pererabotannyi i dopolnennyi, YuNESKO, 2006 , 327 pp.
10. 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        
11. A. L. Semenov, A. A. Muchnik, “An Improvement of Kolmogorov’s Estimates Related to Random Number Generators and a Definition of Randomness in terms of complexity”, Dokl. Akad. Nauk, 68:1 (2003), 132–134      
12. A. Muchnik, A. Semenov, M. Ushakov, “Almost periodic sequences”, Theoret. Comput. Sci., 304:1-3 (2003), 1–33          
13. Alexei Semenov, Andrej Muchnik, “40 years of the Origin of Kolmgorov Randomness Theory”, Sb. Kolmogorov i sovremennaya matematika. Tezisy dokladov Mezhdunarodnoi konferentsii, posvyaschennoi 100-letiyu so dnya rozhdeniya A. N. Kolmogorova (Moskva, 16 – 21 iyunya 2003), Izdatelstvo mekhaniko-matematicheskogo fakulteta MGU, 2003, 677–678  
14. A. A. Muchnik, A. L. Semenov, V. A. Uspensky, “Mathematical metaphysics of randomness”, Theoret. Comput. Sci., 207:2 (1998), 263–317          
15. A. L. Semenov, “Informatika v rossiiskoi srednei shkole: doklad na plenarnom zasedanii II Mezhdunarodnogo kongressa YuNESKO «Obrazovanie i informatika»”, Informatika i obrazovanie, 5 (1996), 29
16. V. Uspensky, A. Semenov, Algorithms: main ideas and applications, Mathematics and its Applications, 251, Kluwer Academic Publishers Group, Dordrecht, 1993 , xii+269 pp.  
17. V. A. Uspensky, A. L. Semenov, “Kolmogorov’s Algorithms or Machines”, Selected Works of A. N. Kolmogorov. Vol. III. Information and the Theory of Algorithms., III, Math. Appl. Kluwer Academic Publishers, 1993, 251–260    
18. 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            
19. V. A. Uspenskii, A. L. Semenov, “Algoritmy, ili mashiny Kolmogorova”, A. N. Kolmogorov. Teoriya informatsii i teoriya algoritmov. Izbrannye trudy, eds. A. N. Shiryaev, Nauka, Moskva, 1987, 279–289  
20. V. A. Uspenskii, A. L. Semenov, Teoriya algoritmov: osnovnye otkrytiya i prilozheniya, Bibliotechka programmista, Nauka, 1987 , 288 pp.    
21. A. L. Semenov, V. A. Uspenskii, “Matematicheskaya logika v vychislitelnykh naukakh i vychislitelnoi praktike”, Vestnik Akademii nauk SSSR, 56:7 (1986), 93–103    
22. 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      
23. A. L. Semenov, “Logical theories of one-place functions on the set of natural numbers”, Math. USSR-Izv., 22:3 (1984), 587–618        
24. A. L. Semenov, “On certain extensions of the arithmetic of addition of natural numbers”, Math. USSR-Izv., 15:2 (1980), 401–418          
25. A. L. Semenov, “Regulyarnost yazykov, $k$-lineinykh dlya razlichnykh $k$”, Doklady Akademii nauk SSSR, 215 (1974), 278–281      
26. A. L. Semenov, “Algorthmic Problems for Power Series and Context-free Grammars”, Soviet Mathematics, 14 (1973), 1319        

Recent publications

Presentations in Math-Net.Ru

Personal pages:

• 
• 
• 
• 
• 
• ISTINA
• 
• 
• 
• 
• 

Organisations:

• Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
• Moscow Institute of Physics and Technology (National Research University), Dolgoprudny, Moscow Region
• Federal Research Center "Computer Science and Control" of Russian Academy of Sciences, Moscow
• Moscow State Pedagogical University
• Moscow Institute of Open Education
• Dorodnitsyn Computing Centre of the Russian Academy of Sciences, Moscow
• Institute of New Technologies
• Science Counsil RAS on Complex Problem 'Cybernetics' RAS
• Moscow Mathematical Society