Yue Yang

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities	2023-08-03	Paper
A recursion theoretic foundation of computation over real numbers	2021-11-09	Paper
The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma	2021-08-02	Paper
Incomparability in local structures of \(s\)-degrees and \(Q\)-degrees	2020-10-15	Paper
Degrees containing members of thin Π10 classes are dense and co-dense	2018-06-13	Paper
Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees	2017-06-13	Paper
The inductive strength of Ramsey's theorem for pairs	2017-02-03	Paper
The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees	2015-05-15	Paper
NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS	2014-10-21	Paper
The metamathematics of Stable Ramsey’s Theorem for Pairs	2014-09-19	Paper
\(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs	2012-07-20	Paper
Diamond embeddings into the enumeration degrees	2010-12-01	Paper
https://portal.mardi4nfdi.de/entity/Q3567853	2010-06-17	Paper
On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics	2010-03-31	Paper
High Minimal Pairs in the Enumeration Degrees	2009-06-03	Paper
Computable categoricity and the Ershov hierarchy	2008-12-05	Paper
There exists a maximal 3-c.e. enumeration degree	2007-09-28	Paper
The jump of a Σ_n -cut	2007-09-27	Paper
Theory and Applications of Models of Computation	2007-04-30	Paper
Theory and Applications of Models of Computation	2007-04-30	Paper
Properly enumeration degrees and the high/low hierarchy	2007-01-19	Paper
On Σ₁-Structural Differences Among Finite Levels of the Ershov Hierarchy	2007-01-19	Paper
Bounding computably enumerable degrees in the Ershov hierarchy	2006-08-16	Paper
On the definable ideal generated by nonbounding c.e. degrees	2006-02-08	Paper
Bounding and nonbounding minimal pairs in the enumeration degrees	2006-01-16	Paper
The existence of high nonbounding degrees in the difference hierarchy	2005-12-29	Paper
https://portal.mardi4nfdi.de/entity/Q5711880	2005-12-08	Paper
Properly ?2 minimal degrees and 0? complementation	2005-06-01	Paper
The minimal e-degree problem in fragments of Peano arithmetic	2005-01-31	Paper
A join theorem for the computably enumerable degrees	2004-08-13	Paper
https://portal.mardi4nfdi.de/entity/Q4460841	2004-03-29	Paper
https://portal.mardi4nfdi.de/entity/Q2784778	2002-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q2776819	2002-05-15	Paper
\(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture	2001-07-31	Paper
https://portal.mardi4nfdi.de/entity/Q4513965	2001-06-04	Paper
https://portal.mardi4nfdi.de/entity/Q4944906	2001-02-05	Paper
https://portal.mardi4nfdi.de/entity/Q4946108	2000-12-17	Paper
Σ₂ Induction and infinite injury priority argument, Part I: Maximal sets and the jump operator	1999-02-02	Paper
\(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator	1998-01-26	Paper
Iterated trees and fragments of arithmetic	1995-11-28	Paper
The thickness lemma from P⁻ + IΣ₁ + ¬BΣ₂	1995-08-15	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Yue Yang