The degrees below a 1-generic degree $
Journal of Symbolic Logic 51 (3):770 - 777 (1986)
| Abstract | It is shown that the nonrecursive predecessors of a 1-generic degree $ are all 1-generic. As a corollary, it is shown that the 1-generic degrees are not densely ordered | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesFrank Stephan (2001). On the Structures Inside Truth-Table Degrees. Journal of Symbolic Logic 66 (2):731-770.
Wolfgang Maass (1982). Recursively Enumerable Generic Sets. Journal of Symbolic Logic 47 (4):809-823.
Johanna N. Y. Franklin (2010). Subclasses of the Weakly Random Reals. Notre Dame Journal of Formal Logic 51 (4):417-426.
Guohua Wu (2004). Bi-Isolation in the D.C.E. Degrees. Journal of Symbolic Logic 69 (2):409 - 420.
David B. Posner & Robert W. Robinson (1981). Degrees Joining to 0'. Journal of Symbolic Logic 46 (4):714 - 722.
Barbara F. Csima, Rod Downey, Noam Greenberg, Denis R. Hirschfeldt & Joseph S. Miller (2006). Every 1-Generic Computes a Properly 1-Generic. Journal of Symbolic Logic 71 (4):1385 - 1393.
Masahiro Kumabe (1993). Every N-Generic Degree is a Minimal Cover of an N-Generic Degree. Journal of Symbolic Logic 58 (1):219-231.
Stephen A. Fenner (1994). Almost Weakly 2-Generic Sets. Journal of Symbolic Logic 59 (3):868-887.
Theodore A. Slaman & John R. Steel (1989). Complementation in the Turing Degrees. Journal of Symbolic Logic 54 (1):160-176.
Guohua Wu (2006). Jump Operator and Yates Degrees. Journal of Symbolic Logic 71 (1):252 - 264.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads2 ( #232,575 of 549,128 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
