Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T07:47:04.266Z Has data issue: false hasContentIssue false

ω-CHANGE RANDOMNESS AND WEAK DEMUTH RANDOMNESS

Published online by Cambridge University Press:  18 August 2014

JOHANNA N. Y. FRANKLIN
Affiliation:
DEPARTMENT OF MATHEMATICS 196 AUDITORIUM ROAD UNIVERSITY OF CONNECTICUT, U-3009 STORRS, CT 06269-3009, USAE-mail: johanna.franklin@uconn.edu
KENG MENG NG
Affiliation:
SCHOOL OF PHYSICAL & MATHEMATICAL SCIENCES NANYANG TECHNOLOGICAL UNIVERSITY 21 NANYANG LINK SINGAPOREE-mail: kmng@ntu.edu.sg
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 extend our work on difference randomness. Each component of a difference test is a Boolean combination of two r.e. open sets; here we consider tests in which the kth component is a Boolean combination of g(k) r.e. open sets for a given recursive function g. We use this method to produce an alternate characterization of weak Demuth randomness in terms of these tests and further show that a real is weakly Demuth random if and only if it is Martin-Löf random and cannot compute a strongly prompt r.e. set. We conclude with a study of related lowness notions and obtain as a corollary that lowness for balanced randomness is equivalent to being recursive.

Information

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2014