Low$_2$ computably enumerable sets have hyperhypersimple supersets
Preprint
Abstract
A longstanding question is to characterize the lattice of supersets (modulo finite sets), $L^*(A)$, of a low$_2$ computably enumerable (c.e.) set. The conjecture is that $L^*(A)\cong {E}^*$ the lattice of all c.e. sets. In spite of claims in the literature, this longstanding question/conjecture remains open. We contribute to this problem by solving one of the main test cases. We show that if c.e. $A$ is low$_2$ then $A$ has an atomless, hyperhypersimple superset.
Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Automorphisms of the lattice of recursively enumerable setsMemoirs of the American Mathematical Society, 1995
- Post's program and incomplete recursively enumerable sets.Proceedings of the National Academy of Sciences, 1991
- Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable SetsTransactions of the American Mathematical Society, 1983
- Automorphisms of the lattice of recursively enumerable sets. Part II: Low setsAnnals of Mathematical Logic, 1982
- Jump Restricted Interpolation in the Recursively Enumerable DegreesAnnals of Mathematics, 1971
- Degrees of recursively enumerable sets which have no maximal supersetsThe Journal of Symbolic Logic, 1968
- Classes of Recursively Enumerable Sets and Degrees of UnsolvabilityMathematical Logic Quarterly, 1966
- Recursively enumerable sets of positive integers and their decision problemsBulletin of the American Mathematical Society, 1944