Mass Problems and Measure-Theoretic Regularity

DOI10.2178/bsl/1255526079zbMath1191.03007OpenAlexW2010890742MaRDI QIDQ3655266

Stephen G. Simpson

Publication date: 7 January 2010

Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/bsl/1255526079

zbMATH Keywords

ATRreducibilityBorel setsreverse mathematicsmeasure theoryBorel hierarchyrandomnessWKLTuring degreeDNRWWKLhyperarithmetical hierarchyMartin-LöfLRcone avoidanceLKMuchnik degree

Mathematics Subject Classification ID

Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Other degrees and reducibilities in computability and recursion theory (03D30) Other connections with logic and set theory (28E15) Algorithmic randomness and dimension (03D32) Hierarchies of computability and definability (03D55)

Related Items

MASS PROBLEMS AND INITIAL SEGMENT COMPLEXITY, Degrees of Unsolvability: A Tutorial, Propagation of partial randomness, On the uniform computational content of computability theory, Medvedev degrees of two-dimensional subshifts of finite type, Algorithmic randomness, reverse mathematics, and the dominated convergence theorem, Mass problems associated with effectively closed sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embeddings into the Medvedev and Muchnik lattices of \(\Pi^0_1\) classes
• Mass problems and intuitionism
• Riesz representation theorem, Borel measures and subsystems of second- order arithmetic
• Classical recursion theory. Vol. II
• Vitali's theorem and WWKL
• Zur Deutung der intuitionistischen Logik
• Computable structures and the hyperarithmetical hierarchy
• A study of singular points and supports of measures in reverse mathematics
• Lowness properties and randomness
• Measure theory and weak König's lemma
• The upper semi-lattice of degrees of recursive unsolvability
• Algorithmic Randomness and Complexity
• Uniform almost everywhere domination
• Lebesgue Convergence Theorems and Reverse Mathematics
• A splitting theorem for the Medvedev and Muchnik lattices
• An extension of the recursively enumerable Turing degrees
• Almost everywhere domination and superhighness
• Mass problems and almost everywhere domination
• Low for random reals and positive-measure domination
• Almost everywhere domination
• On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
• The definition of random sequences
• Recursively enumerable sets of positive integers and their decision problems