@JeanAbouSamra I don't think this is true, however: for example, it is known that any $2$-generic and any $2$-random Turing degree form a minimal pair (that is, their inf is $\textbf{0}$), but there is no upper bound on all $2$-generic or all $2$-random degrees.
↧