The elementary theory of the recursively enumerable degrees is not _ 0-categorical
DOI10.1016/0001-8708(84)90028-8zbMATH Open0559.03027OpenAlexW2091246156MaRDI QIDQ802550FDOQ802550
Robert I. Soare, Manuel Lerman, Richard A. Shore
Publication date: 1984
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0001-8708(84)90028-8
Categoricity and completeness of theories (03C35) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
Cited In (12)
- Undecidability and 1-types in intervals of the computably enumerable degrees
- Undecidability and 1-types in the recursively enumerable degrees
- The density of the nonbranching degrees
- Lattice embeddings into the recursively enumerable degrees. II
- Turing computability: structural theory
- Model-theoretic properties of Turing degrees in the Ershov difference hierarchy
- Degree Structures: Local and Global Investigations
- Every Δ20 degree is a strong degree of categoricity
- Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games
- Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees
- The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
- Annual Meeting of the Association for Symbolic Logic, Berkeley, 1990
This page was built for publication: The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802550)
