JSYML
2011
14 years 10 months ago
2011
We prove that for every Σ0 2 enumeration degree b there exists a noncuppable Σ0 2 degree a > 0e such that b ≤e a and a ≤e b . This allows us to deduce, from results on the...