Voir la notice de l'article provenant de la source Math-Net.Ru
@article{IVM_2005_9_a7, author = {B. Ya. Solon}, title = {Total and co-total enumeration degrees}, journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika}, pages = {60--68}, publisher = {mathdoc}, number = {9}, year = {2005}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/IVM_2005_9_a7/} }
B. Ya. Solon. Total and co-total enumeration degrees. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 9 (2005), pp. 60-68. http://geodesic.mathdoc.fr/item/IVM_2005_9_a7/
[1] Soar R.I., Vychislimo perechislimye mnozhestva i stepeni, Kazanskoe matematicheskoe obschestvo, Kazan, 2000, 576 pp. | MR | Zbl
[2] Friedberg R., Rogers H., “Reducibility and completness for sets of integers”, Z. math. Logik Grunde. Math., 5 (1959), 117–125 | DOI | MR | Zbl
[3] Case J., “Enumeration reducibility and partial degrees”, Annals Math. Logic, 2:4 (1971), 419–439 | DOI | MR | Zbl
[4] McEvoy K., “Jumps of quasi-minimal enumeration degrees”, The Journal of Symbolic Logic, 50:3 (1985), 839–848 | DOI | MR | Zbl
[5] Medvedev Yu.T., “Stepeni trudnosti massovykh problem”, DAN SSSR, 104 (1955), 501–504 | MR | Zbl
[6] Polyakov E.A., Rozinas M.G., Teoriya algoritmov, Uchebnoe posobie, Izd-vo Ivanovsk. un-ta, Ivanovo, 1976, 88 pp. | MR
[7] Gutteridge L., Some results on $e$-reducibility, Ph. D. Dins. Simon Univer., Burnaby, 1971
[8] Arslanov M.M., Kuper S.B., Kalimullin I.Sh., “Svoistva rasschepleniya totalnykh $e$-stepenei”, Algebra i logika, 43:1 (2003), 1–25 | MR
[9] Pankratov A., “Issledovanie nekotorykh svoistv $e$-stepenei kototalnykh mnozhestv”, Mezhd. konferentsiya “Logika i prilozheniya”, Tezisy dokladov (Novosibirsk, 2000 g.)
[10] Sasso L.P., “A servey of partial degrees”, J. Symbolic Logic, 40 (1975), 130–140 | DOI | MR | Zbl
[11] Selman L., “Arithmetical reducibilities, I”, Z. Math. Logic Grundlag Math., 17 (1971), 335–350 | DOI | MR | Zbl