The Rogers Semilattices of Generalized Computable Enumerations
- 3 Downloads
We study the cardinality and structural properties of the Rogers semilattice of generalized computable enumerations with arbitrary noncomputable oracles and oracles of hyperimmune Turing degree. We show the infinity of the Rogers semilattice of generalized computable enumerations of an arbitrary nontrivial family with a noncomputable oracle. In the case of oracles of hyperimmune degree we prove that the Rogers semilattice of an arbitrary infinite family includes an ideal without minimal elements and establish that the top, if present, is a limit element under the condition that the family contains the inclusion-least set.
Keywordscomputable enumeration generalized computable enumeration Rogers semilattice hyperimmune set minimal enumeration universal enumeration
Unable to display preview. Download preview PDF.