Abstract
The notion of relations is extremely general and allows for various concepts to be represented. Despite the desirability of having a very abstract notion which is applicable for different concrete systems, more specific notions have the advantage that more properties can be proved about them. This chapter looks at particular classes of relations, enabling the identification and proofs of interesting laws which particular classes of relations satisfy. For instance, one particular class of relations corresponds to the notion of mathematical functions. By focussing only on this class of relations, we can prove results about functions, not all of which may hold for an arbitrary relation. Other classes identified are those of injective, surjective and total relations, applications of which are used in the rest of the book.
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 subscriptionsAuthor information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Pace, G.J. (2012). Classifying Relations. In: Mathematics of Discrete Structures for Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29840-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-29840-0_6
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)