Archive for Mathematical Logic 32 (2):113-135 (1992)
| Abstract |
In this paper we investigate problems about densities ofe-generic,s-generic andp-generic degrees. We, in particular, show that allp-generic degrees are non-branching, which answers an open question by Jockusch who asked: whether alls-generic degrees are non-branching and refutes a conjecture of Ingrassia; the set of degrees containing r.e.p-generic sets is the same as the set of r.e. degrees containing an r.e. non-autoreducible set
|
| Keywords | No keywords specified (fix it) |
| Categories | (categorize this paper) |
| DOI | 10.1007/BF01269953 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
References found in this work BETA
Recursively Enumerable Generic Sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
The Density of the Nonbranching Degrees.Peter A. Fejer - 1983 - Annals of Pure and Applied Logic 24 (2):113-130.
Completely Mitotic R.E. Degrees.R. G. Downey & T. A. Slaman - 1989 - Annals of Pure and Applied Logic 41 (2):119-152.
The Density of Infima in the Recursively Enumerable Degrees.Theodore A. Slaman - 1991 - Annals of Pure and Applied Logic 52 (1-2):155-179.
View all 6 references / Add more references
Citations of this work BETA
No citations found.
Similar books and articles
Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees.Klaus Ambos-Spies & Ding Decheng - 1994 - Mathematical Logic Quarterly 40 (3):287-317.
Complementation in the Turing Degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
Recursively Enumerable Generic Sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
The Degrees Below a 1-Generic Degree $.Christine Ann Haught - 1986 - Journal of Symbolic Logic 51 (3):770 - 777.
The Isolated D. R. E. Degrees Are Dense in the R. E. Degrees.Geoffrey Laforte - 1996 - Mathematical Logic Quarterly 42 (1):83-103.
Bounding Non- GL ₂ and R.E.A.Klaus Ambos-Spies, Decheng Ding, Wei Wang & Liang Yu - 2009 - Journal of Symbolic Logic 74 (3):989-1000.
Relative Enumerability and 1-Genericity.Wei Wang - 2011 - Journal of Symbolic Logic 76 (3):897 - 913.
Grigorieff Forcing on Uncountable Cardinals Does Not Add a Generic of Minimal Degree.Brooke M. Andersen & Marcia J. Groszek - 2009 - Notre Dame Journal of Formal Logic 50 (2):195-200.
Every 1-Generic Computes a Properly 1-Generic.Barbara F. Csima, Rod Downey, Noam Greenberg, Denis R. Hirschfeldt & Joseph S. Miller - 2006 - Journal of Symbolic Logic 71 (4):1385 - 1393.
Domination, Forcing, Array Nonrecursiveness and Relative Recursive Enumerability.Mingzhong Cai & Richard A. Shore - 2012 - Journal of Symbolic Logic 77 (1):33-48.
The Discontinuity of Splitting in the Recursively Enumerable Degrees.S. Barry Cooper & Xiaoding Yi - 1995 - Archive for Mathematical Logic 34 (4):247-256.
Minimal Degrees Recursive in 1-Generic Degrees.C. T. Chong & R. G. Downey - 1990 - Annals of Pure and Applied Logic 48 (3):215-225.
1-Generic Degrees and Minimal Degrees in Higher Recursion Theory, II.C. T. Chong - 1986 - Annals of Pure and Applied Logic 31:165-175.
1-Generic Splittings of Computably Enumerable Degrees.Guohua Wu - 2006 - Annals of Pure and Applied Logic 138 (1):211-219.
Analytics
Added to PP index
2013-11-23
Total views
22 ( #471,648 of 2,411,664 )
Recent downloads (6 months)
1 ( #539,172 of 2,411,664 )
2013-11-23
Total views
22 ( #471,648 of 2,411,664 )
Recent downloads (6 months)
1 ( #539,172 of 2,411,664 )
How can I increase my downloads?
Downloads
