Voir la notice de l'article provenant de la source Math-Net.Ru
@article{IVM_2006_1_a7, author = {A. N. Frolov}, title = {Set-theoretic reducibilities in a lattice of sets}, journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika}, pages = {57--67}, publisher = {mathdoc}, number = {1}, year = {2006}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/IVM_2006_1_a7/} }
A. N. Frolov. Set-theoretic reducibilities in a lattice of sets. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 1 (2006), pp. 57-67. http://geodesic.mathdoc.fr/item/IVM_2006_1_a7/
[1] Maltsev A. I., Algoritmy i rekursivnye funktsii, Nauka, M., 1986, 367 pp. | MR
[2] Soare R. I., Recursively enumerable sets and degrees, Springer-Verlag, Heidelberg, 1987, 243 pp. | MR
[3] Degtev A. N., Rekursivno perechislimye mnozhestva i svodimosti tablichnogo tipa, Nauka, M., 1998, 176 pp. | Zbl
[4] Goncharov S. S., Schetnye bulevy algebry i razreshimost, Nauchnaya kniga, Novosibirsk, 1996, 364 pp. | MR