A note on the category of equivalence relations
Valentino Delle Rose, Luca San Mauro, Andrea Sorbi

TL;DR
This paper explores the categorical properties of equivalence relations on natural numbers, focusing on subcategories defined by computability conditions and analyzing morphism properties and limits within these categories.
Contribution
It introduces and studies the structure of various categories of equivalence relations, highlighting differences in morphism properties and categorical limits among them.
Findings
In $ ext{Eq}( ext{Σ}^0_1)$, epimorphisms are exactly onto morphisms.
In $ ext{Eq}( ext{Π}^0_1)$, some epimorphisms are not onto.
Certain categories are closed under finite limits and colimits, but coequalizers may leave the subcategory.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Advanced Topology and Set Theory · semigroups and automata theory
