Quasi-minimal enumeration degrees and minimal Turing degrees

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)

zbMATH Keywords

enumeration degreee-degreeTuring degrees

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28)

Related Items (1)

Enumeration Reducibility and Computable Structure Theory

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Quasi-minimal enumeration degrees and minimal Turing degrees