The following pages link to Yue Yang (Q189918):
Displaying 44 items.
- \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs (Q436224) (← links)
- The inductive strength of Ramsey's theorem for pairs (Q507201) (← links)
- (Q705536) (redirect page) (← links)
- The minimal e-degree problem in fragments of Peano arithmetic (Q705537) (← links)
- Computable categoricity and the Ershov hierarchy (Q958489) (← links)
- \(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator (Q1368581) (← links)
- Iterated trees and fragments of arithmetic (Q1892096) (← links)
- Incomparability in local structures of \(s\)-degrees and \(Q\)-degrees (Q2204365) (← links)
- The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees (Q2344718) (← links)
- There exists a maximal 3-c.e. enumeration degree (Q2382237) (← links)
- Bounding computably enumerable degrees in the Ershov hierarchy (Q2498901) (← links)
- The existence of high nonbounding degrees in the difference hierarchy (Q2576939) (← links)
- Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees (Q2628287) (← links)
- A nonlow2 R. E. Degree with the Extension of Embeddings Properties of a low2 Degree (Q2776819) (← links)
- (Q2784778) (← links)
- NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS (Q2925331) (← links)
- Diamond embeddings into the enumeration degrees (Q3060191) (← links)
- The metamathematics of Stable Ramsey’s Theorem for Pairs (Q3190948) (← links)
- On the definable ideal generated by nonbounding c.e. degrees (Q3370764) (← links)
- Properly enumeration degrees and the high/low hierarchy (Q3416107) (← links)
- On Σ<sub>1</sub>-Structural Differences Among Finite Levels of the Ershov Hierarchy (Q3416112) (← links)
- On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics (Q3550582) (← links)
- (Q3567853) (← links)
- High Minimal Pairs in the Enumeration Degrees (Q3630219) (← links)
- Σ<sub>2</sub> Induction and infinite injury priority argument, Part I: Maximal sets and the jump operator (Q4227867) (← links)
- (Q4460841) (← links)
- (Q4513965) (← links)
- Degrees containing members of thin Π10 classes are dense and co-dense (Q4565754) (← links)
- Properly ?2 minimal degrees and 0? complementation (Q4680373) (← links)
- A join theorem for the computably enumerable degrees (Q4813778) (← links)
- The thickness lemma from <i>P</i><sup>−</sup> + <i>I</i>Σ<sub>1</sub> + ¬<i>B</i>Σ<sub>2</sub> (Q4842627) (← links)
- (Q4944906) (← links)
- (Q4946108) (← links)
- The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma (Q5004544) (← links)
- A recursion theoretic foundation of computation over real numbers (Q5163985) (← links)
- The jump of a Σ<sub> <i>n</i> </sub> -cut (Q5308178) (← links)
- (Q5711880) (← links)
- Bounding and nonbounding minimal pairs in the enumeration degrees (Q5718686) (← links)
- Theory and Applications of Models of Computation (Q5898925) (← links)
- Theory and Applications of Models of Computation (Q5898929) (← links)
- \(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture (Q5937666) (← links)
- Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities (Q6166690) (← links)
- On the Nonexistence of a Strong Minimal Pair (Q6417906) (← links)
- Isola and mushroom dynamics of limit cycles and bifurcations in a predator-prey system with additive Allee effect (Q6457939) (← links)