University of Connecticut
Department of Mathematics

MANUEL LERMAN Department of Mathematics University of Connecticut Storrs, CT 06269-3009 Office: MSB 126 Telephone: (860) 486-3928 Fax: (860) 486-4238 email: lerman@math.uconn.edu

---

Ph.D., 1968, Cornell University

---

Research Interests

Logic; Recursion Theory & Degrees of Unsolvability

---

Vita

Vita

---

Publications Available Online

A Framework for Priority Arguments

Cappable CEA sets and Ramseys Theorem

Stability and posets

Self-embeddings of computable trees

Embedding finite lattices into the computably enumerable degrees - a status survey

Homomorphisms and quotients of degree structures

Embeddings into the computably enumerable degrees

Computable choice functions for computable linear orderings

Embedding finite lattices into the ideals of computably enumerable Turing degrees

A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees

Iterated trees of strategies and priority arguments

Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semilattices

A general framework for priority arguments

Lattice embeddings into the r.e. degrees preserving 1

Lattice embeddings into the r.e. degrees preserving 0 and 1

Minimal pair constructions and iterated trees of strategies

Priority arguments using iterated trees of strategies