s-Degrees within e-Degrees

DOI10.1007/978-3-540-79228-4_50zbMath1140.03316OpenAlexW1575938001MaRDI QIDQ3502680

Thomas F. Kent

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_50

Mathematics Subject Classification ID

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

Related Items (2)

Enumeration 1-genericity in the local enumeration degrees ⋮ Goodness in the enumeration and singleton degrees

Cites Work

• Unnamed Item
• Strong enumeration reducibilities
• e- and s-degrees
• Classical recursion theory. The theory of functions and sets of natural numbers
• On restricted forms of enumeration reducibility
• Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
• Semirecursive Sets and Positive Reducibility

This page was built for publication: s-Degrees within e-Degrees