Strong enumeration reducibilities

DOI10.1007/S00153-006-0012-4zbMath1110.03028OpenAlexW2052087632MaRDI QIDQ850805

Andrea Sorbi, Roland Sh. Omanadze

Publication date: 6 November 2006

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-006-0012-4

zbMATH Keywords

\(s\)-reducibility\(e\)-reducibility

Mathematics Subject Classification ID

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

Related Items (10)

r‐Maximal sets and Q1,N‐reducibility ⋮ s-Degrees within e-Degrees ⋮ Incomparability in local structures of \(s\)-degrees and \(Q\)-degrees ⋮ \(sQ_1\)-degrees of computably enumerable sets ⋮ \(Q _{1}\)-degrees of c.e. sets ⋮ Bounded enumeration reducibility and its degree structure ⋮ On the bounded quasi‐degrees of c.e. sets ⋮ Goodness in the enumeration and singleton degrees ⋮ The structure of the s-degrees contained within a single e-degree ⋮ A characterization of the δ₂⁰ hyperhyperimmune sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• e- and s-degrees
• A class of hypersimple incomplete sets
• Classical recursion theory. The theory of functions and sets of natural numbers
• The \(n\)-rea enumeration degrees are dense
• Enumeration reducibilities
• Computably enumerable sets and quasi-reducibility
• Classical recursion theory. Vol. II
• Upper semilattice of recursively enumerable sQ-degrees
• On restricted forms of enumeration reducibility
• On the degrees less than 0'
• Noncappable enumeration degrees below 0_e^′
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Jumps of quasi-minimal enumeration degrees
• Cupping and noncapping in the r.e. weak truth table and turing degrees
• Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
• Reducibility and Completeness for Sets of Integers
• Embedding the diamond in the Σ₂ enumeration degrees
• On subcreative sets and S-reducibility
• Computational complexity, speedable and levelable sets
• On minimal pairs of enumeration degrees
• Partial degrees and the density problem
• Semirecursive Sets and Positive Reducibility
• Enumeration reducibility and partial degrees
• Bounding and nonbounding minimal pairs in the enumeration degrees

This page was built for publication: Strong enumeration reducibilities