Mass Problems and Measure-Theoretic Regularity

DOI10.2178/bsl/1255526079zbMath1191.03007MaRDI 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

ATR; reducibility; Borel sets; reverse mathematics; measure theory; Borel hierarchy; randomness; WKL; Turing degree; DNR; WWKL; hyperarithmetical hierarchy; Martin-Löf; LR; cone avoidance; LK; Muchnik degree

Mathematics Subject Classification ID

28A05: Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets

68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)

03B30: Foundations of classical theories (including reverse mathematics)

03F35: Second- and higher-order arithmetic and fragments

03D30: Other degrees and reducibilities in computability and recursion theory

28E15: Other connections with logic and set theory

03D32: Algorithmic randomness and dimension

03D55: Hierarchies of computability and definability

Related Items

Medvedev degrees of two-dimensional subshifts of finite type, Propagation of partial randomness, 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