Splitting in 2-computably enumerable degrees with avoiding cones (Q735982): Difference between revisions

It is proven that for any pair of properly 2-c.e.\ Turing degrees \({\mathbf 0} <{\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 above \({\mathbf d}\). In other words, given \({\mathbf d}\) and \({\mathbf a}\) as above, there exist 2-c.e.\ degrees \({\mathbf x}_0\) and \({\mathbf x}_1\) such that \({\mathbf a}\leq {\mathbf x}_0\cup{\mathbf x}_1\), \({\mathbf x}_0<{\mathbf a}\), \({\mathbf x}_1<{\mathbf a}\), \({\mathbf d}\not\leq{\mathbf x}_0\) and \({\mathbf d}\not\leq{\mathbf x}_1\). The author also points out that the hypothesis that there are no c.e.\ degrees between \({\mathbf d}\) and \({\mathbf a}\) cannot be removed.