Abstract
One result of our study of the comparative sizes of sets will be to define a new concept, called cardinal number, and to associate with each set X a cardinal number, denoted by card X. The definitions are such that for each cardinal number a there exist sets A with card A = a. We shall also define an ordering for cardinal numbers, denoted as usual by ≦. The connection between these new concepts and the ones already at our disposal is easy to describe: it will turn out that card X = card Y if and only if X ~ Y, and card X < card Y if and only if X ≺ Y. (If a and b are cardinal numbers, a < b means, of course, that a ≦ b but a ≠ b.)
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1974 Springer Science+Business Media New York
About this chapter
Cite this chapter
Halmos, P.R. (1974). Cardinal Arithmetic. In: Naive Set Theory. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-1645-0_24
Download citation
DOI: https://doi.org/10.1007/978-1-4757-1645-0_24
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-90104-6
Online ISBN: 978-1-4757-1645-0
eBook Packages: Springer Book Archive