Splitting of 2-computably enumerable degrees with avoiding cones
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 6 (2009), pp. 76-80
Voir la notice de l'article provenant de la source Math-Net.Ru
In this paper we show that for any pair of properly 2-c. e. degrees $\mathbf0\mathbf d\mathbf a$ such that there are no c. e. degrees between $\mathbf d$ and $\mathbf a$, the degree $\mathbf a$ is splittable in the class of 2-c. e. degrees avoiding the upper cone of $\mathbf d$. We also study the possibility to characterize such an isolation in terms of splitting.
Keywords:
2-c. e. degrees, Turing degrees, splitting, splitting with avoiding cones, isolation.
@article{IVM_2009_6_a11,
author = {M. M. Yamaleev},
title = {Splitting of 2-computably enumerable degrees with avoiding cones},
journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
pages = {76--80},
publisher = {mathdoc},
number = {6},
year = {2009},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/IVM_2009_6_a11/}
}
M. M. Yamaleev. Splitting of 2-computably enumerable degrees with avoiding cones. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 6 (2009), pp. 76-80. http://geodesic.mathdoc.fr/item/IVM_2009_6_a11/