Switch to: References

Add citations

You must login to add citations.
  1. Infima of d.r.e. degrees.Jiang Liu, Shenling Wang & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (1):35-49.
    Lachlan observed that the infimum of two r.e. degrees considered in the r.e. degrees coincides with the one considered in the ${\Delta_2^0}$ degrees. It is not true anymore for the d.r.e. degrees. Kaddah proved in (Ann Pure Appl Log 62(3):207–263, 1993) that there are d.r.e. degrees a, b, c and a 3-r.e. degree x such that a is the infimum of b, c in the d.r.e. degrees, but not in the 3-r.e. degrees, as a < x < b, c. In (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The existence of high nonbounding degrees in the difference hierarchy.Chi Tat Chong, Angsheng Li & Yue Yang - 2006 - Annals of Pure and Applied Logic 138 (1):31-51.
    We study the jump hierarchy of d.c.e. Turing degrees and show that there exists a high d.c.e. degree d which does not bound any minimal pair of d.c.e. degrees.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Interpolating d-r.e. and REA degrees between r.e. degrees.Marat Arslanov, Steffen Lempp & Richard A. Shore - 1996 - Annals of Pure and Applied Logic 78 (1-3):29-56.
    We provide three new results about interpolating 2-r.e. or 2-REA degrees between given r.e. degrees: Proposition 1.13. If c h are r.e. , c is low and h is high, then there is an a h which is REA in c but not r.e. Theorem 2.1. For all high r.e. degrees h g there is a properly d-r.e. degree a such that h a g and a is r.e. in h . Theorem 3.1. There is an incomplete nonrecursive r.e. A (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations