Upper bounds on ideals in the computably enumerable Turing degrees (Q639654)

In this paper the following interesting results are obtained. Every proper \(\Sigma^0_4\) ideal of the c.e. Turing degrees has an incomplete upper bound. Every proper \(\Sigma^0_3\) ideal in the c.e. Turing degrees has a low\(_2\) upper bound. The partial order of \(\Sigma^0_3\) ideals under inclusion in the c.e. degrees is dense.