Change the symbol used for the conjunction of the axioms of Q from

!O to !T so that when `\olgreekformulas` is in used, !O does not
render as `\omega`, which is confusing in the context of logic.

Author: beastaugh

content/incompleteness/representability-in-q/undecidability.tex

@@ -67,8 +67,8 @@
 
 \begin{proof}
 If first-order logic were decidable, provability in~$\Th{Q}$ would be
-as well, since $\Th{Q} \Proves !A$ iff $\Proves !O \lif !A$, where
-$!O$ is the conjunction of the axioms of~$\Th{Q}$.
+as well, since $\Th{Q} \Proves !A$ iff $\Proves !T \lif !A$, where
+$!T$ is the conjunction of the axioms of~$\Th{Q}$.
 \end{proof}
 
 \end{document}