Decomposition and infima in the computably enumerable degrees

, &
Journal of Symbolic Logic 68 (2):551-579 (2003)
  Copy   BIBTEX

Abstract

Given two incomparable c.e. Turing degrees a and b, we show that there exists a c.e. degree c such that c = (a ⋃ c) ⋂ (b ⋃ c), a ⋃ c | b ⋃ c, and c < a ⋃ b

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1052669063

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: 104,743

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

Prime models of computably enumerable degree.Rachel Epstein - 2008 - Journal of Symbolic Logic 73 (4):1373-1388.
An Interval of Computably Enumerable Isolating Degrees.Matthew C. Salts - 1999 - Mathematical Logic Quarterly 45 (1):59-72.
Finite cupping sets.Andrew Lewis - 2004 - Archive for Mathematical Logic 43 (7):845-858.
Relative enumerability and 1-genericity.Wei Wang - 2011 - Journal of Symbolic Logic 76 (3):897 - 913.
Infima in the Recursively Enumerable Weak Truth Table Degrees.Rich Blaylock, Rod Downey & Steffen Lempp - 1997 - Notre Dame Journal of Formal Logic 38 (3):406-418.
Bi-Isolation in the D.C.E. Degrees.Guohua Wu - 2004 - Journal of Symbolic Logic 69 (2):409 - 420.
The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees.George Barmpalias & Andrew E. M. Lewis - 2006 - Notre Dame Journal of Formal Logic 47 (3):361-370.
Lattice nonembeddings and intervals of the recursively enumerable degrees.Peter Cholak & Rod Downey - 1993 - Annals of Pure and Applied Logic 61 (3):195-221.
Degree structures of conjunctive reducibility.Irakli Chitaia & Roland Omanadze - 2021 - Archive for Mathematical Logic 61 (1):19-31.
The continuity of cupping to 0'.Klaus Ambos-Spies, Alistair H. Lachlan & Robert I. Soare - 1993 - Annals of Pure and Applied Logic 64 (3):195-209.

Analytics

Added to PP
2009-01-28

Downloads
277 (#103,584)

6 months
19 (#160,720)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

The density of the nonbranching degrees.Peter A. Fejer - 1983 - Annals of Pure and Applied Logic 24 (2):113-130.
The density of infima in the recursively enumerable degrees.Theodore A. Slaman - 1991 - Annals of Pure and Applied Logic 52 (1-2):155-179.
Working below a low2 recursively enumerably degree.Richard A. Shore & Theodore A. Slaman - 1990 - Archive for Mathematical Logic 29 (3):201-211.
A non-inversion theorem for the jump operator.Richard A. Shore - 1988 - Annals of Pure and Applied Logic 40 (3):277-303.

Add more references