Total Degrees and Nonsplitting Properties of $\Sigma_2^0$ Enumeration Degrees
From MaRDI portal
Publication:3502679
DOI10.1007/978-3-540-79228-4_49zbMath1140.03021MaRDI QIDQ3502679
Marat M. Arslanov, Mariya Ivanova Soskova, Iskander Sh. Kalimullin, S. Barry Cooper
Publication date: 27 May 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79228-4_49
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A non-splitting theorem in the enumeration degrees
- Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees
- Properly Σ2 Enumeration Degrees
- Embedding the diamond in the Σ2 enumeration degrees
- A recursively enumerable degree which will not split over all lesser ones
- Some Special Pairs of Σ2 e-Degrees
- On minimal pairs of enumeration degrees
- Structural properties and Σ20 enumeration degrees