Geodesic
Embedding of Countable Orders in Turing Degrees
Matematičeskie zametki, Tome 72 (2002) no. 5, pp. 682-687

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

In their classical papers, Lerman, Lachlan, and Lebeuf developed the embedding method, which provides constructions of initial segments of Turing degrees isomorphic to various partially ordered structures. We analyze this method and prove that there is a nonzero degree below each decreasing chain of degrees uniform in $\mathbf 0'$. This imposes restrictions on the application of the embedding method. 
@article{MZM_2002_72_5_a5,
     author = {Sh. T. Ishmukhametov},
     title = {Embedding of {Countable} {Orders} in {Turing} {Degrees}},
     journal = {Matemati\v{c}eskie zametki},
     pages = {682--687},
     publisher = {mathdoc},
     volume = {72},
     number = {5},
     year = {2002},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2002_72_5_a5/}
}
TY  - JOUR
AU  - Sh. T. Ishmukhametov
TI  - Embedding of Countable Orders in Turing Degrees
JO  - Matematičeskie zametki
PY  - 2002
SP  - 682
EP  - 687
VL  - 72
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2002_72_5_a5/
LA  - ru
ID  - MZM_2002_72_5_a5
ER  - 
%0 Journal Article
%A Sh. T. Ishmukhametov
%T Embedding of Countable Orders in Turing Degrees
%J Matematičeskie zametki
%D 2002
%P 682-687
%V 72
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2002_72_5_a5/
%G ru
%F MZM_2002_72_5_a5
Sh. T. Ishmukhametov. Embedding of Countable Orders in Turing Degrees. Matematičeskie zametki, Tome 72 (2002) no. 5, pp. 682-687. http://geodesic.mathdoc.fr/item/MZM_2002_72_5_a5/