Skip to main content

Collecting Things Together: Sets

  • Chapter
  • First Online:
Sets, Logic and Maths for Computing

Part of the book series: Undergraduate Topics in Computer Science ((UTICS))

Abstract

In this chapter, we introduce the student to the world of sets. Actually, only a little bit of it, the part that is needed to get going.

After giving a rough intuitive idea of what sets are, we present the basic relations between them: inclusion, identity, proper inclusion and exclusion. We describe two common ways of identifying sets and pause to look more closely at the empty set. We then define some basic operations for forming new sets out of old ones: intersection, union, difference and complement. These are often called Boolean operations, after George Boole, who first studied them systematically in the middle of the nineteenth century.

Up to this point, the material is all ‘flat’ set theory, in the sense that it does not look at what we can do when the elements of sets are themselves sets. However, we need to go a little beyond flatland. In particular, we need to generalize the notions of intersection and union to cover arbitrary collections of sets and introduce the very important concept of the power set of a set, that is, the set of all its subsets.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 29.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Selected Reading

  • For a very gentle introduction to sets, which nevertheless takes the reader up to an outline of the Zermelo-Fraenkel axioms for set theory, see:

    Google Scholar 

  • Bloch ED (2011) Proofs and fundamentals: a first course in abstract mathematics, 2nd edn. Springer, New York, chapter 3

    Google Scholar 

  • A classic of beautiful exposition, but short on exercises (readers should instead verify the claims made in the text):

    Google Scholar 

  • Halmos PR (2001) Naive set theory, new edn. Springer, New York, chapters 1–5, 9

    Google Scholar 

  • The present material is covered with lots of exercises in:

    Google Scholar 

  • Lipschutz S (1998) Set theory and related topics, Schaum’s outline series. McGraw Hill, New York, chapters 1–2 and 5.1–5.3

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to David Makinson .

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag London Limited

About this chapter

Cite this chapter

Makinson, D. (2012). Collecting Things Together: Sets. In: Sets, Logic and Maths for Computing. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-2500-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-2500-6_1

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-2499-3

  • Online ISBN: 978-1-4471-2500-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics