typos; closes #421

Author: rzach

content/computability/recursive-functions/pr-relations.tex

@@ -79,7 +79,7 @@
   \Char{Q}(\vec x)$ or as $\fn{min}(\Char{P}(\vec x), \Char{Q}(\vec
   x))$. Similarly, 
   \begin{align*}
-    \Char{P \lor Q}(\vec x) & = \fn{max}(\Char{P}(\vec x), \Char{Q}(\vec x))) \text{ and}\\
+    \Char{P \lor Q}(\vec x) & = \fn{max}(\Char{P}(\vec x), \Char{Q}(\vec x)) \text{ and}\\
     \Char{P \lif Q}(\vec x) & = \fn{max}(1 \tsub
   \Char{P}(\vec x), \Char{Q}(\vec x)).
   \end{align*}

content/first-order-logic/sequent-calculus/provability-quantifiers.tex

@@ -11,7 +11,7 @@
 
 \begin{explain}
   The completeness theorem also requires that the sequent calculus
-  rules rules yield the facts about~$\Proves$ established in this
+  rules yield the facts about~$\Proves$ established in this
   section.
 \end{explain}
 

content/model-theory/basics/partial-iso.tex

@@ -25,7 +25,7 @@ \section{Partial Isomorphisms}
     \in \Assign P N$;
   \item for every $n$-place !!{function} $f$: if $a_1$, \dots, $a_n$
     are in the domain of $p$, then $p(\Assign f M (a_1, \dots,a_n))
-    = \Assign f N (p(a_1), \ dots, p(a_n))$.
+    = \Assign f N (p(a_1), \dots, p(a_n))$.
   \end{enumerate}
   That $p$ is finite means that $\dom{p}$ is finite.
 \end{defn}