diff --git a/docs/algebra.tex b/docs/algebra.tex
index 13822e76d7eab4bc107f8de0fd6de28e702603dc..f9ee23ccda21a67cf0f2970cd96a00cc430d56f0 100644
--- a/docs/algebra.tex
+++ b/docs/algebra.tex
@@ -36,7 +36,7 @@
 
 \ralf{Copy the rest of the explanation from the paper, when that one is more polished.}
 
-\paragraph{The division operation $\mdiv$.}
+\paragraph{The division operator $\mdiv$.}
 One way to describe $\mdiv$ is to say that it extracts the witness from the extension order: If $\melt \leq \meltB$, then $\melt \mdiv \meltB$ computes the difference between the two elements (\ruleref{cmra-div-op}).
 Otherwise, $\mdiv$ can have arbitrary behavior.
 This means that, in classical logic, the division operator can be defined for any PCM using the axiom of choice, and it will trivially satisfy \ruleref{cmra-div-op}.