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

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


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 5,865
External links
  • Through your library Configure

    Similar books and articles

    Analytics

    Monthly downloads

    Sorry, there are not enough data points to plot this chart.

    Added to index

    2009-01-28

    Total downloads

    0

    Recent downloads (6 months)

    0

    How can I increase my downloads?


    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.

    Other forums