A hierarchy of classes of families and $n$-low degrees
Algebra i logika, Tome 54 (2015) no. 4, pp. 536-541
Presented by the Program Committee of the Conference “Mal'tsev Readings”.
@article{AL_2015_54_4_a8,
author = {I. Sh. Kalimullin and M. Kh. Faizrakhmanov},
title = {A hierarchy of classes of families and $n$-low degrees},
journal = {Algebra i logika},
pages = {536--541},
year = {2015},
volume = {54},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/AL_2015_54_4_a8/}
}
I. Sh. Kalimullin; M. Kh. Faizrakhmanov. A hierarchy of classes of families and $n$-low degrees. Algebra i logika, Tome 54 (2015) no. 4, pp. 536-541. http://geodesic.mathdoc.fr/item/AL_2015_54_4_a8/
[1] S. Goncharov, V. Harizanov, J. Knight, C. McCoy, R. Miller, R. Solomon, “Enumerations in computable structure theory”, Ann. Pure Appl. Logic, 136:3 (2005), 219–246 | DOI | MR | Zbl
[2] I. N. Soskov, “A note on $\omega$-jump inversion of degree spectra of structures”, The nature of computation. Logic, algorithms, applications, Proc. 9th conference on computability in Europe (CiE 2013, Milan, Italy, July 1–5, 2013), Lect. Notes Comput. Sci., 7921, eds. P. Bonizzoni et al., Springer-Verlag, Berlin, 2013, 365–370 | DOI | MR | Zbl
[3] S. Wehner, “Enumerations, countable structures, and Turing degrees”, Proc. Am. Math. Soc., 126:7 (1998), 2131–2139 | DOI | MR | Zbl