Iterated trees and fragments of arithmetic. - Yue Yang 004 (Arch. Math. Log., 1995)

The Thickness Lemma from P- + I Sigma1 + not B Sigma2. - Yue Yang 004 (J. Symb. Log., 1995)

Sigma2 Induction and Infinite Injury Priority Arguments, Part II: Tame Sigma2 Coding and the Jump Operator. - Chi Tat Chong; Yue Yang 004 (Ann. Pure Appl. Log., 1997)

Sigma2 Induction and Infinite Injury Priority Argument, Part I: Maximal Sets and the Jump Operator. - Chi Tat Chong; Yue Yang 004 (J. Symb. Log., 1998)

The minimal e-degree problem in fragments of Peano arithmetic. - Marat M. Arslanov; Chi Tat Chong; S. Barry Cooper; Yue Yang 004 (Ann. Pure Appl. Log., 2005)

Bounding and nonbounding minimal pairs in the enumeration degrees. - S. Barry Cooper; Angsheng Li; Andrea Sorbi; Yue Yang 004 (J. Symb. Log., 2005)

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

Properly Sigma2 minimal degrees and 0'' complementation. - S. Barry Cooper; Andrew E. M. Lewis; Yue Yang 004 (Math. Log. Q., 2005)

On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal. - Angsheng Li; Guohua Wu; Yue Yang 004 (TAMC, 2006)

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

The existence of high nonbounding degrees in the difference hierarchy. - Chi Tat Chong; Angsheng Li; Yue Yang 004 (Ann. Pure Appl. Log., 2006)

Bounding computably enumerable degrees in the Ershov hierarchy. - Angsheng Li; Guohua Wu; Yue Yang 004 (Ann. Pure Appl. Log., 2006)

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

Computable categoricity and the Ershov hierarchy. - Bakhadyr Khoussainov; Frank Stephan 001; Yue Yang 004 (Ann. Pure Appl. Log., 2008)

High Minimal Pairs in the Enumeration Degrees. - Andrea Sorbi; Guohua Wu; Yue Yang 004 (TAMC, 2009)

Diamond embeddings into the enumeration degrees. - Andrea Sorbi; Guohua Wu; Yue Yang 004 (Math. Struct. Comput. Sci., 2010)

Selection by Recursively Enumerable Sets. - Wolfgang Merkle; Frank Stephan 001; Jason Teutsch; Wei Wang 150; Yue Yang 004 (TAMC, 2013)

Nonstandard Models in Recursion Theory and Reverse Mathematics. - C. T. Chong; Wei Li 050; Yue Yang 004 (Bull. Symb. Log., 2014)

The members of thin and minimal classes, their ranks and Turing degrees. - Rodney G. Downey; Guohua Wu; Yue Yang 004 (Ann. Pure Appl. Log., 2015)

Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees. - Weiguang Peng; NingNing Peng; Keng Meng Ng; Kazuyuki Tanaka; Yue Yang 004 (Inf. Process. Lett., 2017)

Degrees containing members of thin Π10 classes are dense and co-dense. - Rodney G. Downey; Guohua Wu; Yue Yang 004 (J. Math. Log., 2018)

Incomparability in local structures of s-degrees and Q-degrees. - Irakli O. Chitaia; Keng Meng Ng; Andrea Sorbi; Yue Yang 004 (Arch. Math. Log., 2020)

A recursion theoretic foundation of computation over real numbers. - Keng Meng Ng; Nazanin Roshandel Tavana; Yue Yang 004 (J. Log. Comput., 2021)

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

Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities. - Irakli O. Chitaia; Keng Meng Ng; Andrea Sorbi; Yue Yang 004 (J. Log. Comput., 2023)