From 00a42f77dfea8fbd16760fbce7ebec2e5c29c60d Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:44 +0100 Subject: [PATCH] first-incompleteness.tex: complete and axiomatizable (not merely axiomatized) implies decidable Every theory is axiomatized by itself; true arithmetic is complete and undecidable. The theorem says axiomatizable. Ledger: BN-SRC-240, OLP-SRC-0365, OLTETCP-001 Co-Authored-By: Claude Opus 5.5 --- .../theories-computability/first-incompleteness.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) 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}