diff --git a/thesis.tex b/thesis.tex
index 0cc5fd0..294dfab 100644
--- a/thesis.tex
+++ b/thesis.tex
@@ -332,8 +332,10 @@ $R^n$, is defined inductively.
   R^0 \defas \emptyset, \quad\qquad R^1 \defas R, \quad\qquad R^{1 + n} \defas R \circ R^n.
 \]
 %
-Reflexive and transitive relations and their closures feature
-prominently in the dynamic semantics of programming languages.
+Homogeneous relations play a prominent role in the design and
+operational understanding of programming languages. There are two
+particular properties and associated closure operations of homogeneous
+relations that reoccur throughout this dissertation.
 %
 \begin{definition}
   A homogeneous relation $R \subseteq A \times A$ is said to be