We study the degree structure of the -c.e., -c.e., and equivalence relations under the computable many-one reducibility. In particular, we investigate for each of these classes of degrees the most basic questions about the structure of the partial order. We prove the existence of the greatest element for the -c.e. and -computably enumerable equivalence relations. We provide computable enumerations of the degrees of -c.e., -c.e., and equivalence relations. We prove that for all the degree classes considered, upward density holds and downward density fails.
"On the Degree Structure of Equivalence Relations Under Computable Reducibility." Notre Dame J. Formal Logic 60 (4) 733 - 761, November 2019. https://doi.org/10.1215/00294527-2019-0028