Abstract
If A and B are sets, it is sometimes natural to wish to unite their elements into one comprehensive set. One way of describing such a comprehensive set is to require it to contain all the elements that belong to at least one of the two members of the pair {A, B}. This formulation suggests a sweeping generalization of itself; surely a similar construction should apply to arbitrary collections of sets and not just to pairs of them. What is wanted, in other words, is the following principle of set construction.
This is a preview of subscription content, log in via an institution to check access.
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). Unions and Intersections. In: Naive Set Theory. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-1645-0_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-1645-0_4
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