An extension of Harrington's noncupping theorem. - Liang Yu 004; Decheng Ding (Sci. China Ser. F Inf. Sci., 2003)

The Kolmogorov complexity of random reals. - Liang Yu 004; Decheng Ding; Rodney G. Downey (Ann. Pure Appl. Log., 2004)

There is no SW-complete c.e. real. - Decheng Ding; Liang Yu 004 (J. Symb. Log., 2004)

There Are No Maximal Low D.C.E. Degrees. - Rod Downey; Liang Yu 004 (Notre Dame J. Formal Log., 2004)

On the definable ideal generated by nonbounding c.e. degrees. - Yue Yang 004; Liang Yu 004 (J. Symb. Log., 2005)

Lowness for Weakly 1-generic and Kurtz-Random. - Frank Stephan 001; Liang Yu 004 (TAMC, 2006)

On Differences Among Elementary Theories of Finite Levels of Ershov Hierarchies. - Yue Yang 004; Liang Yu 004 (TAMC, 2006)

Arithmetical Sacks Forcing. - Rod Downey; Liang Yu 004 (Arch. Math. Log., 2006)

Lowness for genericity. - Liang Yu 004 (Arch. Math. Log., 2006)

Lowness and Π20 nullsets. - Rod Downey; André Nies; Rebecca Weber; Liang Yu 004 (J. Symb. Log., 2006)

On Σ1-structural differences among finite levels of the Ershov hierarchy. - Yue Yang 004; Liang Yu 004 (J. Symb. Log., 2006)

Measure theory aspects of locally countable orderings. - Liang Yu 004 (J. Symb. Log., 2006)

Thin Maximal Antichains in the Turing Degrees. - Chi Tat Chong; Liang Yu 004 (CiE, 2007)

Maximal chains in the Turing degrees. - Chi Tat Chong; Liang Yu 004 (J. Symb. Log., 2007)

Bounding non-GL2 and R.E.A. - Klaus Ambos-Spies; Decheng Ding; Wei Wang 345; Liang Yu 004 (J. Symb. Log., 2009)

Higher Kurtz randomness. - Bjørn Kjos-Hanssen; André Nies; Frank Stephan 001; Liang Yu 004 (Ann. Pure Appl. Log., 2010)

A new proof of Friedman's conjecture. - Liang Yu 004 (Bull. Symb. Log., 2011)

Characterizing strong randomness via Martin-Löf randomness. - Liang Yu 004 (Ann. Pure Appl. Log., 2012)

A reducibility related to being hyperimmune-free. - Frank Stephan 001; Liang Yu 004 (Ann. Pure Appl. Log., 2014)

Recursion Theory - Computational Aspects of Definability. - Chi Tat Chong; Liang Yu 004 (de Gruyter Oldenbourg, 2015)

Randomness in the Higher Setting. - Chi Tat Chong; Liang Yu 004 (J. Symb. Log., 2015)

On Martin's pointed tree theorem. - Rupert Hölzl 001; Frank Stephan 001; Liang Yu 004 (Comput., 2016)

On the Reals Which Cannot Be Random. - Liang Yu 004; Yizheng Zhu (Computability and Complexity, 2017)

BASIS THEOREMS FOR ${ rm{ Sigma }}_2^1$ -SETS. - Chi Tat Chong; Liuzhen Wu; Liang Yu 004 (J. Symb. Log., 2019)

Being low along a sequence and elsewhere. - Wolfgang Merkle; Liang Yu 004 (J. Symb. Log., 2019)

An Application of Recursion Theory to Analysis. - Liang Yu 004 (Bull. Symb. Log., 2020)

Chaitin's ω as a continuous function. - Rupert Hölzl 001; Wolfgang Merkle; Joseph S. Miller; Frank Stephan 001; Liang Yu 004 (J. Symb. Log., 2020)

On Trees Without Hyperimmune Branches. - Keng Meng Ng; Frank Stephan 001; Yue Yang 004; Liang Yu 004 (CiE, 2022)

Luzin's (n) and Randomness Reflection. - Arno Pauly; Linda Westrick; Liang Yu 004 (J. Symb. Log., 2022)

Some Consequences of and. - Yinhe Peng; Liuzhen Wu; Liang Yu 004 (J. Symb. Log., 2023)

The Point-to-Set Principle and the dimensions of Hamel bases. - Jack H. Lutz; Renrui Qi; Liang Yu 004 (Comput., 2024)