Skip to main content
  • 174 Accesses

Abstract

In this chapter, we will present some basic mathematical ideas about sets and relations. Some of the material on sets may be familiar to you already, in which case you may wish to scan over those sections fairly briefly. The main reason for introducing sets is to provide some useful terminology and notation for the work that follows; we will not be studying the mathematical theory of sets as such. Relations arise in computing in the area of relational databases, and we will also need them in Chapter 12 when we study congruences.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Copyright information

© 1995 Peter Grossman

About this chapter

Cite this chapter

Grossman, P. (1995). Sets and Relations. In: Discrete Mathematics for Computing. Palgrave, London. https://doi.org/10.1007/978-1-349-13908-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-349-13908-8_5

  • Publisher Name: Palgrave, London

  • Print ISBN: 978-0-333-64694-6

  • Online ISBN: 978-1-349-13908-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics