Co-computably enumerable equivalence relation
= Co-computably enumerable equivalence relation
An <equivalence relation> on the <natural numbers> is co-computably enumerable when its <complement> as a set of pairs is <computably enumerable>. Inequivalence can then be positively recognized, even when equivalence cannot be decided. This is sufficient for a <semidecidable least-representative transversal>.