Abstract
Let A denote a finite set of elements a, b, c, ... A binary relation S on the set A is a subset of the cartesian product A × A, that is, a set of ordered pairs (a,b) such that a and b are in A: S ⊂ A × A. If the ordered pair (a,b) belongs to S, we denote indifferently (a,b) ∈ S or a S b.
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.
References
Monjardet B., Axiomatiques et propriétés des quasi-ordres, Math. Sci. Humaines, 63 (1978) 51–82.
Roberts F.S., Measurement Theory, Addison-Wesley, Reading, Massachusetts, 1979.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Roubens, M., Vincke, P. (1985). Binary Relations: Definitions, Representations, Basic Properties. In: Preference Modelling. Lecture Notes in Economics and Mathematical Systems, vol 250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46550-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-46550-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15685-7
Online ISBN: 978-3-642-46550-5
eBook Packages: Springer Book Archive