1. ScholarBank@NUS

Yue Yang

rp04466

Collaboration Map View Statistics Email Alert RSS Feed

Profile

Full Name
Yue Yang
Variants
Yang, Yue
Yang, Y.
Yue, Y.
 
Main Affiliation
 
Faculty
 
Email
matyangy@nus.edu.sg
 

Publications

Refined By:
Date Issued:  [2000 TO 2009]

Results 1-15 of 15 (Search time: 0.004 seconds).

Issue DateTitleAuthor(s)
12001∑2 induction and infinite injury priority arguments, part III: Prompt sets, minimal pairs and shoenfield's conjectureChong, C.T. ; Qian, L.; Slaman, T.A.; Yang, Y. 
2Jul-2004A join theorem for the computably enumerable degreesJockusch Jr., C.G.; Li, A.; Yang, Y. 
3Sep-2005Bounding and nonbounding minimal pairs in the enumeration degreesCooper, S.B.; Li, A.; Sorbi, A.; Yang, Y. 
4Aug-2006Bounding computably enumerable degrees in the Ershov hierarchyLi, A.; Wu, G.; Yang, Y. 
5Nov-2008Computable categoricity and the Ershov hierarchyKhoussainov, B.; Stephan, F. ; Yang, Y. 
62009High minimal pairs in the enumeration degreesSorbi, A.; Wu, G.; Yang, Y. 
72006On differences among elementary theories of finite levels of Ershov hierarchiesYang, Y. ; Yu, L. 
8Mar-2005On the definable ideal generated by nonbounding c.e. degreesYu, L.; Yang, Y. 
9Dec-2006On Σ1-structural differences among finite levels of the Ershov hierarchyYang, Y. ; Yu, L.
102005Properly Σ 2 minimal degrees and 0″ complementationCooper, S.B.; Lewis, A.E.M.; Yang, Y. 
11Dec-2006Properly Σ2 0 enumeration degrees and the high/low hierarchyGiorgi, M.; Sorbi, A.; Yang, Y. 
12Mar-2006The existence of high nonbounding degrees in the difference hierarchyChong, C.T. ; Li, A.; Yang, Y. 
13Jun-2007The jump of a Σn-cutChong, C.T. ; Yang, Y. 
14Jan-2005The minimal e-degree problem in fragments of Peano arithmeticArslanov, M.M.; Chong, C.T. ; Cooper, S.B.; Yang, Y. 
15Dec-2003There exists a maximal 3-C.E. enumeration degreeCooper, S.B.; Li, A.; Sorbi, A.; Yang, Y.