Upper semilattice of recursively enumerable Q-degrees (Q1071761): Difference between revisions

It is proved that among all \(m\)-degrees belonging to the \({\mathcal Q}\)- degree of a maximal set there exists a least \(m\)-degree. It is shown that the \({\mathcal Q}\)-degree of a maximal set does not coincide with the upper bound for incomparable \({\mathcal Q}\)-degrees. In particular this implies that \(Th(L_{{\mathcal Q}})\neq Th(L_ r)\) for \(r\in \{Wtt,T\}\), where \(Th(L_ r)\) is the elementary theory of the upper semilattice of r.e. r- degrees. It is established that the r.e. \({\mathcal Q}\)-degree is contained in \({\mathcal O}'\).