Article contents
The density of the meet-inaccessible r. e. degrees
Published online by Cambridge University Press: 12 March 2014
Abstract
In 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).
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1992
References
REFERENCES
- 1
- Cited by