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 \cup c) \cap (b\cupc), a \cup c | b \cup c, and c a \cup b.
Citation
Rodney G. Downey. Geoffrey L. LaForte. Richard A. Shore. "Decomposition and infima in the computably enumerable degrees." J. Symbolic Logic 68 (2) 551 - 579, June 2003. https://doi.org/10.2178/jsl/1052669063
Information
