Computably Enumerable Equivalence Relations

Abstract

We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.