Decomposition and infima in the computably enumerable degrees

Journal of Symbolic Logic 68 (2):551-579 (2003)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1052669063
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
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 26,627
Through your library
References found in this work BETA
A Non-Inversion Theorem for the Jump Operator.Richard A. Shore - 1988 - Annals of Pure and Applied Logic 40 (3):277-303.
The Density of the Nonbranching Degrees.Peter A. Fejer - 1983 - Annals of Pure and Applied Logic 24 (2):113-130.
Working Below a Low2 Recursively Enumerably Degree.Richard A. Shore & Theodore A. Slaman - 1990 - Archive for Mathematical Logic 29 (3):201-211.
The Density of Infima in the Recursively Enumerable Degrees.Theodore A. Slaman - 1991 - Annals of Pure and Applied Logic 52 (1-2):155-179.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
A Hierarchy for the Plus Cupping Turing Degrees.Yong Wang & Angsheng Li - 2003 - Journal of Symbolic Logic 68 (3):972-988.
Complementation in the Turing Degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
Infima of Recursively Enumerable Truth Table Degrees.Peter A. Fejer & Richard A. Shore - 1988 - Notre Dame Journal of Formal Logic 29 (3):420-437.
Degrees of Monotone Complexity.William C. Calhoun - 2006 - Journal of Symbolic Logic 71 (4):1327 - 1341.
Maximal Contiguous Degrees.Peter Cholak, Rod Downey & Stephen Walk - 2002 - Journal of Symbolic Logic 67 (1):409-437.
On a Problem of Cooper and Epstein.Shamil Ishmukhametov - 2003 - Journal of Symbolic Logic 68 (1):52-64.
Bounding Minimal Degrees by Computably Enumerable Degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.

Monthly downloads

Added to index

2009-01-28

Total downloads

199 ( #20,438 of 2,157,999 )

Recent downloads (6 months)

1 ( #359,001 of 2,157,999 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums