default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYue Yang 0004
Person information
- affiliation: National University of Singapore, Department of Mathematics, Singapore
Other persons with the same name
- Yue Yang — disambiguation page
- Yue Yang 0001 — Concordia University, Montreal, Canada
- Yue Yang 0002
![[0000-0001-9969-7431]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-9969-7431")
— Peking University, College of Engineering, Beijing, China - Yue Yang 0003 — Beihang University, Electronic Information Engineering, Beijing, China
- Yue Yang 0005 — Zhejiang University, Hangzhou, China
- Yue Yang 0006 — University of Pennsylvania, Philadelphia, PA, USA
- Yue Yang 0007 — Shanghai Jiao Tong University, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j20]Irakli O. Chitaia, Keng Meng Ng, Andrea Sorbi, Yue Yang:
Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities. J. Log. Comput. 33(5): 1060-1088 (2023)- 2022
- [c5]Keng Meng Ng, Frank Stephan, Yue Yang, Liang Yu:
On Trees Without Hyperimmune Branches. CiE 2022: 234-245 - 2021
- [j19]Keng Meng Ng, Nazanin Roshandel Tavana, Yue Yang:
A recursion theoretic foundation of computation over real numbers. J. Log. Comput. 31(7): 1660-1689 (2021) - 2020
- [j18]Irakli O. Chitaia, Keng Meng Ng, Andrea Sorbi, Yue Yang:
Incomparability in local structures of s-degrees and Q-degrees. Arch. Math. Log. 59(7-8): 777-791 (2020) - [i1]Keng Meng Ng, Nazanin Roshandel Tavana, Yue Yang:
A recursion theoretic foundation of computation over real numbers. CoRR abs/2010.00791 (2020)
2010 – 2019
- 2018
- [j17]Rodney G. Downey, Guohua Wu, Yue Yang:
Degrees containing members of thin Π10 classes are dense and co-dense. J. Math. Log. 18(1): 1850001:1-1850001:47 (2018) - 2017
- [j16]Weiguang Peng, NingNing Peng, Keng Meng Ng, Kazuyuki Tanaka, Yue Yang:
Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees. Inf. Process. Lett. 125: 41-45 (2017) - 2015
- [j15]Rodney G. Downey, Guohua Wu, Yue Yang:
The members of thin and minimal classes, their ranks and Turing degrees. Ann. Pure Appl. Log. 166(7-8): 755-766 (2015) - 2014
- [j14]C. T. Chong, Wei Li, Yue Yang:
Nonstandard Models in Recursion Theory and Reverse Mathematics. Bull. Symb. Log. 20(2): 170-200 (2014) - 2013
- [c4]Wolfgang Merkle, Frank Stephan, Jason Teutsch, Wei Wang, Yue Yang:
Selection by Recursively Enumerable Sets. TAMC 2013: 144-155 - 2010
- [j13]Andrea Sorbi, Guohua Wu, Yue Yang:
Diamond embeddings into the enumeration degrees. Math. Struct. Comput. Sci. 20(5): 799-811 (2010)
2000 – 2009
- 2009
- [c3]Andrea Sorbi, Guohua Wu, Yue Yang:
High Minimal Pairs in the Enumeration Degrees. TAMC 2009: 335-344 - 2008
- [j12]Bakhadyr Khoussainov, Frank Stephan, Yue Yang:
Computable categoricity and the Ershov hierarchy. Ann. Pure Appl. Log. 156(1): 86-95 (2008) - 2006
- [j11]Chi Tat Chong, Angsheng Li, Yue Yang:
The existence of high nonbounding degrees in the difference hierarchy. Ann. Pure Appl. Log. 138(1-3): 31-51 (2006) - [j10]Angsheng Li, Guohua Wu, Yue Yang:
Bounding computably enumerable degrees in the Ershov hierarchy. Ann. Pure Appl. Log. 141(1-2): 79-88 (2006) - [j9]Yue Yang, Liang Yu:
On Σ1-structural differences among finite levels of the Ershov hierarchy. J. Symb. Log. 71(4): 1223-1236 (2006) - [c2]Angsheng Li, Guohua Wu, Yue Yang:
On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal. TAMC 2006: 731-736 - [c1]Yue Yang, Liang Yu:
On Differences Among Elementary Theories of Finite Levels of Ershov Hierarchies. TAMC 2006: 765-771 - 2005
- [j8]Marat M. Arslanov, Chi Tat Chong, S. Barry Cooper, Yue Yang:
The minimal e-degree problem in fragments of Peano arithmetic. Ann. Pure Appl. Log. 131(1-3): 159-175 (2005) - [j7]Yue Yang, Liang Yu:
On the definable ideal generated by nonbounding c.e. degrees. J. Symb. Log. 70(1): 252-270 (2005) - [j6]S. Barry Cooper, Angsheng Li, Andrea Sorbi, Yue Yang:
Bounding and nonbounding minimal pairs in the enumeration degrees. J. Symb. Log. 70(3): 741-766 (2005) - [j5]S. Barry Cooper, Andrew E. M. Lewis, Yue Yang:
Properly Sigma2 minimal degrees and 0'' complementation. Math. Log. Q. 51(3): 274-276 (2005)
1990 – 1999
- 1998
- [j4]Chi Tat Chong, Yue Yang:
Sigma2 Induction and Infinite Injury Priority Argument, Part I: Maximal Sets and the Jump Operator. J. Symb. Log. 63(3): 797-814 (1998) - 1997
- [j3]Chi Tat Chong, Yue Yang:
Sigma2 Induction and Infinite Injury Priority Arguments, Part II: Tame Sigma2 Coding and the Jump Operator. Ann. Pure Appl. Log. 87(2): 103-116 (1997) - 1995
- [j2]Yue Yang:
Iterated trees and fragments of arithmetic. Arch. Math. Log. 34(2): 97-112 (1995) - [j1]Yue Yang:
The Thickness Lemma from P- + I Sigma1 + not B Sigma2. J. Symb. Log. 60(2): 505-511 (1995)
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-12-11 21:42 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:
