There Are No Maximal Low D.C.E.~Degrees
Rod Downey and Liang Yu
Source: Notre Dame J. Formal Logic Volume 45, Number 3
(2004), 147-159.
Abstract
We prove that there is no maximal low d.c.e degree.
First Page:
Show
Hide
Primary Subjects:
03D28
Full-text: Open access
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.ndjfl/1099080209
Digital Object Identifier: doi:10.1305/ndjfl/1099080209
Mathematical Reviews number (MathSciNet): MR2130783
Zentralblatt MATH identifier: 02186743
References
[1] Arslanov, M. M., "Lattice properties of the degrees below $\bf 0'$", Doklady Akademii Nauk SSSR, vol. 283 (1985), pp. 270--73.
Mathematical Reviews (MathSciNet): MR87e:03095
Zentralblatt MATH: 0596.03040
[2] Arslanov, M., S. B. Cooper, and A. Li, "There is no low maximal d.c.e. degree", Mathematical Logic Quarterly, vol. 46 (2000), pp. 409--416.
Mathematical Reviews (MathSciNet): MR2001e:03076
Zentralblatt MATH: 0967.03037
Digital Object Identifier: doi:10.1002/1521-3870(200008)46:3<409::AID-MALQ409>3.0.CO;2-P
[3] Arslanov, M. M., G. L. LaForte, and T. A. Slaman, "Relative enumerability in the difference hierarchy", The Journal of Symbolic Logic, vol. 63 (1998), pp. 411--20.
[4] Cooper, S. B., L. Harrington, A. H. Lachlan, S. Lempp, and R. I. Soare, "The d.r.e. degrees are not dense", Annals of Pure and Applied Logic, vol. 55 (1991), pp. 125--51.
Mathematical Reviews (MathSciNet): MR93a:03045
Zentralblatt MATH: 0756.03020
Digital Object Identifier: doi:10.1016/0168-0072(91)90005-7
[5] Downey, R., "D.r.e. degrees and the nondiamond theorem", The Bulletin of the London Mathematical Society, vol. 21 (1989), pp. 43--50.
Mathematical Reviews (MathSciNet): MR90j:03082
Zentralblatt MATH: 0628.03030
[6] Kučera, A., "On the use of diagonally nonrecursive functions", pp. 219--39 in Logic Colloquium '87 (Granada, 1987), vol. 129 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1989.
Mathematical Reviews (MathSciNet): MR91c:03037
Zentralblatt MATH: 0683.03024
[7] Lachlan, A. H., "A recursively enumerable degree which will not split over all lesser ones", Annals of Mathematical Logic, vol. 9 (1976), pp. 307--65.
Mathematical Reviews (MathSciNet): MR53:12912
Zentralblatt MATH: 0357.02040
Digital Object Identifier: doi:10.1016/0003-4843(76)90016-4
[8] Robinson, R. W., "Interpolation and embedding in the recursively enumerable degrees", Annals of Mathematics (2), vol. 93 (1971), pp. 285--314.
Mathematical Reviews (MathSciNet): MR43:51
Zentralblatt MATH: 0259.02033
JSTOR: links.jstor.org
Digital Object Identifier: doi:10.2307/1970776
[9] Sacks, G. E., "The recursively enumerable degrees are dense", Annals of Mathematics (2), vol. 80 (1964), pp. 300--312.
Mathematical Reviews (MathSciNet): MR29:3367
Zentralblatt MATH: 0135.00702
JSTOR: links.jstor.org
Digital Object Identifier: doi:10.2307/1970393
Notre Dame Journal of Formal Logic
