Bi-Isolated d.c.e. Degrees and 1 Induction
Abstract
A Turing degree is d.c.e. if it contains a set that is the difference of two c.e. sets. A d.c.e. degree d is isolated if there exists a c.e. degree a<d such that every c.e. degree below d is also below a; d is upper isolated if there exists a c.e. degree a>d such that every c.e. degree above d is also above a; d is bi-isolated if it is both isolated and upper isolated. In this paper, we prove the existence of bi-isolated d.c.e. degrees in models of I1.
0
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.