Manuel Lerman

According to our database, Manuel Lerman authored at least 30 papers between 1969 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

IN MEMORIAM: GERALD E. SACKS, 1933-2019.

Manuel Lerman, Theodore A. Slaman

Bull. Symb. Log., 2022

2013

Separating Principles below Ramsey's Theorem for Pairs.

Manuel Lerman, Reed Solomon, Henry Towsner

J. Math. Log., 2013

2009

Stability and posets.

Carl G. Jockusch Jr., Bart Kastermans, Steffen Lempp, Manuel Lerman, Reed Solomon

J. Symb. Log., 2009

2008

Self-Embeddings of Computable Trees.

Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl, Reed Solomon

Notre Dame J. Formal Log., 2008

2006

On a conjecture of Dobrinen and Simpson concerning almost everywhere domination.

Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, Reed Solomon

J. Symb. Log., 2006

2003

Computable choice functions for computable linear orderings.

Manuel Lerman, Richard Watnick

Math. Log. Q., 2003

Homomorphisms and quotients of degree structures.

Burkhard Englert, Manuel Lerman, Kevin Wald

Ann. Pure Appl. Log., 2003

2001

Embedding Finite Lattices into The Ideals of Computably Enumerable Turing Degrees.

William C. Calhoun, Manuel Lerman

J. Symb. Log., 2001

2000

A Necessary and Sufficient Condition for Embedding Principally Decomposable Finite Lattices into the Computably Enumerable Degrees.

Manuel Lerman

Ann. Pure Appl. Log., 2000

1998

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

Manuel Lerman

Ann. Pure Appl. Log., 1998

1997

A Finite Lattice without Critical Triple that cannot be Embedded into the Enumerable Turing Degrees.

Steffen Lempp, Manuel Lerman

Ann. Pure Appl. Log., 1997

Iterated trees of strategies and priority arguments.

Steffen Lempp, Manuel Lerman

Arch. Math. Log., 1997

1996

Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices.

Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp, Manuel Lerman

J. Symb. Log., 1996

1995

A general framework for priority arguments.

Steffen Lempp, Manuel Lerman

Bull. Symb. Log., 1995

1992

The Existential Theory of the Pomset of r.e. Degrees with a Predicate for Single Jump Reducibility.

Steffen Lempp, Manuel Lerman

J. Symb. Log., 1992

1991

Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets.

Manuel Lerman

Math. Log. Q., 1991

1989

Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion.

Carl G. Jockusch Jr., Manuel Lerman, Robert I. Soare, Robert Solovay

J. Symb. Log., 1989

Lattice Embeddings into the Recursively Enumerable Degrees II.

Klaus Ambos-Spies, Manuel Lerman

J. Symb. Log., 1989

1986

Lattice Embeddings into the Recursively Enumerable Degrees.

Klaus Ambos-Spies, Manuel Lerman

J. Symb. Log., 1986

Degrees which do not bound minimal degrees.

Manuel Lerman

Ann. Pure Appl. Log., 1986

1985

Upper bounds for the arithmetical degrees.

Manuel Lerman

Ann. Pure Appl. Log., 1985

1984

The Universal Splitting Property. II.

Manuel Lerman, Jeffrey B. Remmel

J. Symb. Log., 1984

1979

Theories with Recursive Models.

Manuel Lerman, James H. Schmerl

J. Symb. Log., 1979

1976

Ideals of Generalized Finite Sets in Lattices of α-Recursively Enumerable Sets.

Manuel Lerman

Math. Log. Q., 1976

Types of Simple alpha-Recursively Enumerable Sets.

Manuel Lerman

J. Symb. Log., 1976

Congruence Relations, Filters, Ideals, and Definability in Lattices of alpha-Recursively Enumerable Sets.

Manuel Lerman

J. Symb. Log., 1976

1974

Least Upper Bounds For Minimal Pairs of alpha-R.E. alpha Degrees.

Manuel Lerman

J. Symb. Log., 1974

1971

Some Theorems on R-Maximal Sets and Major Subsets of Recursively Enumerable Sets.

Manuel Lerman

J. Symb. Log., 1971

1970

Turing Degrees and Many-One Degrees of Maximal Sets.

Manuel Lerman

J. Symb. Log., 1970

1969

Some Nondistributive Lattices as Initial Segments of the Degrees of Unsolvability.

Manuel Lerman

J. Symb. Log., 1969