Uniform almost everywhere domination

DOI10.2178/JSL/1154698592MaRDI QIDQ3410690zbMATH OpenOpenAlexFDO

Authors Peter A. Cholak, Noam Greenberg, Joseph S. Miller

Publication date 29 November 2006

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

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

zbMATH Keywords

reverse mathematicsdominating functionsregularity of Lebesgue measurefunction of incomplete computably enumerable degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Second- and higher-order arithmetic and fragments (03F35) Other connections with logic and set theory (28E15)

Abstract: We explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a function of incomplete degree that dominates almost all degrees. This answers a question of Dobrinen and Simpson, who showed that such functions are related to the proof-theoretic strength of the regularity of Lebesgue measure for $G_{d}elta$ sets. Our constructions essentially settle the reverse mathematical classification of this principle. Revised Nov 13, 2005. Minor corrections made.

Recommendations

• Almost everywhere domination
• Lowness notions, measure and domination
• Mass problems and measure-theoretic regularity
• Non-cupping, measure and computably enumerable splittings
• Almost everywhere domination and superhighness

Cites work

• scientific article; zbMATH DE number 1226875 (Why is no real title available?)
• Class groups of integral group rings
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Degrees joining to 0′
• Degrees of members of \(\Pi_ 1^ 0\) classes
• Lowness properties and randomness
• Measure theory and weak König's lemma
• Three theorems on the degrees of recursively enumerable sets

Cited in

(14)

• Mass problems associated with effectively closed sets
• MASS PROBLEMS AND HYPERARITHMETICITY
• Effectively approximating measurable sets by open sets
• Mass problems and measure-theoretic regularity
• Randomness notions and reverse mathematics
• DOMINATION AND REGULARITY
• Tracing and domination in the Turing degrees
• Non-cupping, measure and computably enumerable splittings
• A Cappable Almost Everywhere Dominating Computably Enumerable Degree
• Lowness notions, measure and domination
• Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
• Almost everywhere domination and superhighness
• Almost everywhere domination
• Low for random reals and positive-measure domination

This page was built for publication: Uniform almost everywhere domination

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