The Density of the Meet-Inaccessible R.E. Degrees
Qinglong, Zhang
J. Symbolic Logic, Tome 57 (1992) no. 1, p. 585-596 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
In this paper it is shown that the meet-inaccessible degrees are dense in $\mathbf{R}$. The construction uses an 0''-priority argument. As a consequence, the meet-inaccessible degrees and the meet-accessible degrees give a partition of $\mathbf{R}$ into two sets, either of which is a nontrivial dense subset of $\mathbf{R}$ and generates $\mathbf{R} - \{0\}$ under joins (thus an automorphism base of $\mathbf{R}$).
Publié le : 1992-06-14
Classification:  
@article{1183743979,
     author = {Qinglong, Zhang},
     title = {The Density of the Meet-Inaccessible R.E. Degrees},
     journal = {J. Symbolic Logic},
     volume = {57},
     number = {1},
     year = {1992},
     pages = { 585-596},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183743979}
}

Qinglong, Zhang. The Density of the Meet-Inaccessible R.E. Degrees. J. Symbolic Logic, Tome 57 (1992) no. 1, pp.  585-596. http://gdmltest.u-ga.fr/item/1183743979/