Rank and randomness

Journal of Symbolic Logic 84 (4):1527-1543 (2019)
  Copy   BIBTEX

Abstract

We show that for each computable ordinal $\alpha > 0$ it is possible to find in each Martin-Löf random ${\rm{\Delta }}_2^0 $ degree a sequence R of Cantor-Bendixson rank α, while ensuring that the sequences that inductively witness R’s rank are all Martin-Löf random with respect to a single countably supported and computable measure. This is a strengthening for random degrees of a recent result of Downey, Wu, and Yang, and can be understood as a randomized version of it.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 96,326

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

Analytics

Added to PP
2019-09-20

Downloads
9 (#1,476,144)

6 months
5 (#1,303,461)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Christopher Porter
Drake University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references