Isolated d-r.e. degree below r.e. degree (Q1895496)

A degree \({\mathbf d}\) is d-r.e. if it is a Turing degree containing some difference of two r.e. sets. And a d-r.e. degree \({\mathbf d}\) is isolated if there is an r.e. degree \({\mathbf a} < {\mathbf d}\) such that all degrees below \({\mathbf d}\) are below or equal to \({\mathbf a}\). B. Cooper and X. Yu have shown that, for any noncomplete r.e. degree \({\mathbf a}\), there is an isolated d-r.e. degree \({\mathbf b}\) above \({\mathbf a}\). The paper under review proves the other direction that there is an isolated d-r.e. degree below any nonrecursive degree.