A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees
The problem of characterizing partial finite lattices embeddable into the computably enumerable degrees is studied. The author introduces a notion of ranked partial lattice and decribes a necessary and sufficient condition for embeddings of such lattices. This gives a hope to obtain a complete decision of the problem.
scientific article; zbMATH DE number 1308080