diff --git a/2022Migration/articleMigrationFACS.tex b/2022Migration/articleMigrationFACS.tex
index d50d939..2c5c3a4 100644
--- a/2022Migration/articleMigrationFACS.tex
+++ b/2022Migration/articleMigrationFACS.tex
@@ -452,7 +452,7 @@ \subsection{Schemas}
    in which $\concepts\subseteq \Concepts$ is a finite set of concepts,
    $\rels\subseteq \Rels$ is a finite set of relations,
    $\rules\subseteq {\Dataset \to \powerset{\Pair{\Atoms}{\Atoms}}}$ is a finite set of rules,
-   and $\enforces\subseteq \Pair{\Rels}{\left(\Dataset \to \powerset{\Pair{\Atoms}{\Atoms}}\right)}$ is a finite set of enforce rules.
+   and $\enforces\subseteq \Pair{\Rels}{\left(\Dataset \to \powerset{\Pair{\Atoms}{\Atoms}}\right)}$ is a finite set of enforcement rules.
    
    Each rule in a schema serves to constrain the data set at runtime, to ensure its semantic integrity.
    Every rule is an element of an infinite set called $\Rules$.