Manuel Lerman - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 30 from 30

2022

IN MEMORIAM: GERALD E. SACKS, 1933-2019Manuel Lerman, Theodore A. Slaman. bsl, 28(1):150-155, 2022. [doi]

2013

Separating Principles below Ramsey's Theorem for PairsManuel Lerman, Reed Solomon, Henry Towsner. jml, 13(2):1350007, 2013. [doi]

2009

Stability and posetsCarl G. Jockusch Jr., Bart Kastermans, Steffen Lempp, Manuel Lerman, Reed Solomon. JSYML, 74(2):693-711, 2009. [doi]

2008

Self-Embeddings of Computable TreesStephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl, Reed Solomon. ndjfl, 49(1):1-37, 2008. [doi]

2006

On a conjecture of Dobrinen and Simpson concerning almost everywhere dominationStephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, Reed Solomon. JSYML, 71(1):119-136, 2006. [doi]

2003

Homomorphisms and quotients of degree structuresBurkhard Englert, Manuel Lerman, Kevin Wald. APAL, 123(1-3):193-233, 2003. [doi]

Computable choice functions for computable linear orderingsManuel Lerman, Richard Watnick. mlq, 49(5):485-510, 2003. [doi]

2001

Embedding Finite Lattices into The Ideals of Computably Enumerable Turing DegreesWilliam C. Calhoun, Manuel Lerman. JSYML, 66(4):1791-1802, 2001.

2000

A Necessary and Sufficient Condition for Embedding Principally Decomposable Finite Lattices into the Computably Enumerable DegreesManuel Lerman. APAL, 101(2-3):275-297, 2000.

1998

A Necessary and Sufficient Condition for Embedding Ranked Finite Partial Lattices into the Computably Enumerable DegreesManuel Lerman. APAL, 94(1-3):143-180, 1998.

1997

A Finite Lattice without Critical Triple that cannot be Embedded into the Enumerable Turing DegreesSteffen Lempp, Manuel Lerman. APAL, 87(2):167-185, 1997.

Iterated trees of strategies and priority argumentsSteffen Lempp, Manuel Lerman. AML, 36(4-5):297-312, 1997. [doi]

1996

Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-LatticesKlaus Ambos-Spies, Peter A. Fejer, Steffen Lempp, Manuel Lerman. JSYML, 61(3):880-905, 1996.

1995

A general framework for priority argumentsSteffen Lempp, Manuel Lerman. bsl, 1(2):189-201, 1995. [doi]

1992

The Existential Theory of the Pomset of r.e. Degrees with a Predicate for Single Jump ReducibilitySteffen Lempp, Manuel Lerman. JSYML, 57(3):1120-1130, 1992.

1991

Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable SetsManuel Lerman. mlq, 37(19-22):331-342, 1991. [doi]

1989

Lattice Embeddings into the Recursively Enumerable Degrees IIKlaus Ambos-Spies, Manuel Lerman. JSYML, 54(3):735-760, 1989.

Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov s Completeness CriterionCarl G. Jockusch Jr., Manuel Lerman, Robert I. Soare, Robert Solovay. JSYML, 54(4):1288-1323, 1989.

1986

Lattice Embeddings into the Recursively Enumerable DegreesKlaus Ambos-Spies, Manuel Lerman. JSYML, 51(2):257-272, 1986.

Degrees which do not bound minimal degreesManuel Lerman. APAL, 30(3):249-276, 1986. [doi]

1985

Upper bounds for the arithmetical degreesManuel Lerman. APAL, 29(3):225-254, 1985. [doi]

1984

The Universal Splitting Property. IIManuel Lerman, Jeffrey B. Remmel. JSYML, 49(1):137-150, 1984.

1979

Theories with Recursive ModelsManuel Lerman, James H. Schmerl. JSYML, 44(1):59-76, 1979.

1976

Types of Simple alpha-Recursively Enumerable SetsManuel Lerman. JSYML, 41(2):419-426, 1976.

Congruence Relations, Filters, Ideals, and Definability in Lattices of alpha-Recursively Enumerable SetsManuel Lerman. JSYML, 41(2):405-418, 1976.

Ideals of Generalized Finite Sets in Lattices of α-Recursively Enumerable SetsManuel Lerman. mlq, 22(1):347-352, 1976. [doi]

1974

Least Upper Bounds For Minimal Pairs of alpha-R.E. alpha DegreesManuel Lerman. JSYML, 39(1):49-56, 1974.

1971

Some Theorems on R-Maximal Sets and Major Subsets of Recursively Enumerable SetsManuel Lerman. JSYML, 36(2):193-215, 1971.

1970

Turing Degrees and Many-One Degrees of Maximal SetsManuel Lerman. JSYML, 35(1):29-40, 1970.

1969

Some Nondistributive Lattices as Initial Segments of the Degrees of UnsolvabilityManuel Lerman. JSYML, 34(1):85-98, 1969.

Sign in or sign up to see more results.

runs on WebDSL