| 2003 |
|---|
| 21 | EE | Burkhard Englert,
Manuel Lerman,
Kevin Wald:
Homomorphisms and quotients of degree structures.
Ann. Pure Appl. Logic 123(1-3): 193-233 (2003) |
| 20 | EE | Manuel Lerman,
Richard Watnick:
Computable choice functions for computable linear orderings.
Math. Log. Q. 49(5): 485-510 (2003) |
| 2001 |
|---|
| 19 | | William C. Calhoun,
Manuel Lerman:
Embedding Finite Lattices into The Ideals of Computably Enumerable Turing Degrees.
J. Symb. Log. 66(4): 1791-1802 (2001) |
| 2000 |
|---|
| 18 | | Manuel Lerman:
A Necessary and Sufficient Condition for Embedding Principally Decomposable Finite Lattices into the Computably Enumerable Degrees.
Ann. Pure Appl. Logic 101(2-3): 275-297 (2000) |
| 1998 |
|---|
| 17 | | Manuel Lerman:
A Necessary and Sufficient Condition for Embedding Ranked Finite Partial Lattices into the Computably Enumerable Degrees.
Ann. Pure Appl. Logic 94(1-3): 143-180 (1998) |
| 1997 |
|---|
| 16 | | Steffen Lempp,
Manuel Lerman:
A Finite Lattice without Critical Triple that cannot be Embedded into the Enumerable Turing Degrees.
Ann. Pure Appl. Logic 87(2): 167-185 (1997) |
| 15 | EE | Steffen Lempp,
Manuel Lerman:
Iterated trees of strategies and priority arguments.
Arch. Math. Log. 36(4-5): 297-312 (1997) |
| 1996 |
|---|
| 14 | | Klaus Ambos-Spies,
Peter A. Fejer,
Steffen Lempp,
Manuel Lerman:
Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices.
J. Symb. Log. 61(3): 880-905 (1996) |
| 1995 |
|---|
| 13 | EE | Steffen Lempp,
Manuel Lerman:
A general framework for priority arguments.
Bulletin of Symbolic Logic 1(2): 189-201 (1995) |
| 1992 |
|---|
| 12 | | Steffen Lempp,
Manuel Lerman:
The Existential Theory of the Pomset of r.e. Degrees with a Predicate for Single Jump Reducibility.
J. Symb. Log. 57(3): 1120-1130 (1992) |
| 1989 |
|---|
| 11 | | Klaus Ambos-Spies,
Manuel Lerman:
Lattice Embeddings into the Recursively Enumerable Degrees II.
J. Symb. Log. 54(3): 735-760 (1989) |
| 10 | | Carl G. Jockusch Jr.,
Manuel Lerman,
Robert I. Soare,
Robert Solovay:
Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion.
J. Symb. Log. 54(4): 1288-1323 (1989) |
| 1986 |
|---|
| 9 | | Klaus Ambos-Spies,
Manuel Lerman:
Lattice Embeddings into the Recursively Enumerable Degrees.
J. Symb. Log. 51(2): 257-272 (1986) |
| 1984 |
|---|
| 8 | | Manuel Lerman,
Jeffrey B. Remmel:
The Universal Splitting Property. II.
J. Symb. Log. 49(1): 137-150 (1984) |
| 1979 |
|---|
| 7 | | Manuel Lerman,
James H. Schmerl:
Theories with Recursive Models.
J. Symb. Log. 44(1): 59-76 (1979) |
| 1976 |
|---|
| 6 | | Manuel Lerman:
Congruence Relations, Filters, Ideals, and Definability in Lattices of alpha-Recursively Enumerable Sets.
J. Symb. Log. 41(2): 405-418 (1976) |
| 5 | | Manuel Lerman:
Types of Simple alpha-Recursively Enumerable Sets.
J. Symb. Log. 41(2): 419-426 (1976) |
| 1974 |
|---|
| 4 | | Manuel Lerman:
Least Upper Bounds For Minimal Pairs of alpha-R.E. alpha Degrees.
J. Symb. Log. 39(1): 49-56 (1974) |
| 1971 |
|---|
| 3 | | Manuel Lerman:
Some Theorems on R-Maximal Sets and Major Subsets of Recursively Enumerable Sets.
J. Symb. Log. 36(2): 193-215 (1971) |
| 1970 |
|---|
| 2 | | Manuel Lerman:
Turing Degrees and Many-One Degrees of Maximal Sets.
J. Symb. Log. 35(1): 29-40 (1970) |
| 1969 |
|---|
| 1 | | Manuel Lerman:
Some Nondistributive Lattices as Initial Segments of the Degrees of Unsolvability.
J. Symb. Log. 34(1): 85-98 (1969) |
