Skip to main content
Log in

The Category of Equivalence Relations

  • Published:
Algebra and Logic Aims and scope

We make some beginning observations about the category 𝔼q of equivalence relations on the set of natural numbers, where a morphism between two equivalence relations R and S is a mapping from the set of R-equivalence classes to that of S-equivalence classes, which is induced by a computable function. We also consider some full subcategories of 𝔼q, such as the category \( \mathbbm{E}\mathrm{q}\left({\Sigma}_1^0\right) \) of computably enumerable equivalence relations (called ceers), the category \( \mathbbm{E}\mathrm{q}\left({\Pi}_1^0\right) \) of co-computably enumerable equivalence relations, and the category 𝔼q(Dark*) 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 \( \mathbbm{E}\mathrm{q}\left({\Sigma}_1^0\right) \) the epimorphisms coincide with the onto morphisms, but in \( \mathbbm{E}\mathrm{q}\left({\Pi}_1^0\right) \) there are epimorphisms that are not onto. Moreover, 𝔼q, \( \mathbbm{E}\mathrm{q}\left({\Sigma}_1^0\right), \) and 𝔼q(Dark*) are closed under finite products, binary coproducts, and coequalizers, but we give an example of two morphisms in \( \mathbbm{E}\mathrm{q}\left({\Pi}_1^0\right) \) whose coequalizer in 𝔼q is not an object of \( \mathbbm{E}\mathrm{q}\left({\Pi}_1^0\right). \)

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Yu. L. Ershov, Theory of Numerations [in Russian], Nauka, Moscow (1977).

  2. S. Mac Lane, Categories for the Working Mathematician, Grad. Texts Math., 5, Springer, New York (1971).

  3. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).

    MATH  Google Scholar 

  4. Yu. L. Ershov, “Positive equivalences,” Algebra and Logic, 10, No. 6, 378-394 (1971).

    Article  MathSciNet  Google Scholar 

  5. U. Andrews, S. Badaev, and A. Sorbi, “A survey on universal computably enumerable equivalence relations,” in Lect. Notes Comput. Sci., 10010, Springer, Cham (2017), pp. 418-451.

  6. V. Yu. Shavrukov, “Remarks on uniformly finitely precomplete positive equivalences,” Math. Log. Q., 42, No. 1, 67-82 (1996).

    Article  MathSciNet  Google Scholar 

  7. U. Andrews and A. Sorbi, “Joins and meets in the structure of ceers,” Computability, 8, Nos. 3/4, 193-241 (2019).

    Article  MathSciNet  Google Scholar 

  8. C. Bernardi and A. Sorbi, “Classifying positive equivalence relations,” J. Symb. Log., 48, No. 3, 529-538 (1983).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. Delle Rose.

Additional information

Translated from Algebra i Logika, Vol. 60, No. 5, pp. 451-470, September-October, 2021. Russian DOI: https://doi.org/10.33048/alglog.2021.60.501.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rose, V.D., Mauro, L.S. & Sorbi, A. The Category of Equivalence Relations. Algebra Logic 60, 295–307 (2021). https://doi.org/10.1007/s10469-021-09656-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10469-021-09656-6

Keywords

Navigation