Almost everywhere domination
From MaRDI portal
Publication:5311761
DOI10.2178/jsl/1096901775zbMath1075.03021OpenAlexW2132011439MaRDI QIDQ5311761
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
Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Other connections with logic and set theory (28E15) Other Turing degree structures (03D28)
Related Items (15)
A Survey of Mučnik and Medvedev Degrees ⋮ Low for random reals and positive-measure domination ⋮ Strong jump-traceability. II: \(K\)-triviality ⋮ Randomness notions and partial relativization ⋮ Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting) ⋮ On arithmetical level of the class of superhigh sets ⋮ Diagonally non-computable functions and fireworks ⋮ 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 ⋮ Degree spectra and immunity properties ⋮ Mass Problems and Measure-Theoretic Regularity ⋮ A reducibility related to being hyperimmune-free ⋮ Denjoy, Demuth and density
Cites Work
- Riesz representation theorem, Borel measures and subsystems of second- order arithmetic
- Vitali's theorem and WWKL
- A study of singular points and supports of measures in reverse mathematics
- Measure theory and weak König's lemma
- Lebesgue Convergence Theorems and Reverse Mathematics
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Unnamed Item
- Unnamed Item
This page was built for publication: Almost everywhere domination
