Decomposition and infima in the computably enumerable degrees
AbstractGiven 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.
2015 ◽
Vol 144
(4)
◽
pp. 1735-1744
◽
2008 ◽
Vol 73
(2)
◽
pp. 559-577
◽
1998 ◽
Vol 350
(7)
◽
pp. 2719-2736
◽
2015 ◽
Vol 15
(01)
◽
pp. 1550003
◽