An Application of 1-Genericity in the $\Pi^0_2$ Enumeration Degrees
暂无分享,去创建一个
[1] Evan J. Griffiths. Limit lemmas and jump inversion in the enumeration degrees , 2003, Arch. Math. Log..
[2] Yue Yang,et al. Bounding and nonbounding minimal pairs in the enumeration degrees , 2005, Journal of Symbolic Logic.
[3] Kevin McEvoy,et al. On minimal pairs of enumeration degrees , 1985, Journal of Symbolic Logic.
[4] Joseph R. Shoenfield,et al. Mathematical logic , 1967 .
[5] C. Jockusch. Semirecursive sets and positive reducibility , 1968 .
[6] Alistair H. Lachlan,et al. Then-rea enumeration degrees are dense , 1992, Arch. Math. Log..
[7] Andrea Sorbi,et al. Cupping and Noncupping in the Enumeration Degrees of Sigma20 Sets , 1996, Ann. Pure Appl. Log..
[8] Charles M. Harris. Goodness in the enumeration and singleton degrees , 2010, Arch. Math. Log..
[9] H. Rogers,et al. Reducibility and Completeness for Sets of Integers , 1959 .
[10] Charles M. Harris. Non-cuppable enumeration degrees via finite injury , 2012, J. Log. Comput..
[11] Mariya Ivanova Soskova. Genericity and Non-bounding in the Enumeration degrees , 2007, J. Log. Comput..