Almost everywhere domination

DOI10.2178/JSL/1096901775MaRDI QIDQ5311761zbMATH OpenOpenAlexFDO

Authors Natasha Dobrinen, Stephen G. Simpson

Publication date 29 August 2005

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

Full work available at URL https://doi.org/10.2178/jsl/1096901775

zbMATH Keywords

dominationmeasurereverse mathematicsTuring degrees

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Other Turing degree structures (03D28) Second- and higher-order arithmetic and fragments (03F35) Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Other connections with logic and set theory (28E15)

Recommendations

• Lowness notions, measure and domination
• Almost everywhere domination and superhighness
• Mass problems and almost everywhere domination
• Uniform almost everywhere domination
• Tracing and domination in the Turing degrees

Cites work

• A study of singular points and supports of measures in reverse mathematics
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• scientific article; zbMATH DE number 3577197 (Why is no real title available?)
• scientific article; zbMATH DE number 1226875 (Why is no real title available?)
• Lebesgue Convergence Theorems and Reverse Mathematics
• Measure theory and weak König's lemma
• Riesz representation theorem, Borel measures and subsystems of second- order arithmetic
• Vitali's theorem and WWKL

Cited in

(19)

• A reducibility related to being hyperimmune-free
• Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)
• Denjoy, Demuth and density
• Lowness notions, measure and domination
• A survey of Mučnik and Medvedev degrees
• Partial functions and domination
• Degree spectra and immunity properties
• Uniform almost everywhere domination
• Non-cupping, measure and computably enumerable splittings
• Mass problems and measure-theoretic regularity
• Strong jump-traceability. II: K-triviality
• Randomness notions and partial relativization
• On arithmetical level of the class of superhigh sets
• A Cappable Almost Everywhere Dominating Computably Enumerable Degree
• Diagonally non-computable functions and fireworks
• Mass problems and almost everywhere domination
• Low for random reals and positive-measure domination
• Tracing and domination in the Turing degrees
• Mass problems associated with effectively closed sets

This page was built for publication: Almost everywhere domination

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