P. Cholak et R. Downey, LATTICE NONEMBEDDINGS AND INTERVALS OF THE RECURSIVELY-ENUMERABLE DEGREES, Annals of pure and applied Logic, 61(3), 1993, pp. 195-221
Let b and c be r.e. Turing degrees such that b > c. We show that there
is an r. e. degree a such that b > a > c and all lattices containing
a critical triple, including the lattice M5, cannot be embedded into t
he interval [c, a].