Undecidability and 1-types in intervals of the computably enumerable degrees
From MaRDI portal
Publication:1591201
DOI10.1016/S0168-0072(99)00011-1zbMath0971.03040MaRDI QIDQ1591201
Ambos-Spies, Klaus, Richard A. Shore, Denis R. Hirschfeldt
Publication date: 23 October 2001
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
03D35: Undecidability and degrees of sets of sentences
03D25: Recursively (computably) enumerable sets and degrees
Cites Work
- Unnamed Item
- Unnamed Item
- Undecidability and 1-types in the recursively enumerable degrees
- The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
- The density of infima in the recursively enumerable degrees
- The density of the nonbranching degrees
- The recursively enumerable degrees have infinitely many one-types
- The recursively enumerable degrees are dense
- On degrees of unsolvability
- The undecidability of the recursively enumerable degrees
- Interpretability and Definability in the Recursively Enumerable Degrees
- The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
- Lower Bounds for Pairs of Recursively Enumerable Degrees