The density of the meet-inaccessible r. e. degrees

Journal of Symbolic Logic 57 (2):585-596 (1992)
  Copy   BIBTEX

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)

Other Versions

No versions found

Similar books and articles

The Isolated D. R. E. Degrees are Dense in the R. E. Degrees.Geoffrey Laforte - 1996 - Mathematical Logic Quarterly 42 (1):83-103.
r‐Maximal sets and Q1,N‐reducibility.Roland Sh Omanadze & Irakli O. Chitaia - 2021 - Mathematical Logic Quarterly 67 (2):138-148.
Some New Lattice Constructions in High R. E. Degrees.Heinrich Rolletschek - 1995 - Mathematical Logic Quarterly 41 (3):395-430.
Generalized cohesiveness.Tamara Hummel & Carl Jockusch - 1999 - Journal of Symbolic Logic 64 (2):489-516.
Mass problems and randomness.Stephen G. Simpson - 2005 - Bulletin of Symbolic Logic 11 (1):1-27.
The cupping theorem in r/m.Sui Yuefei & Zhang Zaiyue - 1999 - Journal of Symbolic Logic 64 (2):643-650.
On a problem of Ishmukhametov.Chengling Fang, Guohua Wu & Mars Yamaleev - 2013 - Archive for Mathematical Logic 52 (7-8):733-741.
Splittings of 0' into the Recursively Enumerable Degrees.Xiaoding Yi - 1996 - Mathematical Logic Quarterly 42 (1):249-269.
Splitting properties of R. E. sets and degrees.R. G. Downey & L. V. Welch - 1986 - Journal of Symbolic Logic 51 (1):88-109.

Analytics

Added to PP
2009-01-28

Downloads
198 (#203,633)

6 months
40 (#212,696)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references