A Cappable Almost Everywhere Dominating Computably Enumerable Degree

DOI10.1016/J.ENTCS.2006.08.005MaRDI QIDQ4921434zbMATH OpenOpenAlexFDO

Authors George Barmpalias, Antonio Montalbán

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

almost everywhere dominationcomputably enumerable degreesminimal pairsTuring degrees

Mathematics Subject Classification ID

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

Cites work

• Almost everywhere domination
• Finding paths through narrow and wide trees
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
• Uniform almost everywhere domination

Cited in

(7)

• Cappable recursively enumerable degrees and Post's program
• Randomness, lowness and degrees
• Non-cupping, measure and computably enumerable splittings
• Strong jump-traceability
• Almost everywhere domination and superhighness
• On very high degrees
• \(\Pi_1^0 \) classes, LR degrees and Turing degrees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4921434)