Voir la notice de l'article provenant de la source Math-Net.Ru
@article{MZM_1999_66_2_a4, author = {A. N. Degtev}, title = {Almost semirecursive sets}, journal = {Matemati\v{c}eskie zametki}, pages = {188--193}, publisher = {mathdoc}, volume = {66}, number = {2}, year = {1999}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/MZM_1999_66_2_a4/} }
A. N. Degtev. Almost semirecursive sets. Matematičeskie zametki, Tome 66 (1999) no. 2, pp. 188-193. http://geodesic.mathdoc.fr/item/MZM_1999_66_2_a4/
[1] Jockusch C. G., “Semirecursive sets and positive reducibility”, Trans. Amer. Math. Soc., 131 (1968), 420–436 | DOI | MR | Zbl
[2] Jockusch C. G., Owings J. C., “Weakly semirecursive sets and r.e. orderings”, J. Symbolic Logic, 55 (1990), 637–644 | DOI | MR | Zbl
[3] Kummer M., Stephan F., “Weakly semirecursive sets and r.e. orderings”, Ann. Pure Appl. Logic, 60 (1993), 133–150 | DOI | MR | Zbl
[4] Rozinas M. G., Solon B. Ya., “Slabo polurekursivnye mnozhestva”, Izv. vuzov. Matem., 1979, no. 12, 48–50 | MR | Zbl
[5] Yates C. E. M., “Recursively enumerable sets and retracing functions”, Z. Math. Logik Grundlag. Math., 8:4 (1962), 331–345 | DOI | MR | Zbl