Notre Dame Journal of Formal Logic 50 (4):445-452 (2009)

Authors
Bjørn Kjos-Hanssen
University of Hawaii
Abstract
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
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 63,295
Through your library

References found in this work BETA

Almost Everywhere Domination and Superhighness.Stephen G. Simpson - 2007 - Mathematical Logic Quarterly 53 (4):462-482.
Mass Problems and Hyperarithmeticity.Joshua A. Cole & Stephen G. Simpson - 2007 - Journal of Mathematical Logic 7 (2):125-143.
Uniform Almost Everywhere Domination.Peter Cholak, Noam Greenberg & Joseph S. Miller - 2006 - Journal of Symbolic Logic 71 (3):1057 - 1072.

View all 10 references / Add more references

Citations of this work BETA

Superhighness.Bjørn Kjos-Hanssen & Andrée Nies - 2009 - Notre Dame Journal of Formal Logic 50 (4):445-452.

Add more citations

Similar books and articles

A Strong Law of Computationally Weak Subsets.Bjørn Kjos-Hanssen - 2011 - Journal of Mathematical Logic 11 (1):1-10.
Lattice Initial Segments of the Hyperdegrees.Richard A. Shore & Bjørn Kjos-Hanssen - 2010 - Journal of Symbolic Logic 75 (1):103-130.
Finding Paths Through Narrow and Wide Trees.Stephen Binns & Bjørn Kjos-Hanssen - 2009 - Journal of Symbolic Logic 74 (1):349-360.
Local Initial Segments of the Turing Degrees.Bjørn Kjos-Hanssen - 2003 - Bulletin of Symbolic Logic 9 (1):26-36.
Computability and Randomness.André Nies - 2008 - Oxford University Press.
Comparing DNR and WWKL.Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp & Theodore A. Slaman - 2004 - Journal of Symbolic Logic 69 (4):1089-1104.
A New Spectrum of Recursive Models.André Nies - 1999 - Notre Dame Journal of Formal Logic 40 (3):307-314.
Bookend.Andrée Aelion Brooks - 1989 - Business Ethics 3 (2):30-30.
Randomness and Computability: Open Questions.Joseph S. Miller & André Nies - 2006 - Bulletin of Symbolic Logic 12 (3):390-410.

Analytics

Added to PP index
2010-09-13

Total views
37 ( #291,201 of 2,448,730 )

Recent downloads (6 months)
1 ( #447,034 of 2,448,730 )

How can I increase my downloads?

Downloads

My notes