Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have