Automorphisms of the lattice of recursively enumerable sets: Orbits (Q1186287)

An r.e. set \(A\) is hemimaximal if there are a maximal set \(M\) and disjoint r.e. sets \(A_ 0\), \(A_ 1\) such that \(A_ 0\cup A_ 1=M\), each \(A_ i\), \(i=0,1\) is nonrecursive, and \(A_ 0=A\). The following surprising result is proved. Theorem 3. If \(C\), \(D\) are hemimaximal sets, then there is \(\Phi\in\text{Aut}({\mathcal E})\) such that \(\Phi(C)=D\). Let \(H=\{\deg(A)\): \(A\) is hemimaximal\}. It is shown that: (a) For every nonzero \(c\) r.e., there is \(a<c\) such that \(a\in H\). (b) \(H_ 1\subseteq H\). (c) There is a nonzero degree \(c\) such that \(c\not\in H\). (d) For all \(a<b\), if \(b\in L_ 1\), there is a degree \(c\not\in H\) such that \(a\leq c\leq b\). An r.e. set \(A\) is halfhemimaximal if there are disjoint r.e. sets \(A_ 0\), \(A_ 1\) such that \(A=A_ 0\cup A_ 1\), each \(A_ i\) is nonrecursive, and \(A_ 0\) is hemimaximal. It is shown that every halfhemimaximal set is automorphic to a complete set. Every nonzero r.e. degree contains a nonhalfhemimaximal set. An r.e. set \(Q\) is \(k\)-quasimaximal if \(Q\) is the intersection of exactly \(k\) maximal sets which are pairwise infinitely different. Theorem 14. Let \(A\) and \(B\) be \(k\)-quasimaximal and \(A_ 0\), \(A_ 1\) and \(B_ 0\), \(B_ 1\) be Friedberg splittings of \(A\) and \(B\), respectively. Then there is \(\Phi\in\text{Aut}({\mathcal E})\) such that \(\Phi(A_ 0)=B_ 0\). Some open questions are given.