diff --git a/content/incompleteness/theories-computability/first-incompleteness.tex b/content/incompleteness/theories-computability/first-incompleteness.tex index b9e779ea..29c31fae 100644 --- a/content/incompleteness/theories-computability/first-incompleteness.tex +++ b/content/incompleteness/theories-computability/first-incompleteness.tex @@ -19,7 +19,7 @@ \begin{proof} We already know that there is no consistent, decidable extension of -$\Th{Q}$. But if $\Th{T}$ is complete and !!{axiomatized}, then +$\Th{Q}$. But if $\Th{T}$ is complete and !!{axiomatizable}, then it is decidable. \end{proof}