Abstract

In this paper, we prove that there exist computably enumerable degrees $\mathbf{a}$ and $\mathbf{b}$ such that $\mathbf{a} > \mathbf{b}$ and for any degree $\mathbf{x}$, if $\mathbf{x} \leq a$ and $\mathbf{x}$ is a minimal degree, then $\mathbf{x} < \mathbf{b}$.