Liang Yu

32 papers C 4Journal 26Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
On the hausdorff dimension of maximal chains and antichains of turing and hyperarithmetic degrees.
Arch. Math. Log.
Sirun Song, Liang Yu
2024 J jnl
The Point-to-Set Principle and the dimensions of Hamel bases.
Comput.
Jack H. Lutz, Renrui Qi, Liang Yu
2023 J jnl
Some Consequences of and.
J. Symb. Log.
Yinhe Peng, Liuzhen Wu, Liang Yu
2022 J jnl
Luzin's (n) and Randomness Reflection.
J. Symb. Log.
Arno Pauly, Linda Westrick, Liang Yu
2022 C conf
On Trees Without Hyperimmune Branches.
CiE
Keng Meng Ng, Frank Stephan, Yue Yang, Liang Yu
2020 J jnl
An Application of Recursion Theory to Analysis.
Bull. Symb. Log.
Liang Yu
2020 J jnl
Chaitin's ω as a continuous function.
J. Symb. Log.
Rupert Hölzl, Wolfgang Merkle, Joseph S. Miller, Frank Stephan, Liang Yu
2019 J jnl
BASIS THEOREMS FOR ${\rm{\Sigma }}_2^1$ -SETS.
J. Symb. Log.
Chi Tat Chong, Liuzhen Wu, Liang Yu
2019 J jnl
Being low along a sequence and elsewhere.
J. Symb. Log.
Wolfgang Merkle, Liang Yu
2017 — conf
On the Reals Which Cannot Be Random.
Computability and Complexity
Liang Yu, Yizheng Zhu
2016 J jnl
On Martin's pointed tree theorem.
Comput.
Rupert Hölzl, Frank Stephan, Liang Yu
2015 J jnl
Randomness in the Higher Setting.
J. Symb. Log.
Chi Tat Chong, Liang Yu
2015 — book
Recursion Theory - Computational Aspects of Definability.
Chi Tat Chong, Liang Yu
2014 J jnl
A reducibility related to being hyperimmune-free.
Ann. Pure Appl. Log.
Frank Stephan, Liang Yu
2012 J jnl
Characterizing strong randomness via Martin-Löf randomness.
Ann. Pure Appl. Log.
Liang Yu
2011 J jnl
A new proof of Friedman's conjecture.
Bull. Symb. Log.
Liang Yu
2010 J jnl
Higher Kurtz randomness.
Ann. Pure Appl. Log.
Bjørn Kjos-Hanssen, André Nies, Frank Stephan, Liang Yu
2009 J jnl
Bounding non-GL
J. Symb. Log.
Klaus Ambos-Spies, Decheng Ding, Wei Wang, Liang Yu
2007 J jnl
Maximal chains in the Turing degrees.
J. Symb. Log.
Chi Tat Chong, Liang Yu
2007 C conf
Thin Maximal Antichains in the Turing Degrees.
CiE
Chi Tat Chong, Liang Yu
2006 J jnl
Arithmetical Sacks Forcing.
Arch. Math. Log.
Rod Downey, Liang Yu
2006 J jnl
Lowness and Π
J. Symb. Log.
Rod Downey, André Nies, Rebecca Weber, Liang Yu
2006 C conf
Lowness for Weakly 1-generic and Kurtz-Random.
TAMC
Frank Stephan, Liang Yu
2006 J jnl
Lowness for genericity.
Arch. Math. Log.
Liang Yu
2006 J jnl
Measure theory aspects of locally countable orderings.
J. Symb. Log.
Liang Yu
2006 C conf
On Differences Among Elementary Theories of Finite Levels of Ershov Hierarchies.
TAMC
Yue Yang, Liang Yu
2006 J jnl
On Σ
J. Symb. Log.
Yue Yang, Liang Yu
2005 J jnl
On the definable ideal generated by nonbounding c.e. degrees.
J. Symb. Log.
Yue Yang, Liang Yu
2004 J jnl
The Kolmogorov complexity of random reals.
Ann. Pure Appl. Log.
Liang Yu, Decheng Ding, Rodney G. Downey
2004 J jnl
There Are No Maximal Low D.C.E. Degrees.
Notre Dame J. Formal Log.
Rod Downey, Liang Yu
2004 J jnl
There is no
J. Symb. Log.
Decheng Ding, Liang Yu
2003 J jnl
An extension of Harrington's noncupping theorem.
Sci. China Ser. F Inf. Sci.
Liang Yu, Decheng Ding