Abbreviation: RefRel
A \emph{reflexive relation} is a structure X=⟨X,R⟩ such that R is a \emph{binary relation on X} (i.e. R⊆X×X) that is
reflexive: xRx
Let X and Y be reflexive relations. A morphism from X to Y is a function h:A→B that is a homomorphism: xRXy⟹h(x)RYh(y)
Example 1:
Feel free to add or delete properties from this list. The list below may contain properties that are not relevant to the class that is being described.
$\begin{array}{lr}
f(1)= &1\\ f(2)= &\\ f(3)= &\\ f(4)= &\\ f(5)= &\\
\end{array}\begin{array}{lr}
f(6)= &\\ f(7)= &\\ f(8)= &\\ f(9)= &\\ f(10)= &\\
\end{array}$
Directed graphs supervariety