Sciweavers

APAL
2011
13 years 2 months ago
Upper bounds on ideals in the computably enumerable Turing degrees
We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows t...
George Barmpalias, André Nies