Voir la notice de l'article provenant de la source Math-Net.Ru
@article{MZM_2001_69_1_a2, author = {A. N. Degtev}, title = {On $p${-Reducibility} of {Computable} {Numerations}}, journal = {Matemati\v{c}eskie zametki}, pages = {31--35}, publisher = {mathdoc}, volume = {69}, number = {1}, year = {2001}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/MZM_2001_69_1_a2/} }
A. N. Degtev. On $p$-Reducibility of Computable Numerations. Matematičeskie zametki, Tome 69 (2001) no. 1, pp. 31-35. http://geodesic.mathdoc.fr/item/MZM_2001_69_1_a2/
[1] Degtev A. N., “O svodimosti numeratsii”, Matem. sb., 112:2 (1980), 207–219 | MR | Zbl
[2] Ershov Yu. L., Teoriya numeratsii, Nauka, M., 1977
[3] Degtev A. N., “On $p$-reducibility of numerations”, Ann. of Pure and Appl. Logic, 63 (1993), 57–60 | DOI | MR | Zbl
[4] Marchenkov S. S., “O vychislimykh numeratsiyakh semeistv obscherekursivnykh funktsii”, Algebra i logika, 11:5 (1972), 588–607 | MR | Zbl