Geodesic
The reducibility of computable enumerations
Algebra i logika, Tome 8 (1969) no. 2, pp. 251-264

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{AL_1969_8_2_a7,
     author = {A. B. Khutoretskii},
     title = {The reducibility of computable enumerations},
     journal = {Algebra i logika},
     pages = {251--264},
     publisher = {mathdoc},
     volume = {8},
     number = {2},
     year = {1969},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/AL_1969_8_2_a7/}
}
TY  - JOUR
AU  - A. B. Khutoretskii
TI  - The reducibility of computable enumerations
JO  - Algebra i logika
PY  - 1969
SP  - 251
EP  - 264
VL  - 8
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/AL_1969_8_2_a7/
LA  - ru
ID  - AL_1969_8_2_a7
ER  - 
%0 Journal Article
%A A. B. Khutoretskii
%T The reducibility of computable enumerations
%J Algebra i logika
%D 1969
%P 251-264
%V 8
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/AL_1969_8_2_a7/
%G ru
%F AL_1969_8_2_a7
A. B. Khutoretskii. The reducibility of computable enumerations. Algebra i logika, Tome 8 (1969) no. 2, pp. 251-264. http://geodesic.mathdoc.fr/item/AL_1969_8_2_a7/