Doklady Akademii Nauk, Tome 194 (1970) no. 3, pp. 500-503
Citer cet article
M. I. Kanovich. Complexity of the decidability of an enumerable set as a criterion of its universality. Doklady Akademii Nauk, Tome 194 (1970) no. 3, pp. 500-503. http://geodesic.mathdoc.fr/item/DAN_1970_194_3_a4/
@article{DAN_1970_194_3_a4,
author = {M. I. Kanovich},
title = {Complexity of the decidability of an enumerable set as a criterion of its universality},
journal = {Doklady Akademii Nauk},
pages = {500--503},
year = {1970},
volume = {194},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DAN_1970_194_3_a4/}
}
TY - JOUR
AU - M. I. Kanovich
TI - Complexity of the decidability of an enumerable set as a criterion of its universality
JO - Doklady Akademii Nauk
PY - 1970
SP - 500
EP - 503
VL - 194
IS - 3
UR - http://geodesic.mathdoc.fr/item/DAN_1970_194_3_a4/
LA - ru
ID - DAN_1970_194_3_a4
ER -
%0 Journal Article
%A M. I. Kanovich
%T Complexity of the decidability of an enumerable set as a criterion of its universality
%J Doklady Akademii Nauk
%D 1970
%P 500-503
%V 194
%N 3
%U http://geodesic.mathdoc.fr/item/DAN_1970_194_3_a4/
%G ru
%F DAN_1970_194_3_a4
