Lowness for the class of random sets

Journal of Symbolic Logic 64 (4):1396-1402 (1999)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2586785
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 24,411
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Antonín Kučera (1993). On Relative Randomness. Annals of Pure and Applied Logic 63 (1):61-67.

Add more references

Citations of this work BETA
Stephen G. Simpson (2005). Mass Problems and Randomness. Bulletin of Symbolic Logic 11 (1):1-27.
George Barmpalias (2012). Tracing and Domination in the Turing Degrees. Annals of Pure and Applied Logic 163 (5):500-505.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

5 ( #572,887 of 1,924,740 )

Recent downloads (6 months)

1 ( #417,923 of 1,924,740 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.