A semilattice generated by superlow computably enumerable degrees
M. Kh. Faĭzrahmanov · Russian Mathematics · 2011
We prove that a partially ordered set of all computably enumerable (c. e.) degrees that are the least upper bounds of two superlow c. e. degrees is an upper semilattice not elementary equivalent to the semilattice of all c. e. degrees.