Order:
  1.  10
    There Is No SW-Complete C.E. Real.Liang Yu & Decheng Ding - 2004 - 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 (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  2.  26
    Bounding Non- GL ₂ and R.E.A.Klaus Ambos-Spies, Decheng Ding, Wei Wang & Liang Yu - 2009 - 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 (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  3.  19
    Isolated D.R.E. Degrees Are Dense in R.E. Degree Structure.Decheng Ding & Lei Qian - 1996 - Archive for Mathematical Logic 36 (1):1-10.
  4.  10
    The Kolmogorov Complexity of Random Reals.Liang Yu, Decheng Ding & Rodney Downey - 2004 - Annals of Pure and Applied Logic 129 (1-3):163-180.
    We investigate the initial segment complexity of random reals. Let K denote prefix-free Kolmogorov complexity. A natural measure of the relative randomness of two reals α and β is to compare complexity K and K. It is well-known that a real α is 1-random iff there is a constant c such that for all n, Kn−c. We ask the question, what else can be said about the initial segment complexity of random reals. Thus, we study the fine behaviour of K (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  5.  31
    On the Definable Ideal Generated by the Plus Cupping C.E. Degrees.Wei Wang & Decheng Ding - 2007 - 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).
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6.  19
    Computability of Measurable Sets Via Effective Metrics.Yongcheng Wu & Decheng Ding - 2005 - Mathematical Logic Quarterly 51 (6):543-559.
    We consider how to represent the measurable sets in an infinite measure space. We use sequences of simple measurable sets converging under metrics to represent general measurable sets. Then we study the computability of the measure and the set operators of measurable sets with respect to such representations.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  7.  14
    On Definable Filters in Computably Enumerable Degrees.Wei Wang & Decheng Ding - 2007 - Annals of Pure and Applied Logic 147 (1):71-83.
  8.  10
    Participants and Titles of Lectures.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 - Annals of Pure and Applied Logic 94 (1):3-6.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  9.  12
    Computability of Measurable Sets Via Effective Topologies.Yongcheng Wu & Decheng Ding - 2005 - 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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark