Skip to main content

Cardinalities and Diagonalization

  • Chapter
Computation Engineering
  • 1003 Accesses

Chapter Summary

This chapter introduced the concept of cardinality and illustrated how various infinite sets might have incomparable cardinalities. The main technique for demonstrating that two sets have different cardinalities is a proof technique by contradiction known as diagonalization. A useful theorem for showing that two sets have the same cardinality is the Schröder-Bernstein theorem. A thorough description of these concepts in this early of a chapter has been found to be helpful to many students when they study later chapters of this book.

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 124.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 124.00
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.

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media LLC

About this chapter

Cite this chapter

(2006). Cardinalities and Diagonalization. In: Computation Engineering. Springer, Boston, MA. https://doi.org/10.1007/0-387-32520-4_3

Download citation

  • DOI: https://doi.org/10.1007/0-387-32520-4_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-24418-1

  • Online ISBN: 978-0-387-32520-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics