The Π3-theory of the -enumeration degrees is undecidable
From MaRDI portal
Publication:3416114
DOI10.2178/jsl/1164060455zbMath1109.03036MaRDI QIDQ3416114
Publication date: 19 January 2007
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1164060455
03D35: Undecidability and degrees of sets of sentences
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Cites Work
- The \(n\)-rea enumeration degrees are dense
- Definability in the enumeration degrees
- Undecidable fragments of elementary theories
- On the degrees less than 0'
- ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS
- Embedding the diamond in the Σ2 enumeration degrees
- The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
- Some Special Pairs of Σ2 e-Degrees
- Embedding finite lattices into the Σ20 enumeration degrees
- Enumeration reducibility and partial degrees