On the Degrees of Diagonal Sets and the Failure of the Analogue of a Theorem of Martin
Keng Meng Ng
Source: Notre Dame J. Formal Logic Volume 50, Number 4
(2009), 469-493.
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.
First Page:
Show
Hide
Full-text: Access denied (no subscription
detected)
We're sorry, but we are unable to provide
you with the full text of this article because we are not able to identify
you as a subscriber.
If you have a personal subscription to
this journal, then please login. If you are already logged in, then you
may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.ndjfl/1265899126
Digital Object Identifier: doi:10.1215/00294527-2009-022
Mathematical Reviews number (MathSciNet): MR2598875
Zentralblatt MATH identifier: 05778812
References
[1] Ambos-Spies, K., "Contiguous r.e. degrees", pp. 1--37 in Computation and Proof Theory (Aachen, 1983), vol. 1104 of Lecture Notes in Mathematics, Springer, Berlin, 1984.
Mathematical Reviews (MathSciNet): MR775707
Zentralblatt MATH: 0562.03022
Digital Object Identifier: doi:10.1007/BFb0099477
[2] Cholak, P., R. Downey, and E. Herrmann, "Some orbits for $\mathcalE$", Annals of Pure and Applied Logic, vol. 107 (2001), pp. 193--226.
Mathematical Reviews (MathSciNet): MR1807845
Zentralblatt MATH: 0969.03051
Digital Object Identifier: doi:10.1016/S0168-0072(00)00060-9
[3] Cholak, P. A., R. Downey, and L. A. Harrington, "The complexity of orbits of computably enumerable sets", Bulletin of Symbolic Logic, vol. 14 (2008), pp. 69--87.
Mathematical Reviews (MathSciNet): MR2395047
Zentralblatt MATH: 1142.03022
Digital Object Identifier: doi:10.2178/bsl/1208358844
Project Euclid: euclid.bsl/1208358844
[4] Downey, R. G., "$\Delta\sp 0\sb 2$" degrees and transfer theorems", Illinois Journal of Mathematics, vol. 31 (1987), pp. 419--27.
Mathematical Reviews (MathSciNet): MR892177
Zentralblatt MATH: 0629.03017
Project Euclid: euclid.ijm/1256069291
[5] Downey, R. G., and M. Stob, "Automorphisms of the lattice of recursively enumerable sets: Orbits", Advances in Mathematics, vol. 92 (1992), pp. 237--65.
Mathematical Reviews (MathSciNet): MR1155466
Zentralblatt MATH: 0758.03020
Digital Object Identifier: doi:10.1016/0001-8708(92)90065-S
[6] Downey, R., and L. Harrington, "There is no fat orbit", Annals of Pure and Applied Logic, vol. 80 (1996), pp. 277--89.
Mathematical Reviews (MathSciNet): MR1402299
Zentralblatt MATH: 0858.03043
Digital Object Identifier: doi:10.1016/0168-0072(96)83748-1
[7] Downey, R., and M. Stob, "Splitting theorems in recursion theory", Annals of Pure and Applied Logic, vol. 65 (1993), pp. 1--106.
Mathematical Reviews (MathSciNet): MR1253607
Zentralblatt MATH: 0792.03028
Digital Object Identifier: doi:10.1016/0168-0072(93)90234-5
[8] Downey, R., and M. Stob, "Jumps of hemimaximal sets", Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 37 (1991), pp. 113--20.
Mathematical Reviews (MathSciNet): MR1155129
Zentralblatt MATH: 0739.03026
Digital Object Identifier: doi:10.1002/malq.19910370802
[9] Friedberg, R. M., "Three theorems on recursive enumeration. I. Decomposition. II". Maximal set. III. Enumeration without duplication, The Journal of Symbolic Logic, vol. 23 (1958), pp. 309--16.
Mathematical Reviews (MathSciNet): MR0109125
Zentralblatt MATH: 0088.01601
Digital Object Identifier: doi:10.2307/2964290
JSTOR: links.jstor.org
[10] Herrmann, E., and M. Kummer, "Diagonals and $\mathcalD$-maximal sets", The Journal of Symbolic Logic, vol. 59 (1994), pp. 60--72.
Mathematical Reviews (MathSciNet): MR1264963
Zentralblatt MATH: 0799.03046
Digital Object Identifier: doi:10.2307/2275249
JSTOR: links.jstor.org
[11] Kummer, M., "Diagonals and semihyperhypersimple sets", The Journal of Symbolic Logic, vol. 56 (1991), pp. 1068--74.
[12] Lachlan, A. H., "On the lattice of recursively enumerable sets", Transactions of the American Mathematical Society, vol. 130 (1968), pp. 1--37.
Mathematical Reviews (MathSciNet): MR0227009
Zentralblatt MATH: 0281.02042
Digital Object Identifier: doi:10.2307/1994768
[13] Martin, D. A., "Classes of recursively enumerable sets and degrees of unsolvability", Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 12 (1966), pp. 295--310.
Mathematical Reviews (MathSciNet): MR0224469
Zentralblatt MATH: 0181.30504
Digital Object Identifier: doi:10.1002/malq.19660120125
[14] Soare, R. I., "Automorphisms of the lattice of recursively enumerable sets. I. Maximal sets", Annals of Mathematics. Second Series, vol. 100 (1974), pp. 80--120.
Mathematical Reviews (MathSciNet): MR0360235
Zentralblatt MATH: 0253.02040
Digital Object Identifier: doi:10.2307/1970842
JSTOR: links.jstor.org
[15] Soare, R. I., Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets, Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1987.
Mathematical Reviews (MathSciNet): MR882921
Zentralblatt MATH: 0623.03042
Notre Dame Journal of Formal Logic
