A Cappable Almost Everywhere Dominating Computably Enumerable Degree

DOI10.1016/j.entcs.2006.08.005zbMath1262.03062OpenAlexW2008969089MaRDI QIDQ4921434

Antonio Montalbán, George Barmpalias

Publication date: 10 May 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.08.005

zbMATH Keywords

minimal pairscomputably enumerable degreesTuring degreesalmost everywhere domination

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (5)

STRONG JUMP-TRACEABILITY ⋮ Randomness, lowness and degrees ⋮ On very high degrees ⋮ \(\Pi_1^0 \) classes, LR degrees and Turing degrees ⋮ Non-cupping, measure and computably enumerable splittings

Cites Work

• Unnamed Item
• Uniform almost everywhere domination
• Finding paths through narrow and wide trees
• Almost everywhere domination
• On a conjecture of Dobrinen and Simpson concerning almost everywhere domination

This page was built for publication: A Cappable Almost Everywhere Dominating Computably Enumerable Degree