Reflexivity
From HandWiki
A property of binary relations. A binary relation $R$ on a set $A$ is called reflexive if $aRa$ for all $a\in A$. Regarding $R$ as a subset of $A \times A$, $R$ is reflexive if it contains the diagonal or identity relation $\Delta = \{(a,a) : a \in A \}$. Examples of reflexive relations are equality (cf Equality axioms), equivalence relations, order.
References
| [a1] | R. Fraïssé, Theory of Relations, Studies in Logic and the Foundations of Mathematics, Elsevier (2011) ISBN 0080960413 |
| [a2] | P. R. Halmos, Naive Set Theory, Springer (1960, repr. 1974) ISBN 0-387-90092-6 Template:ZBL |
