Steffen Lempp, Manuel Lerman A Finite Lattice without Critical Triple that cannot be Embedded into the Enumerable Turing Degrees. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1997, v:87, n:2, pp:167-185 [Journal]
Manuel Lerman A Necessary and Sufficient Condition for Embedding Principally Decomposable Finite Lattices into the Computably Enumerable Degrees. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2000, v:101, n:2-3, pp:275-297 [Journal]
Manuel Lerman A Necessary and Sufficient Condition for Embedding Ranked Finite Partial Lattices into the Computably Enumerable Degrees. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:143-180 [Journal]
Steffen Lempp, Manuel Lerman The Existential Theory of the Pomset of r.e. Degrees with a Predicate for Single Jump Reducibility. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1992, v:57, n:3, pp:1120-1130 [Journal]
Manuel Lerman Some Nondistributive Lattices as Initial Segments of the Degrees of Unsolvability. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1969, v:34, n:1, pp:85-98 [Journal]
Manuel Lerman Some Theorems on R-Maximal Sets and Major Subsets of Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1971, v:36, n:2, pp:193-215 [Journal]
Manuel Lerman Least Upper Bounds For Minimal Pairs of alpha-R.E. alpha Degrees. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1974, v:39, n:1, pp:49-56 [Journal]
Manuel Lerman Congruence Relations, Filters, Ideals, and Definability in Lattices of alpha-Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1976, v:41, n:2, pp:405-418 [Journal]