9 found
Sort by:
  1. Klaus Ambos-Spies, Decheng Ding, Wei Wang & Liang Yu (2009). Bounding Non- GL ₂ and R.E.A. Journal of Symbolic Logic 74 (3):989-1000.
    We prove that every Turing degree a bounding some non-GL₂ degree is recursively enumerable in and above (r.e.a.) some 1-generic degree.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  2. Wei Wang & Decheng Ding (2007). On Definable Filters in Computably Enumerable Degrees. Annals of Pure and Applied Logic 147 (1):71-83.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  3. Wei Wang & Decheng Ding (2007). On the Definable Ideal Generated by the Plus Cupping C.E. Degrees. Archive for Mathematical Logic 46 (3-4):321-346.
    In this paper, we will prove that the plus cupping degrees generate a definable ideal on c.e. degrees different from other ones known so far, thus answering a question asked by Li and Yang (Proceedings of the 7th and the 8th Asian Logic Conferences. World Scientific Press, Singapore, 2003).
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  4. Yongcheng Wu & Decheng Ding (2006). Computability of Measurable Sets Via Effective Topologies. Archive for Mathematical Logic 45 (3):365-379.
    We investigate in the frame of TTE the computability of functions of the measurable sets from an infinite computable measure space such as the measure and the four kinds of set operations. We first present a series of undecidability and incomputability results about measurable sets. Then we construct several examples of computable topological spaces from the abstract infinite computable measure space, and analyze the computability of the considered functions via respectively each of the standard representations of the computable topological spaces (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  5. Yongcheng Wu & Decheng Ding (2005). Computability of Measurable Sets Via Effective Metrics. Mathematical Logic Quarterly 51 (6):543-559.
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  6. Liang Yu & Decheng Ding (2004). There Is No SW-Complete C.E. Real. Journal of Symbolic Logic 69 (4):1163 - 1170.
    We prove that there is no sw-complete c.e. real, negatively answering a question in [6].
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  7. Liang Yu, Decheng Ding & Rodney Downey (2004). The Kolmogorov Complexity of Random Reals. Annals of Pure and Applied Logic 129 (1-3):163-180.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  8. Klaus Ambos-Spies, Marat Arslanov, Douglas Cenzer, Peter Cholak, Chi Tat Chong, Decheng Ding, Rod Downey, Peter A. Fejer, Sergei S. Goncharov & Edward R. Griffor (1998). Participants and Titles of Lectures. Annals of Pure and Applied Logic 94:3-6.
    No categories
     
    My bibliography  
     
    Export citation  
  9. Decheng Ding & Lei Qian (1996). Isolated D.R.E. Degrees Are Dense in R.E. Degree Structure. Archive for Mathematical Logic 36 (1):1-10.
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation