Quasi-minimal enumeration degrees and minimal Turing degrees
From MaRDI portal
Publication:1568759
DOI10.1007/BF01759368zbMath0957.03049MaRDI QIDQ1568759
Theodore A. Slaman, Andrea Sorbi
Publication date: 20 August 2000
Published in: Annali di Matematica Pura ed Applicata. Serie Quarta (Search for Journal in Brave)
03D30: Other degrees and reducibilities in computability and recursion theory
03D28: Other Turing degree structures
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On degrees of recursive unsolvability
- On some filters and ideals of the Medvedev lattice
- The \(n\)-rea enumeration degrees are dense
- Classical recursion theory. Vol. II
- Solution to a Problem of Spector
- Properly Σ2 Enumeration Degrees
- Reducibility and Completeness for Sets of Integers
- Partial degrees and the density problem