Abstract
It is proved that for any r.e. degreesv <u, there exists a properly d-r.e. degreec such thatc is a branching degree andv <c <u.
Similar content being viewed by others
References
Kaddah, D., Infima in the d-r.e. degrees,Annals of Pure and Applied Logic, 1993, 62(3); 207.
Slaman, T.A., The density of infima in the recursively enumerable degrees,Annals of Pure and Applied Logic, 1991, 52(2): 155.
Soare, R. I., Recursively enumerable sets and degrees, inPerspective in Mathematical Logic, Berlin: Springer-Verlag, 1987.
Sacks, G. E., The recursively enumerable degrees are dense,Annals of Math., 1964, 80(2): 300.
Cooper, S. B., Weak density and cupping in the d-r.e. degrees,Israel Journal of Mathematics, 1989, 67(2): 137.
Author information
Authors and Affiliations
Additional information
Project supported by the National Natural Science Foundation of China (Grant No. 19771045) and National 863 Hi-Tech R&D Programme.
Rights and permissions
About this article
Cite this article
Lu, H., Ding, D. The weak density of properly d-r.e. branching degree in the d-r.e. degrees. Sci. China Ser. A-Math. 42, 691–698 (1999). https://doi.org/10.1007/BF02878987
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02878987