Abstract
We define set theory as an extension of predicate calculus. A set is simply a collection of distinct (different) elements. Examples of sets are the set of integers, the set of brown cows, and the set of computer science departments. A cornerstone of mathematics, the set is also an essential ingredient of computer science and finds application in areas such as artificial intelligence, databases, and programming languages. The study of sets leads to questions about the existence of many kinds of infinities. Thus, while appearing simple, set theory is a rich intellectual playground.
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
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gries, D., Schneider, F.B. (1993). A Theory of Sets. In: A Logical Approach to Discrete Math. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3837-7_12
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3837-7_12
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2835-1
Online ISBN: 978-1-4757-3837-7
eBook Packages: Springer Book Archive