 Proof sketch of Gödel’s first incompleteness theorem. Assume first-order arithmetic is both \(\omega\)-consistent and complete. We need to show that this leads to a contradiction. Gödel constructs a formula Bew (for “Beweis”) in formal arithmetic satisfying, for all \(\phi\) and all \(n\),