Martin-löf randomness in spaces of closed sets

Journal of Symbolic Logic 80 (2):359-383 (2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/jsl.2014.76

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

Random closed sets viewed as random recursions.R. Daniel Mauldin & Alexander P. McLinden - 2009 - Archive for Mathematical Logic 48 (3-4):257-263.
Computably enumerable sets below random sets.André Nies - 2012 - Annals of Pure and Applied Logic 163 (11):1596-1610.
Approximate decidability in euclidean spaces.Armin Hemmerling - 2003 - Mathematical Logic Quarterly 49 (1):34-56.
Effectively closed sets of measures and randomness.Jan Reimann - 2008 - Annals of Pure and Applied Logic 156 (1):170-182.
Embeddings of countable closed sets and reverse mathematics.Jeffry L. Hirst - 1993 - Archive for Mathematical Logic 32 (6):443-449.
Metamathematics of comparability.Harvey Friedman - manuscript
Algorithmic randomness of continuous functions.George Barmpalias, Paul Brodhead, Douglas Cenzer, Jeffrey B. Remmel & Rebecca Weber - 2008 - Archive for Mathematical Logic 46 (7-8):533-546.
Descriptive set theory of families of small sets.Étienne Matheron & Miroslav Zelený - 2007 - Bulletin of Symbolic Logic 13 (4):482-537.
Reverse mathematics of separably closed sets.Jeffry L. Hirst - 2006 - Archive for Mathematical Logic 45 (1):1-2.
Covering analytic sets by families of closed sets.Sławomir Solecki - 1994 - Journal of Symbolic Logic 59 (3):1022-1031.
Lowness and $\Pi _{2}^{0}$ Nullsets.Rod Downey, Andre Nies, Rebecca Weber & Liang Yu - 2006 - Journal of Symbolic Logic 71 (3):1044 - 1052.
Lowness and Π₂⁰ nullsets.Rod Downey, Andre Nies, Rebecca Weber & Liang Yu - 2006 - Journal of Symbolic Logic 71 (3):1044-1052.
Jump inversions inside effectively closed sets and applications to randomness.George Barmpalias, Rod Downey & Keng Meng Ng - 2011 - Journal of Symbolic Logic 76 (2):491 - 518.
Singular coverings and non‐uniform notions of closed set computability.Stéphane Le Roux & Martin Ziegler - 2008 - Mathematical Logic Quarterly 54 (5):545-560.
How much randomness is needed for statistics?Bjørn Kjos-Hanssen, Antoine Taveneaux & Neil Thapen - 2012 - In S. Barry Cooper (ed.), Annals of Pure and Applied Logic. pp. 395--404.

Analytics

Added to PP
2016-06-30

Downloads
13 (#1,010,467)

6 months
8 (#342,364)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Martin–Löf random generalized Poisson processes.Logan Axon - 2018 - Annals of Pure and Applied Logic 169 (4):261-276.

Add more citations

References found in this work

Calibrating randomness.Rod Downey, Denis R. Hirschfeldt, André Nies & Sebastiaan A. Terwijn - 2006 - Bulletin of Symbolic Logic 12 (3):411-491.
Random closed sets viewed as random recursions.R. Daniel Mauldin & Alexander P. McLinden - 2009 - Archive for Mathematical Logic 48 (3-4):257-263.

Add more references