2000 character limit reached
Rank and randomness
Published 3 Jul 2017 in math.LO | (1707.00378v3)
Abstract: We show that for each computable ordinal $\alpha>0$ it is possible to find in each Martin-L\"of random $\Delta0_2$ degree a sequence $R$ of Cantor-Bendixson rank $\alpha$, while ensuring that the sequences that inductively witness $R$'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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.