The density of the meet-inaccessible r. e. degrees
AbstractIn this paper it is shown that the meet-inaccessible degrees are dense in R. The construction uses an 0′-priority argument. As a consequence, the meet-inaccessible degrees and the meet-accessible degrees give a partition of R into two sets, either of which is a nontrivial dense subset of R and generates R − {0} under joins (thus an automorphism base of R).
1999 ◽
Vol 129
(5)
◽
pp. 885-901
◽
Keyword(s):
1990 ◽
Vol 107
(2)
◽
pp. 349-360
◽
1989 ◽
Vol 106
(3)
◽
pp. 467-469
1972 ◽
Vol 24
(4)
◽
pp. 622-630
◽
Keyword(s):
Keyword(s):
2004 ◽
Vol 56
(3)
◽
pp. 638-654
◽
Keyword(s):
1989 ◽
Vol 32
(3)
◽
pp. 320-326
◽