Journal of Symbolic Logic

Lowness for the Class of Random Sets

Antonin Kucera and Sebastiaan A. Terwijn

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

Abstract

A positive answer to a question of M. van Lambalgen and D. Zambella whether there exist nonrecursive sets that are low for the class of random sets is obtained. Here a set A is low for the class RAND of random sets if RAND = RAND$^A$.

Article information

Source
J. Symbolic Logic, Volume 64, Issue 4 (1999), 1396-1402.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183745926

Mathematical Reviews number (MathSciNet)
MR1780059

Zentralblatt MATH identifier
0954.68080

JSTOR
links.jstor.org

Citation

Kucera, Antonin; Terwijn, Sebastiaan A. Lowness for the Class of Random Sets. J. Symbolic Logic 64 (1999), no. 4, 1396--1402. https://projecteuclid.org/euclid.jsl/1183745926


Export citation