Abstract
In this chapter we introduce relations on a set. For that purpose we first recall some well-known facts from set theory and explain our notation. A set M is a collection of well-defined objects called its elements. We write x ∈ X if x is an element of the set X. The symbol ∅ denotes the empty set. The set of all elements which have the property E is written as M = x ∣ E(x) .The power set of a set X is denoted by 2X; so M is an element of 2X if and only if M is a subset of X.
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
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schmidt, G., Ströhlein, T. (1993). Sets. In: Relations and Graphs. EATCS Monographs on Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77968-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-77968-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-77970-1
Online ISBN: 978-3-642-77968-8
eBook Packages: Springer Book Archive