Manuel Lerman

Publication Activity (10 Years)

Years Active: 1969-2022
Publications (10 Years): 1

Top Topics

Evolutionary Algorithm

Semantically Similar

Top Venues

Bull. Symb. Log.

Publications

Manuel Lerman, Theodore A. Slaman
IN MEMORIAM: GERALD E. SACKS, 1933-2019. Bull. Symb. Log. 28 (1) (2022)
Manuel Lerman, Reed Solomon, Henry Towsner
Separating Principles below Ramsey's Theorem for Pairs. J. Math. Log. 13 (2) (2013)
Carl G. Jockusch Jr., Bart Kastermans, Steffen Lempp, Manuel Lerman, Reed Solomon
Stability and posets. J. Symb. Log. 74 (2) (2009)
Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl, Reed Solomon
Self-Embeddings of Computable Trees. Notre Dame J. Formal Log. 49 (1) (2008)
Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, Reed Solomon
On a conjecture of Dobrinen and Simpson concerning almost everywhere domination. J. Symb. Log. 71 (1) (2006)
Manuel Lerman, Richard Watnick
Computable choice functions for computable linear orderings. Math. Log. Q. 49 (5) (2003)
Burkhard Englert, Manuel Lerman, Kevin Wald
Homomorphisms and quotients of degree structures. Ann. Pure Appl. Log. 123 (1-3) (2003)
William C. Calhoun, Manuel Lerman
Embedding Finite Lattices into The Ideals of Computably Enumerable Turing Degrees. J. Symb. Log. 66 (4) (2001)
Manuel Lerman
A Necessary and Sufficient Condition for Embedding Principally Decomposable Finite Lattices into the Computably Enumerable Degrees. Ann. Pure Appl. Log. 101 (2-3) (2000)
Manuel Lerman
A Necessary and Sufficient Condition for Embedding Ranked Finite Partial Lattices into the Computably Enumerable Degrees. Ann. Pure Appl. Log. 94 (1-3) (1998)
Steffen Lempp, Manuel Lerman
A Finite Lattice without Critical Triple that cannot be Embedded into the Enumerable Turing Degrees. Ann. Pure Appl. Log. 87 (2) (1997)
Steffen Lempp, Manuel Lerman
Iterated trees of strategies and priority arguments. Arch. Math. Log. 36 (4-5) (1997)
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) (1996)
Steffen Lempp, Manuel Lerman
A general framework for priority arguments. Bull. Symb. Log. 1 (2) (1995)
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) (1992)
Manuel Lerman
Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets. Math. Log. Q. 37 (19-22) (1991)
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) (1989)
Klaus Ambos-Spies, Manuel Lerman
Lattice Embeddings into the Recursively Enumerable Degrees II. J. Symb. Log. 54 (3) (1989)
Klaus Ambos-Spies, Manuel Lerman
Lattice Embeddings into the Recursively Enumerable Degrees. J. Symb. Log. 51 (2) (1986)
Manuel Lerman
Degrees which do not bound minimal degrees. Ann. Pure Appl. Log. 30 (3) (1986)
Manuel Lerman
Upper bounds for the arithmetical degrees. Ann. Pure Appl. Log. 29 (3) (1985)
Manuel Lerman, Jeffrey B. Remmel
The Universal Splitting Property. II. J. Symb. Log. 49 (1) (1984)
Manuel Lerman, James H. Schmerl
Theories with Recursive Models. J. Symb. Log. 44 (1) (1979)
Manuel Lerman
Ideals of Generalized Finite Sets in Lattices of α-Recursively Enumerable Sets. Math. Log. Q. 22 (1) (1976)
Manuel Lerman
Types of Simple alpha-Recursively Enumerable Sets. J. Symb. Log. 41 (2) (1976)
Manuel Lerman
Congruence Relations, Filters, Ideals, and Definability in Lattices of alpha-Recursively Enumerable Sets. J. Symb. Log. 41 (2) (1976)
Manuel Lerman
Least Upper Bounds For Minimal Pairs of alpha-R.E. alpha Degrees. J. Symb. Log. 39 (1) (1974)
Manuel Lerman
Some Theorems on R-Maximal Sets and Major Subsets of Recursively Enumerable Sets. J. Symb. Log. 36 (2) (1971)
Manuel Lerman
Turing Degrees and Many-One Degrees of Maximal Sets. J. Symb. Log. 35 (1) (1970)
Manuel Lerman
Some Nondistributive Lattices as Initial Segments of the Degrees of Unsolvability. J. Symb. Log. 34 (1) (1969)