Existence of families without positive numerations
Matematičeskie zametki, Tome 13 (1973) no. 4, pp. 597-604.

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

An example is constructed of a computable family of recursively enumerable sets which does not have computable positive numerations but does possess a computable minimal numeration.
@article{MZM_1973_13_4_a15,
     author = {S. S. Marchenkov},
     title = {Existence of families without positive numerations},
     journal = {Matemati\v{c}eskie zametki},
     pages = {597--604},
     publisher = {mathdoc},
     volume = {13},
     number = {4},
     year = {1973},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_1973_13_4_a15/}
}
TY  - JOUR
AU  - S. S. Marchenkov
TI  - Existence of families without positive numerations
JO  - Matematičeskie zametki
PY  - 1973
SP  - 597
EP  - 604
VL  - 13
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_1973_13_4_a15/
LA  - ru
ID  - MZM_1973_13_4_a15
ER  - 
%0 Journal Article
%A S. S. Marchenkov
%T Existence of families without positive numerations
%J Matematičeskie zametki
%D 1973
%P 597-604
%V 13
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_1973_13_4_a15/
%G ru
%F MZM_1973_13_4_a15
S. S. Marchenkov. Existence of families without positive numerations. Matematičeskie zametki, Tome 13 (1973) no. 4, pp. 597-604. http://geodesic.mathdoc.fr/item/MZM_1973_13_4_a15/