Order:
  1.  26
    Maximal Pairs of C.E. Reals in the Computably Lipschitz Degrees.Yun Fan & Liang Yu - 2011 - Annals of Pure and Applied Logic 162 (5):357-366.
    Computably Lipschitz reducibility , was suggested as a measure of relative randomness. We say α≤clβ if α is Turing reducible to β with oracle use on x bounded by x+c. In this paper, we prove that for any non-computable real, there exists a c.e. real so that no c.e. real can cl-compute both of them. So every non-computable c.e. real is the half of a cl-maximal pair of c.e. reals.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  10
    Hybrid Cultural Codes in Nonwestern Civil Society: Images of Women in Taiwan and Hong Kong.Ming-Cheng M. Lo & Yun Fan - 2010 - Sociological Theory 28 (2):167 - 192.
    Scholars have established that cultural codes and styles of expression in civil society must be recognized as informal mechanisms of exclusion, calling into question the possibility of the Habermasian normative ideal of the public sphere. This article joins theoretical discussions of how to remedy this problem. Going beyond Alexander's model of "multicultural incorporation" and borrowing from Sewell's theory of the duality of structure, we develop a theoretical framework of code hybridization to conceptualize how civil society participants achieve civil solidarity amid (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  9
    The Partial Orderings of the Computably Enumerable ibT-Degrees and Cl-Degrees Are Not Elementarily Equivalent.Klaus Ambos-Spies, Philipp Bodewig, Yun Fan & Thorsten Kräling - 2013 - Annals of Pure and Applied Logic 164 (5):577-588.
    We show that, in the partial ordering of the computably enumerable computable Lipschitz degrees, there is a degree a>0a>0 such that the class of the degrees which do not cup to a is not bounded by any degree less than a. Since Ambos-Spies [1] has shown that, in the partial ordering of the c.e. identity-bounded Turing degrees, for any degree a>0a>0 the degrees which do not cup to a are bounded by the 1-shift a+1a+1 of a where a+1 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  4.  2
    A Uniform Version of Non-Low2-Ness.Yun Fan - 2017 - Annals of Pure and Applied Logic 168 (3):738-748.