We stand with Ukraine  

Liang Yu

Affiliations:
  • Nanjing University, Institute of Mathematical Science and State key Laboratory for Novel Software Technology, Nanjing, China
  • National University of Singapore, School of Computing and Department of Mathematics, Singapore (2005 - 2006)
  • Victoria University of Wellington, School of Mathematical and Computing Sciences, Wellington, New Zealand (2003 - 2005)
  • Nanjing University, Department of Mathematics, Nanjing, China (PhD 2003)


According to our database1, Liang Yu authored at least 31 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Point-to-Set Principle and the dimensions of Hamel bases.
[BibTeX]
[DOI]
Jack H. Lutz
,
Renrui Qi
,
Liang Yu
Comput., 2024

2023
Some Consequences of and.
[BibTeX]
[DOI]
Yinhe Peng
,
Liuzhen Wu
,
Liang Yu
J. Symb. Log., 2023

2022
Luzin's (n) and Randomness Reflection.
[BibTeX]
[DOI]
Arno Pauly
,
Linda Westrick
,
Liang Yu
J. Symb. Log., 2022

On Trees Without Hyperimmune Branches.
[BibTeX]
[DOI]
Keng Meng Ng
,
Frank Stephan
,
Yue Yang
,
Liang Yu
Proceedings of the Revolutions and Revelations in Computability, 2022

2020
Chaitin's ω as a continuous function.
[BibTeX]
[DOI]
Rupert Hölzl
,
Wolfgang Merkle
,
Joseph S. Miller
,
Frank Stephan
,
Liang Yu
J. Symb. Log., 2020

An Application of Recursion Theory to Analysis.
[BibTeX]
[DOI]
Liang Yu
Bull. Symb. Log., 2020

2019
Being low along a sequence and elsewhere.
[BibTeX]
[DOI]
Wolfgang Merkle
,
Liang Yu
J. Symb. Log., 2019

BASIS THEOREMS FOR ${\rm{\Sigma }}_2^1$ -SETS.
[BibTeX]
[DOI]
Chi Tat Chong
,
Liuzhen Wu
,
Liang Yu
J. Symb. Log., 2019

2017
On the Reals Which Cannot Be Random.
[BibTeX]
[DOI]
Liang Yu
,
Yizheng Zhu
Proceedings of the Computability and Complexity, 2017

2016
On Martin's pointed tree theorem.
[BibTeX]
[DOI]
Rupert Hölzl
,
Frank Stephan
,
Liang Yu
Comput., 2016

2015
Randomness in the Higher Setting.
[BibTeX]
[DOI]
Chi Tat Chong
,
Liang Yu
J. Symb. Log., 2015

Recursion Theory - Computational Aspects of Definability.
[BibTeX]
[DOI]
Chi Tat Chong
,
Liang Yu
de Gruyter series in logic and its applications 8, de Gruyter Oldenbourg, ISBN: 978-3-11-027555-1, 2015

2014
A reducibility related to being hyperimmune-free.
[BibTeX]
[DOI]
Frank Stephan
,
Liang Yu
Ann. Pure Appl. Log., 2014

2012
Characterizing strong randomness via Martin-Löf randomness.
[BibTeX]
[DOI]
Liang Yu
Ann. Pure Appl. Log., 2012

2011
A new proof of Friedman's conjecture.
[BibTeX]
[DOI]
Liang Yu
Bull. Symb. Log., 2011

2010
Higher Kurtz randomness.
[BibTeX]
[DOI]
Bjørn Kjos-Hanssen
,
André Nies
,
Frank Stephan
,
Liang Yu
Ann. Pure Appl. Log., 2010

2009
Bounding non-GL<sub>2</sub> and R.E.A.
[BibTeX]
[DOI]
Klaus Ambos-Spies
,
Decheng Ding
,
Wei Wang
,
Liang Yu
J. Symb. Log., 2009

2007
Maximal chains in the Turing degrees.
[BibTeX]
[DOI]
Chi Tat Chong
,
Liang Yu
J. Symb. Log., 2007

Thin Maximal Antichains in the Turing Degrees.
[BibTeX]
[DOI]
Chi Tat Chong
,
Liang Yu
Proceedings of the Computation and Logic in the Real World, 2007

2006
Measure theory aspects of locally countable orderings.
[BibTeX]
[DOI]
Liang Yu
J. Symb. Log., 2006

On Σ<sub>1</sub>-structural differences among finite levels of the Ershov hierarchy.
[BibTeX]
[DOI]
Yue Yang
,
Liang Yu
J. Symb. Log., 2006

Lowness and Π<sub>2</sub><sup>0</sup> nullsets.
[BibTeX]
[DOI]
Rod Downey
,
André Nies
,
Rebecca Weber
,
Liang Yu
J. Symb. Log., 2006

Lowness for genericity.
[BibTeX]
[DOI]
Liang Yu
Arch. Math. Log., 2006

Arithmetical Sacks Forcing.
[BibTeX]
[DOI]
Rod Downey
,
Liang Yu
Arch. Math. Log., 2006

On Differences Among Elementary Theories of Finite Levels of Ershov Hierarchies.
[BibTeX]
[DOI]
Yue Yang
,
Liang Yu
Proceedings of the Theory and Applications of Models of Computation, 2006

Lowness for Weakly 1-generic and Kurtz-Random.
[BibTeX]
[DOI]
Frank Stephan
,
Liang Yu
Proceedings of the Theory and Applications of Models of Computation, 2006

2005
On the definable ideal generated by nonbounding c.e. degrees.
[BibTeX]
[DOI]
Yue Yang
,
Liang Yu
J. Symb. Log., 2005

2004
There Are No Maximal Low D.C.E. Degrees.
[BibTeX]
[DOI]
Rod Downey
,
Liang Yu
Notre Dame J. Formal Log., 2004

There is no <i>SW</i>-complete c.e. real.
[BibTeX]
[DOI]
Decheng Ding
,
Liang Yu
J. Symb. Log., 2004

The Kolmogorov complexity of random reals.
[BibTeX]
[DOI]
Liang Yu
,
Decheng Ding
,
Rodney G. Downey
Ann. Pure Appl. Log., 2004

2003
An extension of Harrington's noncupping theorem.
[BibTeX]
[DOI]
Liang Yu
,
Decheng Ding
Sci. China Ser. F Inf. Sci., 2003


  Loading...