Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Soprunov, Sergei Fedorovich
Candidate of physico-mathematical sciences (1977)
Speciality: 01.01.06 (Mathematical logic, algebra, and number theory)
E-mail: ,
Website: http://logic.math.msu.ru/staff/soprunov/

https://www.mathnet.ru/eng/person71404
List of publications on Google Scholar
https://elibrary.ru/author_items.asp?authorid=1052195
ISTINA https://istina.msu.ru/workers/8103289

Publications in Math-Net.Ru Citations
2025
1. A. L. Semenov, M. A. Babenko, A. Ya. Belov, N. K. Vereshchagin, M. E. Vishnikin, E. E. Zolin, V. N. Krupski, S. L. Kuznetsov, V. A. Lyubetskii, A. A. Onoprienko, M. R. Pentus, S. F. Soprunov, A. A. Sorokin, V. B. Shehtman, T. L. Yavorskaya, “Chair of Mathematical Logic and Theory of Algorithms”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2025, no. 1,  23–32  mathnet  elib; Moscow University Mathematics Bulletin, 80:1 (2025), 23–33
2023
2. A. L. Semenov, S. F. Soprunov, I. A. Ivanov-Pogodaev, “Creating new mathematics by schoolchildren”, Dokl. RAN. Math. Inf. Proc. Upr., 511 (2023),  138–143  mathnet  elib; Dokl. Math., 107:Suppl 1 (2023), S132–S136
2021
3. A. L. Semenov, S. F. Soprunov, “The lattice of definability. Origins and directions of research”, Chebyshevskii Sb., 22:1 (2021),  304–327  mathnet; Doklady Mathematics (Supplementary issues), 106:2 (2022), 288–298 1
4. A. L. Semenov, S. F. Soprunov, “Lattice of definability (of reducts) for integers with successor”, Izv. RAN. Ser. Mat., 85:6 (2021),  245–258  mathnet  zmath; Izv. Math., 85:6 (2021), 1257–1269  isi  scopus 6
2020
5. V. B. Betelin, A. G. Kushnirenko, A. L. Semenov, S. F. Soprunov, “About digital literacy and environments for its development”, Inform. Primen., 14:4 (2020),  100–107  mathnet 9
2015
6. A. L. Semenov, S. F. Soprunov, “A combinatorial version of the Svenonius theorem on definability”, Log. J. IGPL, 23:6 (2015), 966, 975 pp.  mathnet  isi 3
2011
7. A. L. Semenov, S. F. Soprunov, “Finite quantifier hierarchies in relational algebras”, Trudy Mat. Inst. Steklova, 274 (2011),  291–296  mathnet  mathscinet  elib; Proc. Steklov Inst. Math., 274 (2011), 267–272  isi  elib  scopus 3
1975
8. S. F. Soprunov, “Initial segments of nonstandard arithmetics”, Dokl. Akad. Nauk SSSR, 223:3 (1975),  576–577  mathnet  mathscinet  zmath
9. S. F. Soprunov, “Strong nonstandard models of arithmetic”, Dokl. Akad. Nauk SSSR, 220:2 (1975),  293–296  mathnet  mathscinet  zmath
2021
10. T. A. Rudchenko, S. F. Soprunov, A. Yu. Uvarov, “70 year jubilee of academician Alexei L. Semenov”, Chebyshevskii Sb., 22:1 (2021),  27–56  mathnet

Presentations in Math-Net.Ru
1. Recent results on definability lattices of numerical structures
A. L. Semenov, S. F. Soprunov
Second Conference of Russian Mathematical Centers. Section «Mathematical Logic and Theoretical Computer Science»
November 9, 2022 16:00   
2. Бесконечные ветви в разрешимых деревьях
S. F. Soprunov
Seminars "Proof Theory" and "Logic Online Seminar"
April 9, 2018 18:30
3. The lattice of relational algebras definable in integers with successor
Aleksei Semenov, Sergei Soprunov
International workshop "Logical Models of Reasoning and Computation"
February 3, 2012 12:45   

Organisations