The structure of the s-degrees contained within a single e-degree

DOI10.1016/j.apal.2008.12.002zbMath1165.03021OpenAlexW2094957165MaRDI QIDQ1024548

Thomas F. Kent

Publication date: 17 June 2009

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2008.12.002

zbMATH Keywords

enumeration reducibilitys-reducibilitysingleton operator

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

Bounded enumeration reducibility and its degree structure

Cites Work

• Unnamed Item
• Unnamed Item
• Strong enumeration reducibilities
• e- and s-degrees
• Classical recursion theory. The theory of functions and sets of natural numbers
• The \(n\)-rea enumeration degrees are dense
• On restricted forms of enumeration reducibility
• Jumps of quasi-minimal enumeration degrees
• Enumeration Reducibility Using Bounded Information: Counting Minimal Covers