A high c.e. degree which is not the join of two minimal degrees

Journal of Symbolic Logic 75 (4):1339-1358 (2010)
  Copy   BIBTEX

Abstract

We construct a high c.e. degree which is not the join of two minimal degrees and so refute Posner's conjecture that every high c.e. degree is the join of two minimal degrees. Additionally, the proof shows that there is a high c.e. degree a such that for any splitting of a into degrees b and c one of these degrees bounds a 1-generic degree

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1286198150

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,894

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Bounding computably enumerable degrees in the Ershov hierarchy.Angsheng Li, Guohua Wu & Yue Yang - 2006 - Annals of Pure and Applied Logic 141 (1):79-88.
Intervals containing exactly one c.e. degree.Guohua Wu - 2007 - Annals of Pure and Applied Logic 146 (1):91-102.
Joining to high degrees via noncuppables.Jiang Liu & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (2):195-211.
Completely mitotic c.e. degrees and non-jump inversion.Evan J. Griffiths - 2005 - Annals of Pure and Applied Logic 132 (2-3):181-207.
Nonisolated degrees and the jump operator.Guohua Wu - 2002 - Annals of Pure and Applied Logic 117 (1-3):209-221.
Prime models of computably enumerable degree.Rachel Epstein - 2008 - Journal of Symbolic Logic 73 (4):1373-1388.
On the existence of a strong minimal pair.George Barmpalias, Mingzhong Cai, Steffen Lempp & Theodore A. Slaman - 2015 - Journal of Mathematical Logic 15 (1):1550003.
Non‐isolated quasi‐degrees.Ilnur I. Batyrshin - 2009 - Mathematical Logic Quarterly 55 (6):587-597.
A minimal pair joining to a plus cupping Turing degree.Dengfeng Li & Angsheng Li - 2003 - Mathematical Logic Quarterly 49 (6):553-566.
Decomposition and infima in the computably enumerable degrees.Rodney G. Downey, Geoffrey L. Laforte & Richard A. Shore - 2003 - Journal of Symbolic Logic 68 (2):551-579.

Analytics

Added to PP
2010-09-12

Downloads
54 (#447,901)

6 months
11 (#343,540)

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