Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Frolov, Andrey Nikolaevich

Statistics Math-Net.Ru
Total publications: 20
Scientific articles: 20
Presentations: 2

Number of views:
This page:1110
Abstract pages:2867
Full texts:865
References:448
Associate professor
Doctor of physico-mathematical sciences (2004)
Speciality: 01.01.06 (Mathematical logic, algebra, and number theory)
E-mail: ,
Keywords: computable copies of structures and relations, spectra of Boolean algebras and linear orders.
UDC: 510.53, 512.562, 510.57, 512.565, 510.5, 510.6

Subject:

Computability theory and computable model theory.

   
Main publications:
  1. A. N. Frolov, “Lineinye poryadki nizkoi stepeni”, Sib. matem. zhurn., 51:5 (2010), 1147–1162
  2. Frolov A.N., “Low linear orderings”, Journal of Logic and Computation, 22:4 (2012), 745-754
  3. A. N. Frolov, “Predstavleniya otnosheniya sosedstva vychislimogo lineinogo poryadka”, Izv. vuzov. Matem., 2010, № 7, 73–85
  4. A. N. Frolov, “Vychislimaya predstavimost schetnykh lineinykh poryadkov”, Itogi nauki i tekhn. Ser. Sovrem. mat. i ee pril. Temat. obz., 158 (2018), 81–115
  5. M. V. Zubkov, A. N. Frolov, “Vychislimye lineinye poryadki i predelno monotonnye funktsii”, Itogi nauki i tekhn. Ser. Sovrem. mat. i ee pril. Temat. obz., 157 (2018), 70–105

http://www.mathnet.ru/eng/person35255
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/729769

Publications in Math-Net.Ru
2020
1. M. V. Zubkov, A. N. Frolov, “Спектральная универсальность линейных порядков с одним бинарным отношением”, Sibirsk. Mat. Zh., 61:3 (2020),  587–593  mathnet
2019
2. M. V. Zubkov, I. Sh. Kalimullin, A. G. Mel'nikov, A. N. Frolov, “Punctual copies of algebraic structures”, Sibirsk. Mat. Zh., 60:6 (2019),  1271–1285  mathnet  elib; Siberian Math. J., 60:6 (2019), 993–1002  isi  scopus
2018
3. A. N. Frolov, “Computable presentability of countable linear orders”, Itogi Nauki i Tekhniki. Ser. Sovrem. Mat. Pril. Temat. Obz., 158 (2018),  81–115  mathnet  mathscinet
4. I. Sh. Kalimullin, V. L. Selivanov, A. N. Frolov, “Degree spectra of structures”, Itogi Nauki i Tekhniki. Ser. Sovrem. Mat. Pril. Temat. Obz., 158 (2018),  23–39  mathnet  mathscinet
5. M. V. Zubkov, A. N. Frolov, “Computable linear orders and limitwise monotonic functions”, Itogi Nauki i Tekhniki. Ser. Sovrem. Mat. Pril. Temat. Obz., 157 (2018),  70–105  mathnet  mathscinet
6. Ya. A. Mikhailovskaya, A. N. Frolov, “Computable linear orders and the Ershov hierarchy”, Izv. Vyssh. Uchebn. Zaved. Mat., 2018, 1,  67–74  mathnet; Russian Math. (Iz. VUZ), 62:1 (2018), 58–64  isi  scopus
2017
7. N. A. Bazhenov, A. N. Frolov, I. Sh. Kalimullin, A. G. Melnikov, “Computability of distributive lattices”, Sibirsk. Mat. Zh., 58:6 (2017),  1236–1251  mathnet  elib; Siberian Math. J., 58:6 (2017), 959–970  isi  scopus
8. A. N. Frolov, “On a computable presentation of low linear orders”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 159:4 (2017),  518–528  mathnet  elib
9. R. I. Bikmukhametov, M. S. Eryashkin, A. N. Frolov, “Degree spectra of the block relation of $1$-computable linear orders”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 159:3 (2017),  296–305  mathnet  mathscinet  elib
2015
10. A. N. Frolov, “Effective categoricity of computable linear orderings”, Algebra Logika, 54:5 (2015),  638–642  mathnet  mathscinet; Algebra and Logic, 54:5 (2015), 415–417  isi
2013
11. A. N. Frolov, “A note on $\Delta_2^0$-spectra of linear orderings and degree spectra of the successor relation”, Izv. Vyssh. Uchebn. Zaved. Mat., 2013, 11,  74–78  mathnet; Russian Math. (Iz. VUZ), 57:11 (2013), 65–68  scopus
2012
12. A. N. Frolov, “Ranges of $\eta$-functions of $\eta$-like linear orderings”, Izv. Vyssh. Uchebn. Zaved. Mat., 2012, 3,  96–99  mathnet  mathscinet; Russian Math. (Iz. VUZ), 56:3 (2012), 87–89  scopus
13. A. N. Frolov, “Linear orderings. Coding theorems”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 154:2 (2012),  142–151  mathnet
2010
14. A. N. Frolov, “Presentations of the successor relation of computably linear ordering”, Izv. Vyssh. Uchebn. Zaved. Mat., 2010, 7,  73–85  mathnet  mathscinet; Russian Math. (Iz. VUZ), 54:7 (2010), 64–74  scopus
15. A. N. Frolov, “Linear orderings of low degree”, Sibirsk. Mat. Zh., 51:5 (2010),  1147–1162  mathnet  mathscinet; Siberian Math. J., 51:5 (2010), 913–925  isi  scopus
2009
16. P. E. Alaev, J. Thurber, A. N. Frolov, “Computability on linear orderings enriched with predicates”, Algebra Logika, 48:5 (2009),  549–563  mathnet  mathscinet  zmath; Algebra and Logic, 48:5 (2009), 313–320  isi  scopus
2006
17. A. N. Frolov, “$\Delta_2^0$-Copies of Linear Orderings”, Algebra Logika, 45:3 (2006),  354–370  mathnet  mathscinet  zmath; Algebra and Logic, 45:3 (2006), 201–209  scopus
18. A. N. Frolov, “SET-1 reducibility in the class of computable sets”, Izv. Vyssh. Uchebn. Zaved. Mat., 2006, 8,  69–75  mathnet  mathscinet; Russian Math. (Iz. VUZ), 50:8 (2006), 65–70
19. A. N. Frolov, “Set-theoretic reducibilities in a lattice of sets”, Izv. Vyssh. Uchebn. Zaved. Mat., 2006, 1,  57–67  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 50:1 (2006), 55–64
2003
20. A. N. Frolov, “Set-theoretic structure of computable sets”, Izv. Vyssh. Uchebn. Zaved. Mat., 2003, 10,  70–76  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 47:10 (2003), 68–74

Presentations in Math-Net.Ru
1. Algorithmic properties of relations on computable linear orders
A. N. Frolov
Computable linear orders and linearly ordered structures
September 21, 2019
2. Счетные линейные порядки и их алгоритмические свойства
A. N. Frolov
Omsk Algebraic Seminar
November 21, 2013 16:00

Organisations
 
Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2022