On restricted forms of enumeration reducibility

DOI10.1016/0168-0072(90)90051-3zbMath0751.03021OpenAlexW2082068214MaRDI QIDQ1814011

Phil Watson

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1016/0168-0072(90)90051-3

zbMATH Keywords

\(e\)-reducibility\(e\)-degrees

Mathematics Subject Classification ID

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

Related Items (3)

Strong enumeration reducibilities ⋮ s-Degrees within e-Degrees ⋮ The structure of the s-degrees contained within a single e-degree

Cites Work

• Unnamed Item
• e- and s-degrees
• Note on Degrees of Partial Functions
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Jumps of quasi-minimal enumeration degrees
• Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
• Reducibility and Completeness for Sets of Integers
• On minimal pairs of enumeration degrees

This page was built for publication: On restricted forms of enumeration reducibility