Skip to main content

Some operations on the family of equivalence relations

  • Chapter
Algebraic Combinatorics and Computer Science

Abstract

Throughout the history of mathematics, the notion of an equivalence relation has played a fundamental role. It dates back at least to the time when the natural numbers first were introduced: a non-negative integer may be thought of as a representative of the equivalence class of sets with the same cardinality. To express such a simple and “obvious” fact with equivalence relations may seem unnecessarily cumbersome. Nothing is further from the truth. Equivalence relations play a decisive role as building elements in every area of mathematics. For instance, algebra is firmly founded on equivalence relations: groups theory, rings theory, modules and fields would basically be impossible to define and use without equivalence relations.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Birkhoff, G. (1967): Lattice theory. 3rd ed. (AMS Colloqium Publications, vol. 25). American Mathematical Society, Providence, RI

    MATH  Google Scholar 

  2. Dubreil, P. (1950): Relations binaires et applications. C. R. Acad. Sci. Paris 230, 1028–1030

    MathSciNet  MATH  Google Scholar 

  3. Dubreil, P., Dubreil-Jacotin, M.-L. (1939): Théorie algébrique des relations d’équivalence. J. Math. Pures Appl. (9) 18, 63–95

    MATH  Google Scholar 

  4. Finberg, D., Mainetti, M., Rota, G.-C. (1996): The logic of commuting equivalence relations. In: Ursini, A., Aglianò, P. (eds.) Logic and algebra (Pontignano, 1994). (Lecture Notes in Pure and Appl. Math. vol. 180). Dekker, New York, pp. 69–96

    Google Scholar 

  5. Grätzer, G. (1978): General lattice theory. Birkhäuser, Basel

    Book  Google Scholar 

  6. Haiman, M. (1984): The theory of linear lattices. Ph.D. thesis, Massachusetts Institute of Technology

    Google Scholar 

  7. Hutchinson, G. (1973): Recursively unsolvable word problems of modular lattices and diagram-chasing. J. Algebra 26, 385–399

    Article  MathSciNet  MATH  Google Scholar 

  8. Jónsson, B. (1953): On the representation of lattices. Math. Scand. 1, 193–206

    MathSciNet  MATH  Google Scholar 

  9. Ore, Ø. (1942): Theory of equivalence relations. Duke Math. J. 9, 573–627

    Article  MathSciNet  MATH  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Italia

About this chapter

Cite this chapter

Britz, T., Mainetti, M., Pezzoli, L. (2001). Some operations on the family of equivalence relations. In: Crapo, H., Senato, D. (eds) Algebraic Combinatorics and Computer Science. Springer, Milano. https://doi.org/10.1007/978-88-470-2107-5_18

Download citation

  • DOI: https://doi.org/10.1007/978-88-470-2107-5_18

  • Publisher Name: Springer, Milano

  • Print ISBN: 978-88-470-2159-4

  • Online ISBN: 978-88-470-2107-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics