A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element (Q5945396)

\textit{M. Lerman} [Ann. Pure Appl. Logic 101, 275-297 (2000; Zbl 0945.03062)] gave a necessary and sufficient condition called EC1 characterizing which lattices without critical triples (i.e. principally decomposable) are embeddable into the computably enumerable Turing degrees. Englert extends this to show the same is true if we also ask that 1 is preserved. The coding makes the argument more difficult.