Gui Ruiyan

Kurt Gödel · 库尔特·哥德尔
Gödel’s Incompleteness Theorems · 哥德尔不完备性定理

Study journals ·

Gödel's Incompleteness — Chapter V, Part I: the abstract incompleteness theorems and Exercises 1–7

Reflections · Study sessions

AI-prepared recaps of study sessions; these are working notes, not verbatim transcripts. / AI 整理的学习记录,并非逐字实录。

Reading / 研读:Raymond Smullyan / 雷蒙德·斯穆里安 · Gödel’s Incompleteness Theorems 哥德尔不完备性定理

In this note / 篇目

Study session of July 30, 2026 · Smullyan, "Gödel's Incompleteness Theorems," Chapter V ("Gödel's Proof Based on ω-Consistency"), Part I "Some Abstract Incompleteness Theorems," book pp. 58–65 · Companion to July 15–29 · Character: a working session — the full arc from the diagonal lemma to the pinnacle Theorem A and its self-strengthening Theorem A* mapped as a pipeline, then Exercises 1–7 worked as justified chains, then five conceptual deep-dives (the A/A* "last step", inconsistency-vs-contradiction, self-vs-cross representation, decidability's role, enumeration≠representation). Two tutor errors were caught mid-session against the book's exact wording of Ex 5 and Ex 6; the versions recorded here are the corrected ones.**

Cross-references are clickable: citations like L1a, Lemma ω, Thm 1, Ex 5 jump to the definition or result being invoked.


How this document is organized

Part I is the glossary — every definition, plus the diagonal Lemma 1, as link targets. Part II is the arc: the pipeline of abstract theorems climbing to Theorem A/A* (task 1 of the session). Part III works Exercises 1–7 as chains, each with its start (hypotheses) and finish (conclusion) matched to the book, citing only owned labels. Part IV is Exercise 7 in depth — the A-versus-A* "last step" that opened the session. Part V collects the five conceptual deep-dives. Part VI records the two corrections made mid-session (errors on file). Part VII is the Distinctions Ledger, VIII the Self-Test, IX the position and debts.

Notation: plain Unicode. n̄ = the numeral naming n. S⊢X = "X provable in S". Everything is relative to a system S unless subscripted otherwise.


Part I — Glossary (definitions + the diagonal lemma)

  • Σ₀ = bounded quantifiers only (decidable; a true/false Σ₀-sentence is recognizably so). Carried from July 29.
  • Σ₁ = ∃y(Σ₀ body).
  • P* = { n : Eₙ(n̄) is provable in S } — the diagonal provability set (Eₙ = the formula, one free variable, with Gödel number n).
  • R* = { n : Eₙ(n̄) is refutable in S } — the diagonal refutability set.
  • represents (a set/relation in S): F(v₁) represents A iff for all n, S⊢F(n̄) ⟺ n∈A. A provability notion.
  • expresses (a set in the standard model): F(v₁) expresses A iff for all n, F(n̄) true ⟺ n∈A. A truth notion. (Ch. II; contrast with represents.)
  • enumerates: F(v₁,v₂) enumerates A iff (clause 1) n∈A ⇒ for some m, S⊢F(n̄,m̄); (clause 2) n∉A ⇒ for every m, F(n̄,m̄) is refutable in S.
  • axiomatizable (= formal = r.e.): the provable-formula codes form a Σ₁ set. Then P* is Σ₁ (last chapter: A Σ₁ ⇒ A* Σ₁).
  • simply consistent: no sentence with both itself and its negation provable.
  • ω-consistent: no F(v₁) with S⊢∃v₁F(v₁) yet every F(n̄) refutable. (ω-consistent ⟹ simply consistent, July 29.)
  • correct: every provable sentence is true (Ch. IV's hypothesis; S ⊆ N).

Lemma 1 — the diagonal bookkeeping (pure; no consistency assumed)

For any formula H(v₁) with Gödel number h:

  • (L1a) S⊢H(h̄) ⟺ h∈P*.
  • (L1b) H(h̄) refutable in S ⟺ h∈R*.

Ground: H(h̄) and H[h] = E_h[h] are provably equivalent (first-order logic with identity, inside S), and h∈P* means exactly S⊢E_h(h̄). This one lemma drives every theorem below.


Part II — The arc: from the diagonal lemma to Theorem A(*)

The chapter's goal chain.

Theorem G  ⟸  Theorem A  +  Theorem B  +  "P.A. axiomatizable"
Theorem A  ← Part I (this session)
Theorem B  ← Part II (next: Σ₀-completeness)

Part I's whole job is Theorem A, reached by steadily more concrete abstract theorems. The skeleton, each step naming what it adds:

Step 1 — Theorem 1: what makes a system incomplete at all. If the negation of H represents P*, then H(h̄) refutable ⟺ h∈P*; (L1a) gives H(h̄) provable ⟺ h∈P*. So provable ⟺ refutable — impossible under simple consistency unless neither holds. The sentence falls into the gap. Yields the Corollary (P* representable ⇒ incomplete) and its dual Theorem 1′.

Step 2 — the obstacle. Theorem 1 needs P* representable — a hard, provability-side condition. What comes cheaply is the weaker enumerable. We need a bridge.

Step 3 — Lemma ω: the bridge, and where ω-consistency enters the whole edifice. ω-consistency upgrades enumerable → representable. The n∉A direction is the crux: then every F(n̄,m̄) is refutable, so if ∃v₂F(n̄,v₂) were also provable, S would be ω-inconsistent. This is a one-directional, gated implication, not an equivalence (see Part V.5).

Step 4 — Theorem 2. Combine 1+3: P* or R* enumerable + ω-consistent ⟹ incomplete.

Step 5 — Theorem 3: the two-strength split (Gödel's actual sentence). With A enumerating P*, ∀v₂~A(v₁,v₂) is a formula whose negation represents P*; its diagonal is G = ∀v₂~A(h̄,v₂). The payoff is the asymmetry: (1) G unprovable needs only simple consistency; (2) G unrefutable needs ω-consistency. Half the theorem is cheap — this is what later lets Rosser drop to simple consistency.

Step 6 — feed Σ₀ in, get Theorem A. axiomatizable ⇒ P* is Σ₁; Ex 5 (all true Σ₀ provable ⇒ Σ₁ enumerable, then Lemma ω) ⇒ P* representable; Theorem 3 ⇒ undecidable G. ∎

Step 7 — the self-strengthening Theorem A*. Its hypothesis "no false Σ₀ provable" is strictly weaker than "all true Σ₀ provable" (given consistency, the latter implies the former). Proved directly by Ex 7; Theorem A then falls out as a corollary. See Part IV.

One-line map: representability is what Theorem 1 needs; enumerability is what you can get; ω-consistency (Lemma ω) is the toll that converts one into the other; Σ₀-provability (Ex 5) is what makes the axiomatizable P* enumerable in the first place.


Part III — Exercises 1–7 as chains

Each starts and finishes as the book states it (Ex 5, 6 verbatim from the p. 62 crop; the rest from pp. 60–65).

Exercise 1 — direct undecidability (no double-negation)

Start: S consistent; H(v₁) represents P*; h = Gödel number of ~H(v₁). Finish: H(h̄) undecidable.

  • (L1a) applied to the formula ~H(v₁) (own Gödel number h): S⊢~H(h̄) ⟺ h∈P*, i.e. H(h̄) refutable ⟺ h∈P*.
  • represents at n=h: S⊢H(h̄) ⟺ h∈P*.

So H(h̄) provable ⟺ refutable ⟺ h∈P*. If h∈P*, both hold — barred by consistency. Hence h∉P*, both fail, undecidable. ∎ (No double-negation law — the advantage over the Theorem 1 route.)

Exercise 2 — P̃* is never representable (consistency irrelevant)

Start: F(v₁) represents P̃* (complement of P*), any S. Finish: impossible.

Let f = Gödel number of F. (L1a): S⊢F(f̄) ⟺ f∈P*. represents P̃*: S⊢F(f̄) ⟺ f∉P*. Chain: f∈P* ⟺ f∉P* — a metatheoretic contradiction. No consistency consumed (both sides are provability biconditionals). ∎ Answers the Question after Theorem 1: a formula that represents P* (rather than one whose negation does) yields only (L1a) twice — a tautology; forcing a contradiction would need P̃* representable, which is exactly this impossibility. Deeper reading: Part V.1.

Exercise 3 — P̃* representable in a consistent extension ⇒ S incomplete

Start: P̃* of S represented in a consistent S′ ⊇ S. Finish: S incomplete.

Contrapositive: assume S complete (consistent, inside consistent S′). Then S and S′ prove the same sentences: S⊢X ⇒ S′⊢X; and S′⊢X ⇒ S⊢X (else completeness gives S⊢~X, so S′⊢~X alongside S′⊢X — S′ inconsistent). Representation depends only on which F(n̄) are provable, so "represents P̃* in S′" = "in S" — contradicting Ex 2. Hence S incomplete. ∎ Relation: the robust form of Ex 2/the Corollary. Index-tracking subtlety: Part V.2.

Exercise 4 — truth values in a correct system (S ⊆ N)

h = Gödel number of H(v₁); correct ⟹ consistent.

  • (1) ~H represents P*. As in Ex 1: h∉P*, so H(h̄) unprovable. H(h̄) is the fixed point asserting h∉P* = its own unprovability, which is correct ⟹ H(h̄) true.
  • (2) H represents and expresses R*. (L1a)+represents: S⊢H(h̄) ⟺ h∈P* ⟺ h∈R*; (L1b): refutable ⟺ h∈R*. Consistency ⟹ h∉R* ⟹ undecidable. expresses R*: H(h̄) true ⟺ h∈R*; h∉R* ⟹ H(h̄) false.

(Contrast: (1) pins truth via correctness on the unprovability fixed point; (2) via explicit expression — opposite value.)

★ Exercise 5 — all true Σ₀ provable and ω-consistent ⇒ every Σ₁-set representable ★

The load-bearing lemma for Theorem A. (Book verbatim: "if all true Σ₀-sentences are provable in S and S is ω-consistent, then all Σ₁-sets are representable in S." The conclusion is representability, and ω-consistency is a hypothesis — the whole point.)

Start: (P) all true Σ₀ provable; (ω) S ω-consistent. Finish: every Σ₁-set representable.

Let A be Σ₁: A = {n : ∃m R(n,m)}, R a Σ₀-relation; A(v₁,v₂) a Σ₀-formula expressing R.

  • Step 1 — enumerate (spends P).
  • n∈A ⇒ some R(n,m) ⇒ A(n̄,m̄) true Σ₀ ⇒ (P) provable. → enum clause 1.
  • n∉A ⇒ every R(n,m) false ⇒ every ~A(n̄,m̄) true Σ₀ ⇒ (P) provable ⇒ every A(n̄,m̄) refutable. → enum clause 2.
  • Step 2 — represent (spends ω). By Lemma ω, ∃v₂A(v₁,v₂) represents A. ∎

Why it's the crux. axiomatizable ⇒ P* is Σ₁; this exercise then makes P* representable, feeding Theorem 3. Both hypotheses are load-bearing in different steps — P buys enumeration, ω buys the lift (Lemma ω). Hypothesis P is exactly what Theorem B supplies for P.A.

Exercise 6 — the abstract mechanism behind Ex 5

(Book verbatim: "Suppose F(v₁,v₂) represents in S the same relation that it expresses and for all n,m the sentence F(n̄,m̄) is either provable or refutable. Prove that if S is ω-consistent, then ∃v₂F(v₁,v₂) represents in S the same set that it expresses.")

Start: (a) for all n,m: S⊢F(n̄,m̄) ⟺ F(n̄,m̄) true (represents = expresses, on the relation); (b) every F(n̄,m̄) decidable; (c) S ω-consistent. Finish: ∃v₂F represents the set it expresses.

Let A = {n : ∃m F(n̄,m̄) true} = set expressed by ∃v₂F.

  • Step 1 — F enumerates A.
  • n∈A ⇒ some F(n̄,m̄) true ⇒ (a) some S⊢F(n̄,m̄). → clause 1.
  • n∉A ⇒ every F(n̄,m̄) false ⇒ (a) every not provable ⇒ (b) every refutable. → clause 2.
  • Step 2 — Lemma ω (spends c). ∃v₂F represents A. ∎

Where each hypothesis goes: (a) both clauses (the true⟺provable bridge); (b) only clause 2, converting unprovable → refutable — its sole job; (c) the Lemma ω lift. Ex 6 = Ex 5 in the abstract: same two-step shape, "represents=expresses on instances" abstracting "all true Σ₀ provable," decidability abstracting Σ₀-decidability.

Exercise 7 — the self-strengthening (worked in full in Part IV)

Start: S axiomatizable; A(v₁,v₂) enumerates P* and expresses a Σ₀-relation R; h = Gödel number of ∀v₂~A(v₁,v₂); G := ∀v₂~A(h̄,v₂). Finish: (1) G provable ⇒ some false Σ₀ provable; (2) G refutable + ω-consistent ⇒ some true Σ₀ not provable; (3) Theorem A follows.

Anchor via (L1a): S⊢G ⟺ h∈P* ⟺ ∃y R(h,y) true. Full derivation and the A/A* resolution: Part IV.


Part IV — Exercise 7 in depth: the A-versus-A* "last step"

The session opened here. The confusion: the printed Solution, step 3 begins "Suppose now all true Σ₀-sentences are provable in S" — which is Theorem A's hypothesis, not A*'s. Resolution below.

(1) G provable ⇒ a false Σ₀ provable. S⊢G ⇒ h∈P* ⇒ some n with R(h,n) true ⇒ A(h̄,n̄) a true Σ₀ ⇒ ~A(h̄,n̄) false. But G=∀v₂~A(h̄,v₂) provable ⇒ instance ~A(h̄,n̄) provable. A false Σ₀ is provable. ∎ (Uses expression + anchor only — no provability hypothesis.)

(2) G refutable + ω-consistent ⇒ a true Σ₀ unprovable. G refutable ⇒ ~G = ∃v₂A(h̄,v₂) provable. Also G refutable + simple consistency ⇒ G unprovable ⇒ h∉P* ⇒ every R(h,n) false ⇒ every ~A(h̄,n̄) a true Σ₀. ω-consistency on the provable ∃v₂A(h̄,v₂): not all A(h̄,n̄) refutable ⇒ some A(h̄,n̄) not refutable ⇒ that ~A(h̄,n̄) not provable — a true Σ₀, unprovable. ∎

(3) as printed = Theorem A (the corollary). Assume all true Σ₀ provable + ω-consistent:

step move ground
all true Σ₀ provable ⇒ no false Σ₀ provable a false Σ₀ has a true Σ₀ negation, provable; consistency bars both simple consistency
⇒ G not provable contrapositive of (1) Ex 7(1)
all true Σ₀ provable ⇒ (G refutable ⇒ ω-inconsistent) contrapositive of (2) Ex 7(2)

With ω-consistency: G not provable and not refutable ⟹ undecidable ⟹ Theorem A. ∎

Why this is not A*, and where A* actually lives. The printed step 3 assumes the strong hypothesis, so it proves A; the surrounding prose ("A* directly, A as corollary") is carried by parts (1)+(2) themselves:

  • (1) is the A*-native step: "no false Σ₀ provable" ⇒ G unprovable, directly.
  • The refutable branch is where A and A* diverge:
  • A (strong hyp.): (2)'s conclusion "some true Σ₀ unprovable" is impossible, so the branch is excluded and the witness stays G.
  • A* (weak hyp.): (2) hands you a true Σ₀ sentence Y unprovable; then ~Y is a false Σ₀, so A*'s hypothesis makes ~Y unprovable too — Y is the undecidable witness.

The exact trap: step 3's phrase "some true Σ₀ is not provable" (from (2)) is the negation of A's hypothesis derived as an output, not A's hypothesis assumed as input. The word "provable" appears; the polarity is reversed. Under A* that unprovable Y, paired with its unprovable false negation, is the incompleteness — so the proof is genuinely direct and "more informative": under A*'s hypotheses, either G is undecidable or some Σ₀-sentence is, with a concrete witness in every case.


Part V — Conceptual deep-dives

V.1 — Inconsistency (object, contingent) vs contradiction (meta, necessary) — why Ex 2 needs no consistency

Model-counting. Theorem 1 derives p ⟺ q with p="S⊢H(h̄)", q="H(h̄) refutable" — two independent statements. p=q has two solutions: (T,T) = inconsistent, (F,F) = undecidable. Consistency is the premise that deletes (T,T), leaving (F,F). Ex 2 derives b ⟺ ¬b for a single b="f∈P*" — zero solutions. Nothing to prune; the hypothesis is self-annihilating.

Where consistency lives. Consistency is the principle "refutable ⇒ not provable" (P* ∩ R* = ∅). An argument needs it iff it plays refutability against provability. Theorem 1 uses "negation represents P*" (refutability) — must buy disjointness. Ex 2 uses only provability and its Boolean complement — the metalogic's own non-contradiction suffices.

The tell: Ex 2 holds even of inconsistent S (then P*=all, P̃*=∅, unrepresentable since everything is provable). A theorem true of inconsistent systems cannot have used consistency — it is a claim about the metalanguage, not the object system. (Equipollence framing: the provable/refutable biconditional is a genuine balance needing an external tie-breaker; b⟺¬b is not a balance but a self-cancellation.)

V.2 — Ex 3: the hidden index (self- vs cross-representation)

P* is relative to a system: P*_T = {n : Eₙ(n̄) provable in T}. Ex 2 forbids only P̃*_T representable in T — set and representing system locked to the same T, because (L1a)'s self-reference needs one system in both roles. Ex 3 asks about P̃*_S representable in S′ — a different system; the indices don't match, so Ex 2 does not apply. A stronger S′ can know more about S's non-provability than S does, so cross-representation is a priori possible. Completeness re-locks the indices (S, S′ prove the same sentences), collapsing cross → self, where Ex 2 finally bites. Net, strictly stronger than Ex 2: no consistent extension can represent S's P̃* unless S is incomplete.

One-line taxonomy: Ex 2 = "A can't represent A's own P̃*" (unconditional); Ex 3 = "if a consistent extension B⊇A represents A's P̃*, then A is incomplete" (conditional; contrapositive is the "impossibility" reading, and only under completeness).

V.3 — Ex 6: decidability's one job

∃v₂F(n̄,v₂) provable is weaker than some instance F(n̄,m̄) provable — a system can prove an existential with no provable witness. ω-consistency forbids that pathology; decidability's sole role is to turn "n∉A ⇒ no instance provable" into "every instance refutable" (enum clause 2), which the Lemma ω contradiction then consumes.

V.4 — Ex 5/Ex 6 are the same proof twice

Both are enumerate, then Lemma ω. Ex 6 states the mechanism abstractly ("provable-agrees-with-true on all instances, all decidable"); Ex 5 is its Σ₀/Σ₁ instance ("all true Σ₀ provable" makes A(v₁,v₂) provable-agree with true on Σ₀-instances; Σ₀-decidability is automatic). Both live or die on the enumeration→representation lift.

V.5 — enumeration ≠ representation (a one-way, gated implication)

Not an equivalence. enumerable ⇒ representable holds only under ω-consistency (Lemma ω — ω-consistency is load-bearing). representable ⇒ enumerable is also not free: representability gives F(n̄) unprovable for n∉A, but enumeration clause 2 demands refutable — strictly stronger. Collapsing the two would hide exactly where ω-consistency enters the incompleteness proof — the one simplification to resist in a chapter whose subject is that entry point.


Part VI — Corrections made this session (errors caught, on the record)

  1. Ex 5 mis-stated as concluding only "enumerable." Working from a mistranscription, the tutor first claimed Ex 5 stops at enumerability and does not use the enumeration→representation link — and "corrected" the reader who had said it does. The book's Ex 5 concludes representable and carries ω-consistency as a second hypothesis. The reader was right: Ex 5 is genuinely two-step (enumerate via P, then Lemma ω via ω). Corrected in Part III.
  2. Ex 6's hypothesis invented. The tutor supplied a fabricated "(★) n∈A ⟺ some F(n̄,m̄) provable." The book's actual hypothesis is "represents in S the same relation it expresses" (i.e. S⊢F(n̄,m̄) ⟺ F(n̄,m̄) true) plus decidability; conclusion "∃v₂F represents the same set it expresses." Corrected in Part III; decidability's role re-derived in V.3.

The method that caught both: holding the recap against the exact characters of the page (the standing July-25/26/29 lesson). Both fixes surfaced from the reader's own scrutiny ("how do we know F enumerates A?"; "Ex 5 relies on enumeration≡representation, right?").


Part VII — Distinctions Ledger

raised resolution
Why does Theorem 1 need "negation represents P*", not "represents"? Represents-P* gives only (L1a) twice (tautology); the refutability side (negation represents) is what makes provable⟺refutable. Represent-P* directly would need P̃* representable — impossible (Ex 2).
Why does Ex 2 use no consistency? It derives b⟺¬b (a meta-contradiction, zero models), not p⟺q (an object-inconsistency, two models). Consistency = "refutable⇒unprovable"; Ex 2 never touches refutability. Holds even of inconsistent S. (V.1)
Why isn't Ex 3 already covered by Ex 2? P* is indexed to a system. Ex 2 locks set and representer to the same T; Ex 3 is cross-system (P̃*_S in S′). Completeness re-locks them. (V.2)
The S′⊢X ⇒ S⊢X line in Ex 3 Completeness of S + consistency of S′: if S⊬X then S⊢~X so S′⊢~X, clashing with S′⊢X. Special to complete S — incomplete S grows under extension.
Ex 7 step 3 seems to assume A's hypothesis Because it is proving A (the corollary). "Some true Σ₀ unprovable" in (2) is A's hypothesis negated as an output, not assumed. A* lives in (1)+(2) with the Y-shift. (Part IV)
Is enumeration ≡ representation? No — one-way, ω-gated (Lemma ω); converse also unfree (unprovable ≠ refutable). (V.5)
What is decidability for in Ex 6? Only to turn "no instance provable" into "every instance refutable"; ω-consistency does the representation lift. (V.3)
How do we know F enumerates A in Ex 6? Not given — derived from (a) represents=expresses + (b) decidability. Enumeration is the first thing you prove.
Theorem 3's two clauses split by strength (1) unprovable ← simple consistency; (2) unrefutable ← ω-consistency. The cheap half is what Rosser later keeps.

Part VIII — Self-Test

1. State (L1a) and why it needs no consistency.

Answer S⊢H(h̄) ⟺ h∈P*. It's the definition of P* plus the provable equivalence of H(h̄) and E_h(h̄) — pure syntax, no consistency.

2. Why does Theorem 1 need "negation represents P*" while Ex 2 needs no consistency at all?

Answer Theorem 1 pits refutable against provable (p⟺q, two models — consistency prunes the inconsistent one). Ex 2 pits provable against its complement (b⟺¬b, zero models — self-refuting in the metatheory). (V.1)

3. Give the two-step structure of Ex 5 and which hypothesis powers each.

Answer Step 1 enumerate — powered by "all true Σ₀ provable"; Step 2 Lemma ω lift to representable — powered by ω-consistency.

4. In Ex 6, what single thing does decidability do?

Answer Converts "n∉A ⇒ no instance provable" into "every instance refutable" (enum clause 2); ω-consistency does the rest.

5. Why is Ex 3 not a restatement of Ex 2?

Answer Ex 2 forbids a system representing its own P̃*; Ex 3 concerns a consistent extension representing S's P̃*. Completeness collapses the second to the first. (V.2)

6. Where in Ex 7 does the proof of A* actually diverge from A?

Answer The refutable branch: under A it's excluded (witness stays G); under A* part (2)'s true-unprovable Y, with ~Y a false Σ₀ (unprovable by A*'s hypothesis), is the witness. (Part IV)

7. State Theorem 3's two clauses and the consistency strength each needs.

Answer (1) G not provable — simple consistency; (2) G not refutable — ω-consistency.

8. Reconstruct the pipeline axiomatizable ⟶ incomplete.

Answer axiomatizable ⇒ P* Σ₁; Ex 5 ⇒ P* representable (needs all-true-Σ₀-provable + ω-consistency); Theorem 3 ⇒ G undecidable = Theorem A.


Part IX — Position, owed items, debts

Position: Chapter V, Part I complete (pp. 58–65). Owned: Lemma 1, Theorem 1/1′ + Corollary, Lemma ω, Theorem 2, Theorem 3/3′, Theorem A and its self-strengthening Theorem A*; Exercises 1–7 worked (5 & 6 corrected against the page). The arc G ⟸ A+B+axiomatizability is mapped end-to-end for Part I.

Next in the book: Chapter V, Part II — "Σ₀-Completeness" (Proposition 1's conditions C₁ "every atomic Σ₀-sentence correctly decidable" and C₂, jointly sufficient for Σ₀-completeness) ⟶ Theorem B, and its strengthening to true-Σ₁-provable — the Σ₁-completeness bridge owed since July 28, expected paid there. That closes Theorem G.

Owed, standing (unchanged, July 24–29): the July-27 book-checks (pure-1-frame Lemma K run-merging, divisor characterization at w=1, §5 x=0 wording); older items (L₂/L₃ strings, N₁₂ sub-relation, L₃ case-check, ancestor-interpretation falsification, whole-domain instance question, July-26 spelling checks). Debt register: property 1 ⇒ property 2, mechanical ⇒ Arithmetic, adequacy 1930, general machine form of 1931, operation-agreement, instantiation from L₆+L₇. β-function proof (Remark 2) still deferred.

Method note. Exercises done as the settled chain format (start/finish matched to the page, labelled steps citing owned glossary anchors only); the arc as a significance pipeline; five conceptual deep-dives recorded because they carried the session's real weight (the A/A* polarity trap and the object-vs-meta account of Ex 2 especially). Two tutor errors caught by the reader's scrutiny and by holding drafts against the page — the recorded versions are corrected.

Previous sessions: July 15 (Ch. 1), 17 (answers), 19–22 (Ch. II), 20 & 23 (exercises), 24 with 25 continuations (Ch. III §1), 26 (Ch. III §§2–4), 27 (Ch. IV pp. 40–50, Theorem E), 28 (Ch. IV pp. 50–55), 29 (Ch. IV Appendix Ex 1–8 + Ch. V prelude pp. 56–58). This file: Ch. V Part I pp. 58–65 — the abstract incompleteness theorems, Theorem A/A*, Exercises 1–7.