Abstract
It is proven that there is a family of sets of natural numbers which has enumerations in every Turing degree except for the recursive degree. This implies that there is a countable structure which has representations in all but the recursive degree. Moreover, it is shown that there is such a structure which has a recursively represented elementary extension.
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.
