Decomposition and infima in the computably enumerable degrees

摘要

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.