Abstract
A frequently recurring notion in computing is that of relating objects to each other. For instance, one may want to model file access control in an operating system, in which one relates a user with the files he or she has access to. This chapter shows how relations can be expressed in terms of structured sets, using Cartesian product. Through the definition and use of relational operators, relations can be constructed in terms of simpler ones, and thanks to the formal definitions properties of these operators and their practical applications can be mathematically proved.
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
Notes
- 1.
Note that we are writing n<m as shorthand for (n,m)∈<. Similarly for >.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Pace, G.J. (2012). Relations. In: Mathematics of Discrete Structures for Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29840-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-29840-0_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29839-4
Online ISBN: 978-3-642-29840-0
eBook Packages: Computer ScienceComputer Science (R0)