Extensions of two constructions of Ahmad
From MaRDI portal
Publication:5061391
DOI10.3233/COM-210380MaRDI QIDQ5061391
Steffen Lempp, Keng Meng Ng, Jun Le Goh, Mariya Ivanova Soskova
Publication date: 12 January 2023
Published in: Computability (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Definability in the enumeration degrees
- Fragments of the theory of the enumeration degrees
- On the degrees less than 0'
- ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS
- The Π3-theory of the -enumeration degrees is undecidable
- Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
- Interpretability and Definability in the Recursively Enumerable 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
- Interpreting true arithmetic in the local structure of the enumeration degrees