Switch to: References

Add citations

You must login to add citations.
  1. Splitting and nonsplitting II: A low {\sb 2$} C.E. degree about which ${\bf 0}'$ is not splittable.S. Barry Cooper & Angsheng Li - 2002 - Journal of Symbolic Logic 67 (4):1391-1430.
    It is shown that there exists a low2 Harrington non-splitting base-that is, a low2 computably enumerable (c.e.) degree a such that for any c.e. degrees x, y, if $0' = x \vee y$ , then either $0' = x \vee a$ or $0' = y \vee a$ . Contrary to prior expectations, the standard Harrington non-splitting construction is incompatible with the $low_{2}-ness$ requirements to be satisfied, and the proof given involves new techniques with potentially wider application.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • There Are No Maximal Low D.C.E. Degrees.Liang Yu & Rod Downey - 2004 - Notre Dame Journal of Formal Logic 45 (3):147-159.
    We prove that there is no maximal low d.c.e degree.
    Download  
     
    Export citation  
     
    Bookmark   1 citation