Bounding and nonbounding minimal pairs in the enumeration degrees

DOI10.2178/jsl/1122038912zbMath1093.03029OpenAlexW2084820224MaRDI QIDQ5718686

Yue Yang, Andrea Sorbi, S. Barry Cooper, Ang Sheng Li

Publication date: 16 January 2006

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1122038912

zbMATH Keywords

minimal paire-degrees-degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (4)

Strong enumeration reducibilities ⋮ IN MEMORIAM: BARRY COOPER 1943–2015 ⋮ How enumeration reductibility yields extended Harrington non-splitting ⋮ Cupping and definability in the local structure of the enumeration degrees

Cites Work

• 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: Bounding and nonbounding minimal pairs in the enumeration degrees