@article{IVM_2009_7_a7,
author = {M. V. Zubkov},
title = {One theorem about strongly $\eta$-representable sets},
journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
pages = {77--81},
year = {2009},
number = {7},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/IVM_2009_7_a7/}
}
M. V. Zubkov. One theorem about strongly $\eta$-representable sets. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 7 (2009), pp. 77-81. http://geodesic.mathdoc.fr/item/IVM_2009_7_a7/
[1] Soar R. I., Vychislimo perechislimye mnozhestva i stepeni, Kazansk. matem. o-vo, Kazan, 2000, 576 pp. | MR | Zbl
[2] Downey R. G., “Computability theory and linear orderings”, Handbook of computable algebra, V. 2, Elsevier, Amsterdam, 1998, 823–976 | MR | Zbl
[3] Rosenstein J., Linear orderings, Academic Press, New York, 1982, 487 pp. | MR | Zbl
[4] Fellner S., Recursive and finite axiomatizability of linear orderings, Ph. D. Thesis, Rutgers. Univ., 1976
[5] Lerman M., “On recursive linear orderings”, Lect. Notes Math., 859, 1981, 132–142 | MR | Zbl
[6] Harris K., “$\eta$-representation of sets and degrees”, J. Symbolic Logic, 73 (2008), 1097–1121 | DOI | MR | Zbl
[7] Arslanov M. M., Ierarkhiya Ershova, Izd-vo KGU, Kazan, 2007, 86 pp.
[8] Kach A. M., Turetsky D., Limitwise monotonic functions, sets and degrees on computable domaine, submission http://www.math.uconn.edu/~kach/mathematics/mymathematics.html