Notre Dame Journal of Formal Logic 50 (4):445-452 (2009)
We prove that superhigh sets can be jump traceable, answering a question of Cole and Simpson. On the other hand, we show that such sets cannot be weakly 2-random. We also study the class $superhigh^\diamond$ and show that it contains some, but not all, of the noncomputable K-trivial sets
Keywords Turing degrees   highness and lowness notions   algorithmic randomness   truth-table degrees
Categories (categorize this paper)
DOI 10.1215/00294527-2009-020
 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,392
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

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
André Nies (1999). A New Spectrum of Recursive Models. Notre Dame Journal of Formal Logic 40 (3):307-314.
Andrée Aelion Brooks (1989). Bookend. Business Ethics 3 (2):30-30.

Monthly downloads

Added to index


Total downloads

4 ( #614,496 of 1,924,708 )

Recent downloads (6 months)

1 ( #417,761 of 1,924,708 )

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.