Geodesic
On $sQ$-completeness of recursively enumerable sets
Matematičeskie zametki, Tome 52 (1992) no. 3, pp. 102-107.

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

The concepts of $sQ$-reducibility and $sQ_1$-reducibility are considered, and it is shown that these concepts coincide on the class of recursively enumerable sets. Moreover, a description of $sQ$-complete recursively enumerable sets is presented. 
@article{MZM_1992_52_3_a10,
     author = {R. Sh. Omanadze},
     title = {On $sQ$-completeness of recursively enumerable sets},
     journal = {Matemati\v{c}eskie zametki},
     pages = {102--107},
     publisher = {mathdoc},
     volume = {52},
     number = {3},
     year = {1992},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_1992_52_3_a10/}
}
TY  - JOUR
AU  - R. Sh. Omanadze
TI  - On $sQ$-completeness of recursively enumerable sets
JO  - Matematičeskie zametki
PY  - 1992
SP  - 102
EP  - 107
VL  - 52
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_1992_52_3_a10/
LA  - ru
ID  - MZM_1992_52_3_a10
ER  - 
%0 Journal Article
%A R. Sh. Omanadze
%T On $sQ$-completeness of recursively enumerable sets
%J Matematičeskie zametki
%D 1992
%P 102-107
%V 52
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_1992_52_3_a10/
%G ru
%F MZM_1992_52_3_a10
R. Sh. Omanadze. On $sQ$-completeness of recursively enumerable sets. Matematičeskie zametki, Tome 52 (1992) no. 3, pp. 102-107. http://geodesic.mathdoc.fr/item/MZM_1992_52_3_a10/