The hypersimple-free c.e. wtt degrees are dense in the c.e. wtt degrees

We show that in the c.e. weak truth table degrees if b < c then there is an a which contains no hypersimple set and b < a < c. We also show that for every w < c in the c.e. wtt degrees such that w is hypersimple, there is a hypersimple a such that w < a < c. On the other hand, we know that there are intervals which contain no hypersimple set

On New Notions of Algorithmic Dimension, Immunity, and Medvedev Degree

Ph.D