On a conjecture of Dobrinen and Simpson concerning almost everywhere domination

DOI10.2178/jsl/1140641165zbMath1103.03014arXiv1408.2282OpenAlexW3099570167WikidataQ123345563 ScholiaQ123345563MaRDI QIDQ5477626

Stephen Binns, Bjørn Kjos-Hanssen, D. Reed Solomon, Manuel Lerman

Publication date: 5 July 2006

Full work available at URL: https://arxiv.org/abs/1408.2282

zbMATH Keywords

randomgenericitycomputablea.e. dominatingsuper highu.a.e. dominating

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Other Turing degree structures (03D28)

Related Items

Low for random reals and positive-measure domination, MASS PROBLEMS AND HYPERARITHMETICITY, Generics for computable Mathias forcing, Genericity for Mathias forcing over general Turing ideals, Canonical immunity and genericity, A Cappable Almost Everywhere Dominating Computably Enumerable Degree, Non-cupping, measure and computably enumerable splittings, Tracing and domination in the Turing degrees, Mass problems associated with effectively closed sets, Mass Problems and Measure-Theoretic Regularity

Cites Work

• Unnamed Item
• Unnamed Item
• Degrees of members of \(\Pi_ 1^ 0\) classes
• Lowness properties and randomness
• On the strength of Ramsey's theorem for pairs
• Decidability of the “almost all” theory of degrees
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• The definition of random sequences
• Randomness, relativization and Turing degrees