Isolation in the CEA hierarchy (Q1766924)

To say that \(A\) {isolates} \(B\) in the \(n\)-CEA degrees means that (1)~\(A<_TB\) and (2)~there exists no \(n\)-CEA set~\(C\) with \(A<_TC<_TB\). This paper shows that for all \(n\geq 1\), there exist \(n\)-c.e.~\(A\) and \((n+1)\)-c.e.~\(B\) such that \(A\) isolates \(B\) in the \(n\)-CEA degrees. In fact, given any noncomputable c.e. set~\(D\), one may choose \(B\) so that \(B<_TD\). On the other hand, given any \(\Sigma^0_2\) set~\(D\), one may choose \(A\) to be low and \(B\) to satisfy \(B'\geq_TD\).