A Necessary and Sufficient Condition for Embedding Ranked Finite Partial Lattices into the Computably Enumerable Degrees

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.

Authors

Manuel Lerman

This author has not been identified. Look up 'Manuel Lerman' in Google