Yue Yang

According to our database, Yue Yang authored at least 25 papers between 1995 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities.

Irakli O. Chitaia, Keng Meng Ng, Andrea Sorbi, Yue Yang

J. Log. Comput., July, 2023

2022

On Trees Without Hyperimmune Branches.

Keng Meng Ng, Frank Stephan, Yue Yang, Liang Yu

Proceedings of the Revolutions and Revelations in Computability, 2022

2021

A recursion theoretic foundation of computation over real numbers.

Keng Meng Ng, Nazanin Roshandel Tavana, Yue Yang

J. Log. Comput., 2021

2020

Incomparability in local structures of s-degrees and Q-degrees.

Irakli O. Chitaia, Keng Meng Ng, Andrea Sorbi, Yue Yang

Arch. Math. Log., 2020

2018

Degrees containing members of thin Π10 classes are dense and co-dense.

Rodney G. Downey, Guohua Wu, Yue Yang

J. Math. Log., 2018

2017

Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees.

Weiguang Peng, NingNing Peng, Keng Meng Ng, Kazuyuki Tanaka, Yue Yang

Inf. Process. Lett., 2017

2015

The members of thin and minimal classes, their ranks and Turing degrees.

Rodney G. Downey, Guohua Wu, Yue Yang

Ann. Pure Appl. Log., 2015

2014

Nonstandard Models in Recursion Theory and Reverse Mathematics.

C. T. Chong, Wei Li, Yue Yang

Bull. Symb. Log., 2014

2013

Selection by Recursively Enumerable Sets.

Wolfgang Merkle, Frank Stephan, Jason Teutsch, Wei Wang, Yue Yang

Proceedings of the Theory and Applications of Models of Computation, 2013

2010

Diamond embeddings into the enumeration degrees.

Andrea Sorbi, Guohua Wu, Yue Yang

Math. Struct. Comput. Sci., 2010

2009

High Minimal Pairs in the Enumeration Degrees.

Andrea Sorbi, Guohua Wu, Yue Yang

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

2008

Computable categoricity and the Ershov hierarchy.

Bakhadyr Khoussainov, Frank Stephan, Yue Yang

Ann. Pure Appl. Log., 2008

2006

On Σ₁-structural differences among finite levels of the Ershov hierarchy.

Yue Yang, Liang Yu

J. Symb. Log., 2006

Bounding computably enumerable degrees in the Ershov hierarchy.

Angsheng Li, Guohua Wu, Yue Yang

Ann. Pure Appl. Log., 2006

The existence of high nonbounding degrees in the difference hierarchy.

Chi Tat Chong, Angsheng Li, Yue Yang

Ann. Pure Appl. Log., 2006

On Differences Among Elementary Theories of Finite Levels of Ershov Hierarchies.

Yue Yang, Liang Yu

Proceedings of the Theory and Applications of Models of Computation, 2006

On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal.

Angsheng Li, Guohua Wu, Yue Yang

Proceedings of the Theory and Applications of Models of Computation, 2006

2005

Properly Sigma₂ minimal degrees and 0'' complementation.

S. Barry Cooper, Andrew E. M. Lewis, Yue Yang

Math. Log. Q., 2005

On the definable ideal generated by nonbounding c.e. degrees.

Yue Yang, Liang Yu

J. Symb. Log., 2005

Bounding and nonbounding minimal pairs in the enumeration degrees.

S. Barry Cooper, Angsheng Li, Andrea Sorbi, Yue Yang

J. Symb. Log., 2005

The minimal e-degree problem in fragments of Peano arithmetic.

Marat M. Arslanov, Chi Tat Chong, S. Barry Cooper, Yue Yang

Ann. Pure Appl. Log., 2005

1998

Sigma₂ Induction and Infinite Injury Priority Argument, Part I: Maximal Sets and the Jump Operator.

Chi Tat Chong, Yue Yang

J. Symb. Log., 1998

1997

Sigma₂ Induction and Infinite Injury Priority Arguments, Part II: Tame Sigma₂ Coding and the Jump Operator.

Chi Tat Chong, Yue Yang

Ann. Pure Appl. Log., 1997

1995

The Thickness Lemma from P^- + I Sigma₁ + not B Sigma₂.

Yue Yang

J. Symb. Log., 1995

Iterated trees and fragments of arithmetic.

Yue Yang

Arch. Math. Log., 1995