paper

A note on the category of equivalence relations

arXiv:2105.09604

Abstract

We make some beginning observations about the category of equivalence relations on the set of natural numbers, where a morphism between two equivalence relations is a mapping from the set of -equivalence classes to that of -equivalence classes, which is induced by a computable function. We also consider some full subcategories of , such as the category of computably enumerable equivalence relations (called ceers), the category of co-computably enumerable equivalence relations, and the category whose objects are the so-called dark ceers plus the ceers with finitely many equivalence classes. Although in all these categories the monomorphisms coincide with the injective morphisms, we show that in the epimorphisms coincide with the onto morphisms, but in there are epimorphisms that are not onto. Moreover, , , and are closed under finite products, binary coproducts, and coequalizers, but we give an example of two morphisms in whose coequalizer in is not an object of .

14 pages, forthcoming in Algebra and Logic