Abstract
AbstractWe show that in the language of { ≤ }. the Π3-fragment of the first order theory of the -enumeration degrees is undecidable. We then extend this result to show that the Π3-theory of any substructure of the enumeration degrees which contains the -degrees is undecidable.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have