A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees Original Research Article

We define a class of finite partial lattices which admit a notion of rank compatible with embedding constructions, and present a necessary and sufficient condition for the embeddability of a finite ranked partial lattice into the computably enumerable degrees.