Rank and randomness
Logic
2020-02-19 v3
Abstract
We show that for each computable ordinal it is possible to find in each Martin-L\"of random degree a sequence of Cantor-Bendixson rank , while ensuring that the sequences that inductively witness 's rank are all Martin-L\"of 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.
Keywords
Cite
@article{arxiv.1707.00378,
title = {Rank and randomness},
author = {Rupert Hölzl and Christopher P. Porter},
journal= {arXiv preprint arXiv:1707.00378},
year = {2020}
}