Works by Guohua Wu ( view other items matching `Guohua Wu`, view all matches )

6 found
Sort by:
  1. Chengling Fang & Guohua Wu (2012). Nonhemimaximal Degrees and the High/Low Hierarchy. Journal of Symbolic Logic 77 (2):433-446.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  2. Jiang Liu & Guohua Wu (2011). An Almost-Universal Cupping Degree. Journal of Symbolic Logic 76 (4):1137-1152.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  3. Rod Downey, Steffen Lempp & Guohua Wu (2010). On the Complexity of the Successivity Relation in Computable Linear Orderings. Journal of Mathematical Logic 10 (01n02):83-99.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  4. Guohua Wu (2006). Jump Operator and Yates Degrees. Journal of Symbolic Logic 71 (1):252 - 264.
    In [9]. Yates proved the existence of a Turing degree a such that 0. 0′ are the only c.e. degrees comparable with it. By Slaman and Steel [7], every degree below 0′ has a 1-generic complement, and as a consequence. Yates degrees can be 1-generic, and hence can be low. In this paper, we prove that Yates degrees occur in every jump class.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  5. Guohua Wu (2004). Bi-Isolation in the D.C.E. Degrees. Journal of Symbolic Logic 69 (2):409 - 420.
    In this paper, we study the bi-isolation phenomena in the d.c.e. degrees and prove that there are c.e. degrees c₁ < c₂ and a d.c.e. degree d ∈ (c₁, c₂) such that (c₁, d) and (d, c₂) contain no c.e. degrees. Thus, the c.e. degrees between c₁ and c₂ are all incomparable with d. We also show that there are d.c.e. degrees d₁ < d₂ such that (d₁, d₂) contains a unique c.e. degree.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  6. Guohua Wu (2002). Isolation and Lattice Embeddings. Journal of Symbolic Logic 67 (3):1055-1064.
    Say that (a, d) is an isolation pair if a is a c.e. degree, d is a d.c.e. degree, a < d and a bounds all c.e. degrees below d. We prove that there are an isolation pair (a, d) and a c.e. degree c such that c is incomparable with a, d, and c cups d to o', caps a to o. Thus, {o, c, d, o'} is a diamond embedding, which was first proved by Downey in [9]. Furthermore, (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation