Computability in Europe 2006
Logical Approaches to Computational Barriers

Regular Talk:
The jump classes of minimal covers

Speaker: Andrew Edwin Marcus Lewis
Slot: Array, 15:10-15:30, col. 2


We work in $ \mathcal{D}[<0'] $. Given the  jump class of
any (Turing) degree $ a $, the jump classes of the minimal covers of $
a $ is a matter which is entirely settled unless $ a $ is $ high_2 $.
We show that there 
exists a c.e. degree which is $ high_2 $ with no $ high_1 $  minimal

websites: Arnold Beckmann 2006-04-19