Manuel Lerman. A Necessary and Sufficient Condition for Embedding Ranked Finite Partial Lattices into the Computably Enumerable Degrees. Annals of Pure and Applied Logic, 94(1-3):143-180, 1998.
@article{Lerman98,
title = {A Necessary and Sufficient Condition for Embedding Ranked Finite Partial Lattices into the Computably Enumerable Degrees},
author = {Manuel Lerman},
year = {1998},
researchr = {https://researchr.org/publication/Lerman98},
cites = {0},
citedby = {0},
journal = {Annals of Pure and Applied Logic},
volume = {94},
number = {1-3},
pages = {143-180},
}