Low2 computably enumerable sets have hyperhypersimple supersets
Abstract
A longstanding question is to characterize the lattice of supersets (modulo finite sets), L*(A), of a low2 computably enumerable (c.e.) set. The conjecture is that L*(A) E*. 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 low2 then A has an atomless hyperhypersimple superset. In fact, if A is c.e.\ and low2, then for any 3-Boolean algebra~B there is some c.e.\ H⊃eq A such that L*(H) B.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.