Persons: Frolov, Andrey Nikolaevich

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

Frolov, Andrey Nikolaevich

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

Number of views:
This page:	1599
Abstract pages:	4717
Full texts:	1543
References:	657

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:

A. N. Frolov, “Lineinye poryadki nizkoi stepeni”, Sib. matem. zhurn., 51:5 (2010), 1147–1162
Frolov A.N., “Low linear orderings”, Journal of Logic and Computation, 22:4 (2012), 745-754
A. N. Frolov, “Predstavleniya otnosheniya sosedstva vychislimogo lineinogo poryadka”, Izv. vuzov. Matem., 2010, № 7, 73–85
A. N. Frolov, “Vychislimaya predstavimost schetnykh lineinykh poryadkov”, Itogi nauki i tekhn. Ser. Sovrem. mat. i ee pril. Temat. obz., 158 (2018), 81–115
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

https://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	Citations
	2022
1.	Y. A. Michailovskaya, A. N. Frolov, “Computable linear orders and the Ershov hierarchy”, Izv. Vyssh. Uchebn. Zaved. Mat., 2022, no. 1, 85–89 ; Russian Math. (Iz. VUZ), 66:1 (2022), 71–74	1
	2020
2.	M. V. Zubkov, A. N. Frolov, “Spectral universality of linear orders with one binary relation”, Sibirsk. Mat. Zh., 61:3 (2020), 587–593 ; Siberian Math. J., 61:3 (2020), 463–467
	2019
3.	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 ; Siberian Math. J., 60:6 (2019), 993–1002	3
	2018
4.	A. N. Frolov, “Computable presentability of countable linear orders”, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 158 (2018), 81–115 ; J. Math. Sci. (N. Y.), 256:2 (2021), 199–233	3
5.	I. Sh. Kalimullin, V. L. Selivanov, A. N. Frolov, “Degree spectra of structures”, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 158 (2018), 23–39 ; J. Math. Sci. (N. Y.), 256:2 (2021), 143–159	2
6.	M. V. Zubkov, A. N. Frolov, “Computable linear orders and limitwise monotonic functions”, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 157 (2018), 70–105 ; J. Math. Sci. (N. Y.), 256:1 (2021), 61–95	3
7.	Ya. A. Mikhailovskaya, A. N. Frolov, “Computable linear orders and the Ershov hierarchy”, Izv. Vyssh. Uchebn. Zaved. Mat., 2018, no. 1, 67–74 ; Russian Math. (Iz. VUZ), 62:1 (2018), 58–64	2
	2017
8.	N. A. Bazhenov, A. N. Frolov, I. Sh. Kalimullin, A. G. Melnikov, “Computability of distributive lattices”, Sibirsk. Mat. Zh., 58:6 (2017), 1236–1251 ; Siberian Math. J., 58:6 (2017), 959–970	4
9.	A. N. Frolov, “On a computable presentation of low linear orders”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 159:4 (2017), 518–528
10.	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	1
	2015
11.	A. N. Frolov, “Effective categoricity of computable linear orderings”, Algebra Logika, 54:5 (2015), 638–642 ; Algebra and Logic, 54:5 (2015), 415–417	14
	2013
12.	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, no. 11, 74–78 ; Russian Math. (Iz. VUZ), 57:11 (2013), 65–68	6
	2012
13.	A. N. Frolov, “Ranges of $\eta$-functions of $\eta$-like linear orderings”, Izv. Vyssh. Uchebn. Zaved. Mat., 2012, no. 3, 96–99 ; Russian Math. (Iz. VUZ), 56:3 (2012), 87–89	2
14.	A. N. Frolov, “Linear orderings. Coding theorems”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 154:2 (2012), 142–151	2
	2010
15.	A. N. Frolov, “Presentations of the successor relation of computably linear ordering”, Izv. Vyssh. Uchebn. Zaved. Mat., 2010, no. 7, 73–85 ; Russian Math. (Iz. VUZ), 54:7 (2010), 64–74	12
16.	A. N. Frolov, “Linear orderings of low degree”, Sibirsk. Mat. Zh., 51:5 (2010), 1147–1162 ; Siberian Math. J., 51:5 (2010), 913–925	19
	2009
17.	P. E. Alaev, J. Thurber, A. N. Frolov, “Computability on linear orderings enriched with predicates”, Algebra Logika, 48:5 (2009), 549–563 ; Algebra and Logic, 48:5 (2009), 313–320	20
	2006
18.	A. N. Frolov, “$\Delta_2^0$-Copies of Linear Orderings”, Algebra Logika, 45:3 (2006), 354–370 ; Algebra and Logic, 45:3 (2006), 201–209	30
19.	A. N. Frolov, “SET-1 reducibility in the class of computable sets”, Izv. Vyssh. Uchebn. Zaved. Mat., 2006, no. 8, 69–75 ; Russian Math. (Iz. VUZ), 50:8 (2006), 65–70
20.	A. N. Frolov, “Set-theoretic reducibilities in a lattice of sets”, Izv. Vyssh. Uchebn. Zaved. Mat., 2006, no. 1, 57–67 ; Russian Math. (Iz. VUZ), 50:1 (2006), 55–64	1
	2003
21.	A. N. Frolov, “Set-theoretic structure of computable sets”, Izv. Vyssh. Uchebn. Zaved. Mat., 2003, no. 10, 70–76 ; Russian Math. (Iz. VUZ), 47:10 (2003), 68–74	1

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

Registration to the website

Logotypes