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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights 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)