Notre Dame Journal of Formal Logic
- Notre Dame J. Formal Logic
- Volume 50, Number 4 (2009), 469-493.
On the Degrees of Diagonal Sets and the Failure of the Analogue of a Theorem of Martin
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.
Notre Dame J. Formal Logic, Volume 50, Number 4 (2009), 469-493.
First available in Project Euclid: 11 February 2010
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Ng , Keng Meng. On the Degrees of Diagonal Sets and the Failure of the Analogue of a Theorem of Martin. Notre Dame J. Formal Logic 50 (2009), no. 4, 469--493. doi:10.1215/00294527-2009-022. https://projecteuclid.org/euclid.ndjfl/1265899126