Computably Enumerable Equivalence Relations
arXiv:1012.0944 · doi:10.1023/A:1010521410739
Abstract
We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.