Mass problems and measure-theoretic regularity

Bulletin of Symbolic Logic 15 (4):385-409 (2009)
  Copy   BIBTEX

Abstract

A well known fact is that every Lebesgue measurable set is regular, i.e., it includes an F$_{\sigma}$ set of the same measure. We analyze this fact from a metamathematical or foundational standpoint. We study a family of Muchnik degrees corresponding to measure-theoretic regularity at all levels of the effective Borel hierarchy. We prove some new results concerning Nies's notion of LR-reducibility. We build some $\omega$-models of RCA$_0$which are relevant for the reverse mathematics of measure-theoretic regularity

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Uniform Almost Everywhere Domination.Peter Cholak, Noam Greenberg & Joseph S. Miller - 2006 - Journal of Symbolic Logic 71 (3):1057 - 1072.
Mass problems and randomness.Stephen G. Simpson - 2005 - Bulletin of Symbolic Logic 11 (1):1-27.
Regularity theories reassessed.Michael Baumgartner - 2006 - Philosophia 36 (3):327-354.
Gunk, Topology and Measure.Frank Arntzenius - 2004 - In Dean Zimmerman (ed.), Oxford Studies in Metaphysics: Volume 4. Oxford University Press.
Set theoretic properties of Loeb measure.Arnold W. Miller - 1990 - Journal of Symbolic Logic 55 (3):1022-1036.
Seeing causing.Helen Beebee - 2003 - Proceedings of the Aristotelian Society 103 (3):257-280.
Decision-theoretic epistemology.Ruth Weintraub - 1990 - Synthese 83 (1):159 - 177.
Are deterministic descriptions and indeterministic descriptions observationally equivalent?Charlotte Werndl - 2009 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 40 (3):232-242.

Analytics

Added to PP
2010-09-13

Downloads
35 (#448,033)

6 months
9 (#294,961)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Cone avoidance and randomness preservation.Stephen G. Simpson & Frank Stephan - 2015 - Annals of Pure and Applied Logic 166 (6):713-728.
Annals of Pure and Applied Logic. [REVIEW]Itay Neeman - 2003 - Bulletin of Symbolic Logic 9 (3):414-416.

Add more citations

References found in this work

On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Classical Recursion Theory.Peter G. Hinman - 2001 - Bulletin of Symbolic Logic 7 (1):71-73.
Mass problems and randomness.Stephen G. Simpson - 2005 - Bulletin of Symbolic Logic 11 (1):1-27.
Measure theory and weak König's lemma.Xiaokang Yu & Stephen G. Simpson - 1990 - Archive for Mathematical Logic 30 (3):171-180.

View all 22 references / Add more references