Manuel Lerman

30 papers Journal 30
YearRankTypeTitle / Venue / Authors
2022 J jnl
IN MEMORIAM: GERALD E. SACKS, 1933-2019.
Bull. Symb. Log.
Manuel Lerman, Theodore A. Slaman
2013 J jnl
Separating Principles below Ramsey's Theorem for Pairs.
J. Math. Log.
Manuel Lerman, Reed Solomon, Henry Towsner
2009 J jnl
Stability and posets.
J. Symb. Log.
Carl G. Jockusch Jr., Bart Kastermans, Steffen Lempp, Manuel Lerman, Reed Solomon
2008 J jnl
Self-Embeddings of Computable Trees.
Notre Dame J. Formal Log.
Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl, Reed Solomon
2006 J jnl
On a conjecture of Dobrinen and Simpson concerning almost everywhere domination.
J. Symb. Log.
Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, Reed Solomon
2003 J jnl
Computable choice functions for computable linear orderings.
Math. Log. Q.
Manuel Lerman, Richard Watnick
2003 J jnl
Homomorphisms and quotients of degree structures.
Ann. Pure Appl. Log.
Burkhard Englert, Manuel Lerman, Kevin Wald
2001 J jnl
Embedding Finite Lattices into The Ideals of Computably Enumerable Turing Degrees.
J. Symb. Log.
William C. Calhoun, Manuel Lerman
2000 J jnl
A Necessary and Sufficient Condition for Embedding Principally Decomposable Finite Lattices into the Computably Enumerable Degrees.
Ann. Pure Appl. Log.
Manuel Lerman
1998 J jnl
A Necessary and Sufficient Condition for Embedding Ranked Finite Partial Lattices into the Computably Enumerable Degrees.
Ann. Pure Appl. Log.
Manuel Lerman
1997 J jnl
A Finite Lattice without Critical Triple that cannot be Embedded into the Enumerable Turing Degrees.
Ann. Pure Appl. Log.
Steffen Lempp, Manuel Lerman
1997 J jnl
Iterated trees of strategies and priority arguments.
Arch. Math. Log.
Steffen Lempp, Manuel Lerman
1996 J jnl
Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices.
J. Symb. Log.
Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp, Manuel Lerman
1995 J jnl
A general framework for priority arguments.
Bull. Symb. Log.
Steffen Lempp, Manuel Lerman
1992 J jnl
The Existential Theory of the Pomset of r.e. Degrees with a Predicate for Single Jump Reducibility.
J. Symb. Log.
Steffen Lempp, Manuel Lerman
1991 J jnl
Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets.
Math. Log. Q.
Manuel Lerman
1989 J jnl
Lattice Embeddings into the Recursively Enumerable Degrees II.
J. Symb. Log.
Klaus Ambos-Spies, Manuel Lerman
1989 J jnl
Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion.
J. Symb. Log.
Carl G. Jockusch Jr., Manuel Lerman, Robert I. Soare, Robert Solovay
1986 J jnl
Degrees which do not bound minimal degrees.
Ann. Pure Appl. Log.
Manuel Lerman
1986 J jnl
Lattice Embeddings into the Recursively Enumerable Degrees.
J. Symb. Log.
Klaus Ambos-Spies, Manuel Lerman
1985 J jnl
Upper bounds for the arithmetical degrees.
Ann. Pure Appl. Log.
Manuel Lerman
1984 J jnl
The Universal Splitting Property. II.
J. Symb. Log.
Manuel Lerman, Jeffrey B. Remmel
1979 J jnl
Theories with Recursive Models.
J. Symb. Log.
Manuel Lerman, James H. Schmerl
1976 J jnl
Congruence Relations, Filters, Ideals, and Definability in Lattices of alpha-Recursively Enumerable Sets.
J. Symb. Log.
Manuel Lerman
1976 J jnl
Ideals of Generalized Finite Sets in Lattices of α-Recursively Enumerable Sets.
Math. Log. Q.
Manuel Lerman
1976 J jnl
Types of Simple alpha-Recursively Enumerable Sets.
J. Symb. Log.
Manuel Lerman
1974 J jnl
Least Upper Bounds For Minimal Pairs of alpha-R.E. alpha Degrees.
J. Symb. Log.
Manuel Lerman
1971 J jnl
Some Theorems on R-Maximal Sets and Major Subsets of Recursively Enumerable Sets.
J. Symb. Log.
Manuel Lerman
1970 J jnl
Turing Degrees and Many-One Degrees of Maximal Sets.
J. Symb. Log.
Manuel Lerman
1969 J jnl
Some Nondistributive Lattices as Initial Segments of the Degrees of Unsolvability.
J. Symb. Log.
Manuel Lerman