
Abstract.A Turing degree a is said to be almost everywhere dominating if, for almost all X ∈ 2ω with respect to the “fair coin” probability measure on 2ω, and for all g: ω → ω Turing reducible to X, there exists f: ω → ω of Turing degree a which dominates g. We study the problem of characterizing the almost everywhere dominating Turing degrees and other, similarly defined classes of Turing degrees. We relate this problem to some questions in the reverse mathematics of measure theory.
Other connections with logic and set theory, Other Turing degree structures, Turing degrees, Classes of sets (Borel fields, \(\sigma\)-rings, etc.), measurable sets, Suslin sets, analytic sets, reverse mathematics, measure, Second- and higher-order arithmetic and fragments, Foundations of classical theories (including reverse mathematics), domination
Other connections with logic and set theory, Other Turing degree structures, Turing degrees, Classes of sets (Borel fields, \(\sigma\)-rings, etc.), measurable sets, Suslin sets, analytic sets, reverse mathematics, measure, Second- and higher-order arithmetic and fragments, Foundations of classical theories (including reverse mathematics), domination
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 20 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
