Mass problems and measure-theoretic regularity

DOI10.2178/BSL/1255526079MaRDI QIDQ3655266zbMATH OpenOpenAlexFDO

Authors 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

ATRBorel hierarchyBorel setscone avoidanceDNRhyperarithmetical hierarchyLKLRMartin-Löfmeasure theoryMuchnik degreerandomnessreducibilityreverse mathematicsTuring degreeWKLWWKL

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Other degrees and reducibilities in computability and recursion theory (03D30) Algorithmic randomness and dimension (03D32) Hierarchies of computability and definability (03D55) 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) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Mass Problems and Randomness
• Lowness notions, measure and domination
• Measure-theoretic applications of higher Demuth's theorem
• On some classical problems of descriptive set theory
• Mass problems and almost everywhere domination

Cites work

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

Cited in

(10)

• On the uniform computational content of computability theory
• Mass problems and initial segment complexity
• Degrees of unsolvability: a tutorial
• Uniform almost everywhere domination
• Propagation of partial randomness
• Medvedev degrees of two-dimensional subshifts of finite type
• Theory and Applications of Models of Computation
• Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
• Mass problems associated with effectively closed sets
• Mass problems and intuitionism

This page was built for publication: Mass problems and measure-theoretic regularity

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