default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiang Yu 0004
Person information
- affiliation: Nanjing University, Institute of Mathematical Science and State key Laboratory for Novel Software Technology, Nanjing, China
- affiliation (2005 - 2006): National University of Singapore, School of Computing and Department of Mathematics, Singapore
- affiliation (2003 - 2005): Victoria University of Wellington, School of Mathematical and Computing Sciences, Wellington, New Zealand
- affiliation (PhD 2003): Nanjing University, Department of Mathematics, Nanjing, China
Other persons with the same name
- Liang Yu — disambiguation page
- Liang Yu 0001
![[0000-0001-5015-0320]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-5015-0320")
— Nanjing University of Posts and Telecommunications, College of Automation and College of Artificial Intelligence, Nanjing, China (and 2 more) - Liang Yu 0002 — Xidian University, School of Computer Science and Technology, Xi'an Key Laboratory of Computational Bioinformatics, Shaanxi, China
- Liang Yu 0003 — Northwestern Polytechnical University, School of Civil Aviation, Xi'an, China (and 2 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2015
[b1]Chi Tat Chong, Liang Yu:
Recursion Theory - Computational Aspects of Definability. de Gruyter series in logic and its applications 8, de Gruyter Oldenbourg 2015, ISBN 978-3-11-027555-1, pp. I-XIII, 1-306
Journal Articles
- 2024
- [j25]Jack H. Lutz, Renrui Qi, Liang Yu:
The Point-to-Set Principle and the dimensions of Hamel bases. Comput. 13(2): 105-112 (2024) - 2023
- [j24]Yinhe Peng, Liuzhen Wu, Liang Yu:
Some Consequences of and. J. Symb. Log. 88(4): 1573-1589 (2023) - 2022
- [j23]Arno Pauly, Linda Westrick, Liang Yu:
Luzin's (n) and Randomness Reflection. J. Symb. Log. 87(2): 802-828 (2022) - 2020
- [j22]Liang Yu:
An Application of Recursion Theory to Analysis. Bull. Symb. Log. 26(1): 15-25 (2020) - [j21]Rupert Hölzl, Wolfgang Merkle, Joseph S. Miller, Frank Stephan, Liang Yu:
Chaitin's ω as a continuous function. J. Symb. Log. 85(1): 486-510 (2020) - 2019
- [j20]Chi Tat Chong, Liuzhen Wu, Liang Yu:
BASIS THEOREMS FOR ${\rm{\Sigma }}_2^1$ -SETS. J. Symb. Log. 84(1): 376-387 (2019) - [j19]Wolfgang Merkle, Liang Yu:
Being low along a sequence and elsewhere. J. Symb. Log. 84(2): 497-516 (2019) - 2016
- [j18]Rupert Hölzl, Frank Stephan, Liang Yu:
On Martin's pointed tree theorem. Comput. 5(2): 147-157 (2016) - 2015
- [j17]Chi Tat Chong, Liang Yu:
Randomness in the Higher Setting. J. Symb. Log. 80(4): 1131-1148 (2015) - 2014
- [j16]Frank Stephan, Liang Yu:
A reducibility related to being hyperimmune-free. Ann. Pure Appl. Log. 165(7-8): 1291-1300 (2014) - 2012
- [j15]Liang Yu:
Characterizing strong randomness via Martin-Löf randomness. Ann. Pure Appl. Log. 163(3): 214-224 (2012) - 2011
- [j14]Liang Yu:
A new proof of Friedman's conjecture. Bull. Symb. Log. 17(3): 455-461 (2011) - 2010
- [j13]Bjørn Kjos-Hanssen, André Nies, Frank Stephan, Liang Yu:
Higher Kurtz randomness. Ann. Pure Appl. Log. 161(10): 1280-1290 (2010) - 2009
- [j12]Klaus Ambos-Spies, Decheng Ding, Wei Wang, Liang Yu:
Bounding non-GL2 and R.E.A. J. Symb. Log. 74(3): 989-1000 (2009) - 2007
- [j11]Chi Tat Chong, Liang Yu:
Maximal chains in the Turing degrees. J. Symb. Log. 72(4): 1219-1227 (2007) - 2006
- [j10]Liang Yu:
Lowness for genericity. Arch. Math. Log. 45(2): 233-238 (2006) - [j9]Rod Downey, Liang Yu:
Arithmetical Sacks Forcing. Arch. Math. Log. 45(6): 715-720 (2006) - [j8]Liang Yu:
Measure theory aspects of locally countable orderings. J. Symb. Log. 71(3): 958-968 (2006) - [j7]Rod Downey, André Nies, Rebecca Weber, Liang Yu:
Lowness and Π20 nullsets. J. Symb. Log. 71(3): 1044-1052 (2006) - [j6]Yue Yang, Liang Yu:
On Σ1-structural differences among finite levels of the Ershov hierarchy. J. Symb. Log. 71(4): 1223-1236 (2006) - 2005
- [j5]Yue Yang, Liang Yu:
On the definable ideal generated by nonbounding c.e. degrees. J. Symb. Log. 70(1): 252-270 (2005) - 2004
- [j4]Liang Yu, Decheng Ding, Rodney G. Downey:
The Kolmogorov complexity of random reals. Ann. Pure Appl. Log. 129(1-3): 163-180 (2004) - [j3]Decheng Ding, Liang Yu:
There is no SW-complete c.e. real. J. Symb. Log. 69(4): 1163-1170 (2004) - [j2]Rod Downey, Liang Yu:
There Are No Maximal Low D.C.E. Degrees. Notre Dame J. Formal Log. 45(3): 147-159 (2004) - 2003
- [j1]Liang Yu, Decheng Ding:
An extension of Harrington's noncupping theorem. Sci. China Ser. F Inf. Sci. 46(3): 199-209 (2003)
Conference and Workshop Papers
- 2022
- [c5]Keng Meng Ng, Frank Stephan, Yue Yang, Liang Yu:
On Trees Without Hyperimmune Branches. CiE 2022: 234-245 - 2017
- [c4]Liang Yu, Yizheng Zhu:
On the Reals Which Cannot Be Random. Computability and Complexity 2017: 611-622 - 2007
- [c3]Chi Tat Chong, Liang Yu:
Thin Maximal Antichains in the Turing Degrees. CiE 2007: 162-168 - 2006
- [c2]Frank Stephan, Liang Yu:
Lowness for Weakly 1-generic and Kurtz-Random. TAMC 2006: 756-764 - [c1]Yue Yang, Liang Yu:
On Differences Among Elementary Theories of Finite Levels of Ershov Hierarchies. TAMC 2006: 765-771
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-28 21:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
