We study computably enumerable equivalence relations (ceers), under the
reducibility $R \le S$ if there exists a computable function f such
that $x\,R\,y$ if and only if $f\left( x \right)\,\,S\,f\left( y \right)$, for every $x,y$. We show that the degrees of ceers under the equivalence
relation generated by $\le$ form a bounded poset that is neither a lower semilattice, nor
an upper semilattice, and its first-order theory is undecidable. We then study
the universal ceers. We show that 1) the uniformly effectively inseparable ceers
are universal, but there are effectively inseparable ceers that are not
universal; 2) a ceer R is universal if and only if $R\prime \le R$, where $R\prime$ denotes the halting jump operator introduced by Gao and Gerdes
(answering an open question of Gao and Gerdes); and 3) both the index set of the
universal ceers and the index set of the uniformly effectively inseparable ceers
are ${\rm{\Sigma }}_3^0$-complete (the former answering an open question of Gao and
Gerdes).