Manuel Lerman

Relationships between reducibilities

A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets

Recursively enumerable sets and degrees

Nowhere simple sets and the lattice of recursively enumerable sets

Automorphisms of the Lattice of Recursively Enumerable Sets Part I: Maximal Sets

Automorphisms of the lattice of recursively enumerable sets

Hypersimple sets with retraceable complements

Banach–Mazur games, comeager sets and degrees of unsolvability

Index sets of degrees of unsolvability

Some theorems on R-maximal sets and major subsets of recursively enumerable sets

Recursive functions modulo 𝐶𝑂-𝑟-maximal sets

Congruence relations, filters, ideals, and definability in lattices of α-recursively enumerable sets

Turing degrees and many-one degrees of maximal sets

Congruence relations, filters, ideals, and definability in lattices of α-recursively enumerable sets

r-Maximal major subsets

A decidable fragment of the elementary theory of the lattice of recursively enumerable sets

Initial Segments of the Degrees of Unsolvability

Recursive Functions Modulo Co-r-Maximal Sets

d-simple sets, small sets, and degree classes

Turing degrees and many-one degrees of maximal sets