The density of the meet-inaccessible R.e. Degrees

Journal of Symbolic Logic 57 (2):585-596 (1992)
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)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275294
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 31,812
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Normative Uncertainty for Non-Cognitivists.Andrew Sepielli - 2012 - Philosophical Studies 160 (2):191-207.
The Π02 Enumeration Degrees Are Not Dense.William C. Calhoun & Theodore A. Slaman - 1996 - Journal of Symbolic Logic 61 (4):1364 - 1379.
Bi-Isolation in the D.C.E. Degrees.Guohua Wu - 2004 - Journal of Symbolic Logic 69 (2):409 - 420.
Maximal Contiguous Degrees.Peter Cholak, Rod Downey & Stephen Walk - 2002 - Journal of Symbolic Logic 67 (1):409-437.
The Degrees of Conditional Problems.Su Gao - 1994 - Journal of Symbolic Logic 59 (1):166-181.
Wtt-Degrees and T-Degrees of R.E. Sets.Michael Stob - 1983 - Journal of Symbolic Logic 48 (4):921-930.
Added to PP index

Total downloads
24 ( #239,685 of 2,231,615 )

Recent downloads (6 months)
11 ( #41,863 of 2,231,615 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature