On the Degrees of Diagonal Sets and the Failure of the Analogue of a Theorem of Martin

Notre Dame Journal of Formal Logic 50 (4):469-493 (2009)
Abstract
Semi-hyperhypersimple c.e. sets, also known as diagonals, were introduced by Kummer. He showed that by considering an analogue of hyperhypersimplicity, one could characterize the sets which are the Halting problem relative to arbitrary computable numberings. One could also consider half of splittings of maximal or hyperhypersimple sets and get another variant of maximality and hyperhypersimplicity, which are closely related to the study of automorphisms of the c.e. sets. We investigate the Turing degrees of these classes of c.e. sets. In particular, we show that the analogue of a theorem of Martin fails for these classes
Keywords maximal   hyperhypersimple   computable numberings
Categories (categorize this paper)
DOI 10.1215/00294527-2009-022
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,300
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
Generalized Cohesiveness.Tamara Hummel & Carl G. Jockusch Jr - 1999 - Journal of Symbolic Logic 64 (2):489-516.
Wtt-Degrees and T-Degrees of R.E. Sets.Michael Stob - 1983 - Journal of Symbolic Logic 48 (4):921-930.
Covering Analytic Sets by Families of Closed Sets.Slawomir Solecki - 1994 - Journal of Symbolic Logic 59 (3):1022-1031.
Kleene Index Sets and Functional M-Degrees.Jeanleah Mohrherr - 1983 - Journal of Symbolic Logic 48 (3):829-840.
Van Lambalgen's Theorem and High Degrees.Johanna N. Y. Franklin & Frank Stephan - 2011 - Notre Dame Journal of Formal Logic 52 (2):173-185.
Solovay's Theorem Cannot Be Simplified.Andrew Arana - 2001 - Annals of Pure and Applied Logic 112 (1):27-41.
On Subcreative Sets and S-Reducibility.John T. Gill Iii & Paul H. Morris - 1974 - Journal of Symbolic Logic 39 (4):669 - 677.
On the Structures Inside Truth-Table Degrees.Frank Stephan - 2001 - Journal of Symbolic Logic 66 (2):731-770.
The Degrees of Conditional Problems.Su Gao - 1994 - Journal of Symbolic Logic 59 (1):166-181.
A Theorem on Hyperhypersimple Sets.Donald A. Martin - 1963 - Journal of Symbolic Logic 28 (4):273-278.
Turing Degrees and Many-One Degrees of Maximal Sets.Manuel Lerman - 1970 - Journal of Symbolic Logic 35 (1):29-40.
Added to PP index
2010-09-13

Total downloads
14 ( #341,954 of 2,193,232 )

Recent downloads (6 months)
1 ( #290,647 of 2,193,232 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature