Abstract
We prove that every countable relation on the enumeration degrees, ${\frak E}$ , is uniformly definable from parameters in ${\frak E}$ . Consequently, the first order theory of ${\frak E}$ is recursively isomorphic to the second order theory of arithmetic. By an effective version of coding lemma, we show that the first order theory of the enumeration degrees of the $\Sigma^0_2$ sets is not decidable.
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.
