(definition)
Definition: A binary relation R for which a R a for all a.
See also symmetric, transitive, irreflexive.
Note: The relation "equals" is reflexive since everything is equal to itself. However the relation "less than" is not reflexive. The relation "likes" is not reflexive either since some people do not like themselves.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:07:12 2004.
HTML page formatted Wed Oct 26 09:48:04 2005.
Cite this as:
Paul E. Black, "reflexive", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/reflexive.html
