Abstract
There are two main languages in which theoretical computer science is expressed — the language of sets and the language of numbers. The principal aim of this chapter is to set forth the basic concepts of set theory. Section 1.1 introduces sets and subsets, and shows how to build up new sets from old ones by such operations as the Cartesian product, union, intersection, and set differences. Section 1.2 briefly summarizes fundamental facts about exponents, logarithms, and finite series. Section 1.3 introduces the basic notions of maps or functions, partial functions, and relations. The way in which computer programs transform input data provides examples of partial functions. Finding relations between items stored in a data base is an important task for computer science.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Arbib, M.A., Kfoury, A.J., Moll, R.N. (1981). Sets, Maps, and Relations. In: A Basis for Theoretical Computer Science. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9455-6_1
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9455-6_1
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-9457-0
Online ISBN: 978-1-4613-9455-6
eBook Packages: Springer Book Archive