%0 Journal Article
%T Computably Enumerable Equivalence Relations
%A Su Gao
%A Peter Gerdes
%J Mathematics
%D 2010
%I arXiv
%R 10.1023/A:1010521410739
%X We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.
%U http://arxiv.org/abs/1012.0944v1