Fix typo

Signed-off-by: zeramorphic <[email protected]>

iii/forcing/02_constructibility.tex

@@ -196,10 +196,10 @@ \subsection{G\"odel functions}
         \end{align*}
     \end{itemize}
 
-    \emph{Part (ii): propositional connectives}
+    \emph{Part (ii): propositional connectives.}
     \begin{itemize}
         \item If \( \varphi \) is a termed formula, then so is \( \neg\varphi \).
-        \[ \mathcal F_{\neg\varphi}(a_1, \dots, a_n) &= (a_n \times \dots \times a_1) \setminus \mathcal F_\varphi(a_1, \dots, a_n) \]
+        \[ \mathcal F_{\neg\varphi}(a_1, \dots, a_n) = (a_n \times \dots \times a_1) \setminus \mathcal F_\varphi(a_1, \dots, a_n) \]
         \item If \( \varphi, \psi \) are termed formulas, then so is \( \varphi \vee \psi \).
         \[ \mathcal F_{\varphi \vee \psi}(a_1, \dots, a_n) = \mathcal F_\varphi(a_1, \dots, a_n) \cup \mathcal F_\psi(a_1, \dots, a_n) \]
         It is easy to see that unions can be formed using G\"odel functions.