Abstract
We prove that there are two incomplete d.r.e. degrees (the Turing degrees of differences of two recursively enumerable sets) such that every non-zero recursively enumerable degree cups at least one of them to 0′, the greatest recursively enumerable (Turing) degree. 1991 Mathematics Subject Classification: primary 03D25, 03D30; secondary 03D35.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
