Article contents
The Π3-theory of the -enumeration degrees is undecidable
Published online by Cambridge University Press: 12 March 2014
Abstract
We 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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2006
References
REFERENCES
- 5
- Cited by