Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T00:51:08.202Z Has data issue: false hasContentIssue false

RANK AND RANDOMNESS

Published online by Cambridge University Press:  19 September 2019

RUPERT HÖLZL
Affiliation:
INSTITUT 1, FAKULTÄT FÜR INFORMATIK UNIVERSITÄT DER BUNDESWEHR MÜNCHEN WERNER-HEISENBERG-WEG 39, 85579, NEUBIBERG, GERMANY E-mail: r@hoelzl.frURL: http://hoelzl.fr
CHRISTOPHER P. PORTER
Affiliation:
DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE DRAKE UNIVERSITY DES MOINES, IA50311, USA E-mail: cp@cpporter.comURL: http://cpporter.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2019