Lukas' Notes

Transitive Binary Relation

1 min read

Definition

Transitive Binary Relation

A binary relation $R \subseteq X \times X$ is transitive if
$\forall x \in X \forall y \in X \forall z \in X : x R y \land y R z ⟹ x R z .$

Backlinks

Class Diagram (UML)
Equivalence Relation
Hasse Diagram
Partial Order
Polynomial Time Reduction
Preference (COMSOC)
Preference Profile (COMSOC)
Preference Ranking (COMSOC)
Program Semantics
Strict Preference Ranking (COMSOC)
Subtype Relation
Transitivity (Border, String)

Created with Quartz v4.5.2 © 2026

GitHub