Gui Ruiyan

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

Study journals ·

Gödel's Incompleteness — Chapter IV Appendix (Exercises 1–8) + Chapter V prelude (ω-consistency)

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 29, 2026 · Smullyan, "Gödel's Incompleteness Theorems," Chapter IV Appendix (Exercises 1–8, with the definition π(x)=13^(x²+x) and Theorem D) and the opening of Chapter V (§ "Gödel's Proof Based on ω-Consistency," book pp. 56–58) · Companion to July 15–28 · Character: a working session — the eight deferred exercises finally worked as justified chains, then the Chapter V setup read and its two hard spots (simple-inconsistency ⟹ ω-inconsistency, and why a contradiction explodes) elucidated. Several tutor errors were caught and corrected against the book's own pages during the session; the versions recorded here are the corrected ones.

Cross-references are clickable: citations like Ex 3, K3, C d, Theorem D jump to the definition or result being invoked.


How this document is organized

Parts I–II are the exercises: the toolkit (Ex 1, Ex 3, and the closure consequences K0–K4) and then the applications (Ex 2, 4, 5, 6, 7, 8). Part III records the four corrections that were made mid-session, so the errors are on file, not just the fixes. Parts IV–VII are the Chapter V prelude: definitions, the consistency hierarchy, the proof arc, and the explosion elucidation. Part VIII is the Distinctions Ledger, IX the Self-Test, X the position and debts.

Notation: plain Unicode; juxtaposition = ∗₁₃ concatenation; digits per the July-21 table (∀→9, etc.).


Part I — The toolkit (Ex 1, Ex 3, and their consequences)

Owned definitions cited throughout (the glossary — link targets for the chains below).

  • Σ₀ = bounded quantifiers only (decidable; closed under ¬, ∧, ∨, bounded ∃/∀).
  • Σ₁ = ∃y(Σ₀ body); = "Σ-relation" by Prop C₁.
  • recursive relation = R and ~R both Σ₁.
  • recursive function = f total with recursive graph.
  • Prop C closures — the clauses cited as C(a)–(e): (a) Σ₀⇒Σ₁; (b) absorb an unbounded ∃; (c) ∧, ∨; (d) bounded ∃ and bounded ∀; (e) R⊃S with R Σ₀.
  • Pow₁₃ = "u is a power of 13," Σ₀ (July 27).
  • L(x) = base-13 length, recursive; 13^m has length m+1.
  • K₁₁ = codes omitting digit δ (every ♯-free expression).
  • Theorem D: if a₁,…,aₖ ∈ K₁₁ are all ≤ x and k ≤ x, then the sequence number δa₁δ…δaₖδ ≤ π(x) = 13^(x²+x).
  • Prop 3, Ch. 3 relations (1)–(17) — strings in the July-26 ledger (...-2026-07-26.md): (5) Seqt, (6) tm, (9) R₂, (10) Seqf, (11) fm, etc.

Exercise 1 — a function with a Σ₁ graph is recursive

Step 1. A function has one value, so "not y" = "some z ≠ y":

f(x̄) ≠ y   ⟺   ∃z ( f(x̄)=z ∧ z≠y )

(⟹ f total, has a value z ≠ y; ⟸ if the value z ≠ y then f(x̄) ≠ y). This step uses functionhood + totality.

Step 2. f(x̄)=z Σ₁ (given), z≠y Σ₀ hence Σ₁ (C a), ∧ Σ₁ (C c), ∃z Σ₁ (C b). So f(x̄)≠y is Σ₁.

Step 3. Graph Σ₁ and complement Σ₁ ⟹ graph recursive ⟹ f recursive. ∎

Exercise 3 — bounded search below a recursive bound is recursive

Claim. R(x,y) recursive, f(x) recursive ⟹ Q(x) := (∃y ≤ f(x))R(x,y) recursive.

Step 1. f total with value f(x):

Q(x)   ⟺   ∃z ( f(x)=z ∧ (∃y ≤ z)R(x,y) )
~Q(x)  ⟺   ∃z ( f(x)=z ∧ (∀y ≤ z)~R(x,y) )

Step 2 (Q Σ₁). f(x)=z Σ₁ (Ex 1); R Σ₁; (∃y≤z)R Σ₁ (C d); ∧ (C c); ∃z (C b).

Step 3 (~Q Σ₁). f(x)=z Σ₁; ~R Σ₁ — available only because R is recursive (a bare Σ₁ relation need not have a Σ₁ complement); (∀y≤z)~R Σ₁ (C d, bounded ∀); ∧ (C c); ∃z (C b).

Step 4. Both Σ₁ ⟹ Q recursive. ∎ (The negative side is the only place "R recursive" beyond "R Σ₁" is spent, and where bounded ∀ (C d) is used.)

Consequences (from Ex 1, Ex 3, Prop C)

label property proof
K0 Σ₀ ⟹ recursive R, ~R both Σ₀ ⟹ both Σ₁ (C a)
K1 recursive closed under ¬ definition symmetric in R, ~R
K2 recursive closed under ∧, ∨ R∧S Σ₁ (C c); ~(R∧S)=~R∨~S Σ₁ (C c); ∨ dual
K3 bounded ∃≤x, ∀≤x over a recursive relation ⟹ recursive Ex 3 with f = identity; ∀ = ¬∃¬ (K1)
K4 g,f recursive functions ⟹ g∘f recursive; g recursive function, A recursive set ⟹ {x: A(g(x))} recursive graph ∃z(f(x)=z ∧ g(z)=y) Σ₁, total, Ex 1; inverse image via A(g(x))⟺∃z(g(x)=z ∧ A(z)), complement uses ~A

Part II — The applications (Ex 2, 4, 5, 6, 7, 8)

Exercise 2 — π(x) = 13^(x²+x) is recursive

Step 1. 13^m has length m+1, so 13^(x²+x) is the unique power of 13 of length x²+x+1:

π(x) = y   ⟺   Pow₁₃(y) ∧ L(y) = x²+x+1

Step 2. [Pow₁₃](#g-pow13)(y) Σ₀ (K0); [L](#g-len)(y)=x²+x+1 an equation between recursive functions, recursive; ∧ (K2). Graph recursive, so Σ₁.

Step 3. π total with Σ₁ graph ⟹ recursive (Ex 1). ∎ (Alt: exponentiation is recursive — Theorem E gives its Σ₁ graph, Ex 1 upgrades it — and x²+x recursive, so π recursive by composition, K4.)

Exercise 4 — tm(x) is recursive

Owned: tm(x) ⟺ ∃y(Seqt(y) ∧ x∈y) (rel. 6); Seqt Σ₀ (rel. 5), K0.

Step 1. R₁ satisfies R₁(a,b,c) ⟹ c>a, c>b. Prune a formation sequence for E_x to its ancestors, no repeats. The members are sub-terms of E_x, so: ♯-free (∈ K₁₁); ≤ x (x is the largest); ≥ 1 (every term has a positive code — smallest is the numeral 0̄ = 13⁰ = 1); distinct. Distinct positive integers ≤ x number at most x, so k ≤ x (the corrected count — 0 is excluded because it is not a term-code). Theorem D applies: sequence number ≤ π(x). So tm(x) ⟹ (∃y≤π(x))(…).

Step 2. Converse trivial. So tm(x) ⟺ (∃y≤π(x))(Seqt(y) ∧ x∈y).

Step 3. Body Σ₀ (K0); π recursive (Ex 2); Ex 3 ⟹ tm recursive. ∎

Exercise 5 — formula-codes recursive

R₂ (rel. 9) is strictly length-increasing too, so a pruned formation sequence for E_x has members ♯-free, distinct, positive, ≤ x ⟹ k ≤ x. Theorem D ⟹ fm(x) ⟺ (∃y≤π(x))(Seqf(y) ∧ x∈y). Seqf Σ₀ (rel. 10); π recursive (Ex 2); Ex 3 ⟹ fm recursive. ∎

Exercise 6 — relations (1)–(15) all recursive

  • Σ₀, so recursive (K0): (1) Sb, (2) Var, (3) Num, (4) R₁, (5) Seqt, (10) Seqf, (13) M.P.
  • Theorem D: (6) tm (Ex 4), (11) fm (Ex 5).
  • Built up: (7) f₀ [bounded ∃≤x over tm, K3+K2]; (8) Gen [bounded ∃≤y, K3]; (9) R₂ [∨ of recursive, K2]; (12) A [19 disjuncts, each bounded ∃'s over fm/Var/tm, K3+K2]; (14) Der [∨, K2].
  • (15) Pf = Seq(x) ∧ (∀y∈x)(A(y) ∨ (∃z,w ≺ₓ y)Der(z,w,y)). Here ≺ₓ does double duty: it is Σ₀ (only bounded ∃w≤z in its definition x∈z ∧ y∈z ∧ (∃w≤z)(wBz ∧ x∈w ∧ ~y∈w)), and z ≺ₓ y contains z∈x, so z ≤ x (a member never exceeds its sequence number). So the inner ∃z,w are bounded over a recursive matrix — recursive by K3; A(y)∨(…) by K2; the outer (∀y∈x) is a bounded ∀≤x over recursive — recursive by K3; Seq(x) Σ₀; ∧ by K2. Pf recursive. ∎

Exercise 7 — Fr(x,y) recursive; sentence-codes recursive

Fr(x, y): E_x is a variable, E_y is a formula, and E_x occurs free in E_y. (Variable = first argument x; formula = second argument y.)

Certificate (Ch. 3 Ex. 1 hint). For w = E_x, "w occurs free in a formula" is generated bottom-up: each member of the witnessing sequence is (1) an atomic formula with w a part of it; (2) ~G₁, G₁ earlier (w free in G₁); (3) G₁ ⊃ G₂ or G₂ ⊃ G₁, G₁ earlier (w free), G₂ any formula — only one side needs w free; (4) ∀vᵢ G′, G′ earlier (w free), vᵢ a variable distinct from w (∀w would bind it). E_y must appear in the sequence. (X in the hint = the target formula E_y; Y = a generic member.)

Step 1. The members are subformulas of E_y — ♯-free, distinct, positive, ≤ y — so k ≤ y; by Theorem D the sequence number ≤ π(y):

Fr(x,y) ⟺ Var(x) ∧ fm(y) ∧ (∃s ≤ π(y))( s is a valid free-occurrence certificate for E_x in E_y, E_y a member )

Step 2. Certificate-check Σ₀; π recursive (Ex 2); fm recursive (Ex 5); bounded ∃≤π(y), Ex 3; K2 ⟹ Fr recursive.

Step 3. A sentence = a formula with no free variable; a free variable has code ≤ y:

Sent(y) ⟺ fm(y) ∧ (∀x ≤ y)( Var(x) ⊃ ~Fr(x,y) )

recursive by K1, K2, K3 ⟹ Sent recursive. ∎

Exercise 8 — closures, and the r.e./recursive transfer

8(1) — Clo(x,y) = "E_x is a formula, E_y is its universal closure" is recursive. With z the prefix (part of E_y before E_x):

Clo(x,y) ⟺ fm(x) ∧ (∃z ≤ y)[ z ∗ x = y ∧ Qpref(z) ∧ (∀v ≤ x)( Var(v) ⊃ ( Fr(v,x) ⟺ 9v P z ) ) ]
  • z ∗ x = y: z is exactly the prefix (E_x is the tail — the old xEy).
  • Qpref(z): z is a run of blocks 9·(variable) = ∀vᵢ, each variable ≤ x, strictly increasing, possibly empty. Σ₀ scan (9's are walls, variables are rooms — the Seq idiom). Increasing order makes the closure unique, so Clo is the graph of a recursive function clos(x).
  • Last conjunct, spelled out: fusing two demands by ⟺ — [Fr](#def-fr)(v,x) ⟹ 9v P z ("every free variable is quantified" — the result is closed) and 9v P z ⟹ [Fr](#def-fr)(v,x) ("only free variables are quantified" — no vacuous ∀). Net: the prefix quantifies exactly the free variables. 9v P z, not 9v P y, because E_x may contain internal (bound) quantifiers that must not count. Bounding quantified variables ≤ x (inside Qpref) rules out vacuous ∀ over variables too big to occur in E_x.
  • Equivalence proved both directions (the closure prepends ∀ for exactly the free variables; degenerate case: E_x already a sentence ⟹ no free vars ⟹ z empty ⟹ y = x).

8(2) — for any system S: P r.e. ⟺ Pₛ r.e., and P recursive ⟺ Pₛ recursive. (P = provable-formula codes, Pₛ = provable-sentence codes.)

Bridge: a formula is provable iff its closure is (generalize by Rule 2; instantiate back). So

(A)  x∈P  ⟺  fm(x) ∧ clos(x)∈Pₛ
(B)  y∈Pₛ ⟺  y∈P ∧ Sent(y)          (Pₛ = P ∩ Sentences)

Dependency order: Ex 1, 3 = tools; Ex 2 uses 1; Ex 4/5/7 cap an unbounded ∃ at π (Theorem D) then use Ex 3; Ex 6 collects via K0–K4; Ex 8 uses 6, 7, and clos from 8(1).


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

  1. π was reconstructed, then read exactly. Early draft used a hand-built digit-count bound; the Appendix screenshot gives π(x) = 13^(x²+x) outright. Ex 2 rewritten to prove this recursive (Pow₁₃ + L, or exp∘polynomial).
  2. "Theorem A" → Theorem D. The witness-bounding lemma (sequence number ≤ π(x)) is the Appendix's Theorem D, not "Theorem A."
  3. The count step was a genuine non-sequitur. "Distinct and ≤ x, so at most x+1, so k ≤ x" is wrong — at most x+1 gives k ≤ x+1. Fix: term/formula codes are positive (0 is not a term-code; smallest is the numeral 0̄ = 1), so the distinct entries lie in {1,…,x}, at most x of them ⟹ k ≤ x. Same fix in Ex 5, Ex 7.
  4. Fr's arguments were reversed. The book's Fr(x,y): x is the variable, y is the formula, "E_x occurs free in E_y." The witness bound is π(y) (the formula's size), not π(x). Clo's last conjunct uses Fr(v,x) accordingly.

The method that caught 1–4: holding the recap against the exact characters of the page (the standing July-25/26 lesson).


Part IV — Chapter V prelude: the definitions

Chapter V redoes incompleteness on a weaker hypothesis than Chapter IV's "correct": Gödel's own ω-consistency.

term definition
system S (first-order theory over P.A.'s language) formulas = P.A.'s; axioms include Groups I–II (logical axioms, first-order logic with identity — prove every valid formula); Groups III–IV (the arithmetic axioms) replaced by an arbitrary axiom set; rules = modus ponens + generalization
correct every provable sentence is true (Ch. IV's assumption)
refutable ~X is provable
simply consistent no sentence is both provable and refutable
ω-inconsistent some F(w) (one free variable) has ∃xF(x) provable, yet every F(0̄), F(1̄), … refutable — proves "something is F," refutes each witness
ω-consistent not ω-inconsistent
axiomatizable (= formal = r.e.) the set of provable-formula codes is Σ₁. P.A. is (Ch. III/IV); N (all true arithmetic) is not (not even arithmetic — Tarski, Ch. II)
extension / subsystem S₁ extends S₂ if every S₂-provable formula is S₁-provable
represents a set A in S F(v₁) represents A if n∈A ⟺ F(n̄) provable in S (k-ary for relations)
expresses a set A (Ch. II, contrast) F(v₁) expresses A if n∈A ⟺ F(n̄) true

Part V — The consistency hierarchy (the spine)

correct   ⟹   ω-consistent   ⟹   simply consistent

each arrow strict. Chapter IV used the strongest (correct); Gödel's route needs only ω-consistency (weaker hypothesis = stronger theorem); Rosser (later) weakens to simple consistency.


Part VI — The arc of Chapter V's proof

Goal — Theorem G (Gödel's original): P.A. ω-consistent ⟹ P.A. incomplete. Assembled from:

Theorem G = apply A to P.A. (axiomatizable ✓, ω-consistent by hypothesis, true-Σ₀ by B).

  • Part I: derive Theorem A from still-more-abstract incompleteness theorems (apply to non-axiomatizable systems too). §1 introduces representability.
  • Part II: prove Theorem B (stronger: true Σ₁ provable — this is the Σ₁-completeness bridge flagged as owed since July 28, finally paid here).

Conceptual shift: Ch. IV ran on expressing (truth) and needed correctness to link provable↔true. Ch. V runs on representing (provability), so the diagonal argument never invokes truth — which is what lets "correct" drop to "ω-consistent." Incompleteness lives in the gap between the set a formula expresses (true instances) and the set it represents (provable instances).


Part VII — Simple inconsistency, ω-inconsistency, and the explosion

The claim: simply inconsistent ⟹ ω-inconsistent, so ω-consistent ⟹ simply consistent.

The reader's question, resolved. Simple inconsistency, by definition, only says some sentence X is both provable and refutable (X and ~X both provable). But in a system carrying classical first-order logic, one contradiction propagates to every sentence (ex contradictione quodlibet), so "some" collapses to "every sentence is both provable and refutable." The reader's phrasing ("every sentence both provable and refutable") is the correct consequence, equivalent to the definition in these systems — the collapse is the point.

Why the explosion — universal, not one instance. The tautology X ⊃ (~X ⊃ Y) is a schema valid for every Y, hence provable (from Group I logic) for every Y. For any target Y:

  1. X provable; 2. ~X provable; 3. X ⊃ (~X ⊃ Y) provable; 4. ~X ⊃ Y (MP 1,3); 5. Y (MP 2,4).

Nothing depends on Y — run it once per sentence, every sentence is provable (hence every ~Y provable, so every sentence refutable). Intuitive version: from X, X ∨ Y (or-introduction, any Y); with ~X, disjunctive syllogism gives Y.

Why you cannot contain one contradiction. Provability is closed under the rules — that is what "provable" means. If X and ~X are provable and some Y₀ were to stay out, the derivation above (with the logical axiom X ⊃ (~X ⊃ Y₀), which you cannot exclude, plus closure under MP) forces Y₀ in. So a set holding one contradiction but leaving Y₀ out is not closed under MP — not the provable set of any system with this logic. The contradiction is global, not a local blemish.

Two footnotes: (i) explosion is a feature of classical logic — paraconsistent logics reject exactly these moves to contain contradictions, but Smullyan's S all carry classical logic. (ii) "every sentence provable-or-refutable" is not expected even of good systems — that is completeness, which fails (incompleteness). A healthy system: never both (consistency), sometimes neither (incompleteness).


Part VIII — Distinctions Ledger

raised resolution
What is π(x)? 13^(x²+x) — the unique power of 13 of length x²+x+1. Recursive because Pow₁₃ is Σ₀ and L is recursive (Ex 2); or exp∘polynomial (K4).
Which theorem bounds the sequence number? Theorem D: entries ∈ K₁₁, all ≤ x, count k ≤ x ⟹ sequence number ≤ π(x).
"distinct and ≤ x, so at most x+1, so k ≤ x" Non-sequitur: at most x+1 gives k ≤ x+1. Fixed by positivity — term/formula codes are ≥ 1 (0 not a code), so entries ∈ {1,…,x}, at most x ⟹ k ≤ x.
What is Fr(x,y)? E_x a variable, E_y a formula, E_x occurs free in E_y. Variable first, formula second; witness bounded by π(y).
Certificate: what are X, Y? X = the target formula (E_y); Y = a generic member of the witnessing sequence. We exhibit one finite derivation ending at E_y, not an enumeration of the infinite class.
What is 9zx? Concatenation: digit 9 (∀) · variable · body = the code of ∀vᵢ E_x.
What does xEy mean? "x ends y" — E_x is the final segment (suffix) of E_y. (E overloaded: E_x = expression-by-code; xEy = ends; x exp y = exponential symbol.)
Clo's last conjunct — what does it constrain? [Fr](#def-fr)(v,x) ⟺ 9v P z fuses "every free variable is quantified" (result closed) with "only free variables are quantified" (no vacuous ∀). Net: the prefix quantifies exactly the free variables. Search the prefix z, not all of E_y (E_x's internal quantifiers must not count).
correct vs ω-consistent vs simply consistent correct ⟹ ω-consistent ⟹ simply consistent, each strict. Ch. IV used correct; Gödel uses ω-consistent (weaker); Rosser later, simple consistency.
Is X ⊃ (~X ⊃ Y) one instance or the reason? The universal reason — a schema valid/provable for every Y; instantiate per target.
Can one contradiction be contained, others clean? No — provability is closed under MP, and the logical axiom + MP force every Y in. Explosion is global. (Escapable only in paraconsistent logic, not here.)
Does simple inconsistency mean every sentence both provable and refutable? Yes as a consequence: the definition gives one, ex falso blows it up to all. Then ω-inconsistency is automatic (any F: ∃xF(x) provable, every F(n̄) refutable).

Part IX — Self-Test

1. Why does Ex 1 need f to be total, not just to have a Σ₁ graph?

Answer The equivalence f(x̄)≠y ⟺ ∃z(f(x̄)=z ∧ z≠y) needs f(x̄) to have a value z; totality supplies it. Uniqueness makes "not y" = "some other value."

2. In Ex 3, which step uses "R recursive" rather than just "R Σ₁," and why?

Answer The ~Q side: it needs ~R to be Σ₁, which a bare Σ₁ relation does not guarantee. That plus bounded ∀ (Prop C d) keeps ~Q in Σ₁.

3. Give π(x) and prove it recursive in one line.

Answer π(x)=13^(x²+x); graph [Pow₁₃](#g-pow13)(y) ∧ [L](#g-len)(y)=x²+x+1 is recursive, π total, so recursive by Ex 1.

4. Fix the count: "distinct codes ≤ x, so k ≤ x."

Answer Distinct ≤ x alone gives k ≤ x+1. Codes are positive (0 is no term/formula code), so entries ∈ {1,…,x}, at most x ⟹ k ≤ x.

5. State Fr(x,y) and the bound used to make it recursive.

Answer E_x a variable, E_y a formula, E_x free in E_y. Certificate over subformulas of E_y (codes ≤ y), bounded by π(y) via Theorem D; then Ex 3.

6. What does Clo's Fr(v,x) ⟺ 9v P z guarantee?

Answer The prefix quantifies exactly the free variables of E_x — every free one (⟹, closed) and no others (⟸, no vacuous ∀). Search in the prefix z, not all of E_y.

7. Rank correct / ω-consistent / simply consistent and give the two implications' directions.

Answer correct ⟹ ω-consistent ⟹ simply consistent. correct⟹ω: ω-inconsistent forces a false-yet-provable F(n̄). ω⟹simple: simply inconsistent explodes to ω-inconsistent.

8. Why can't a system prove one contradiction and keep every other sentence cleanly decided?

Answer Provability is closed under MP; the logical axiom X ⊃ (~X ⊃ Y) plus X, ~X derives every Y. A set leaving any Y₀ out isn't MP-closed, so isn't a provable set (over classical logic).

9. State Theorem G and how A + B deliver it.

Answer G: P.A. ω-consistent ⟹ incomplete. A: axiomatizable + ω-consistent + true-Σ₀-provable ⟹ incomplete. B: P.A. proves true Σ₀. P.A. is axiomatizable, so A applies.

10. Express vs represent — the difference, and where incompleteness lives.

Answer Express: n∈A ⟺ F(n̄) true. Represent: n∈A ⟺ F(n̄) provable. Incompleteness lives in the gap between them; Ch. V works with representing so it never needs truth (hence ω-consistency suffices).


Part X — Position, owed items, debts

Position: Chapter IV complete (text pp. 40–55 owned across July 27–28; Exercises 1–8 now worked, this file). Chapter V begun: prelude pp. 56–58 read — all definitions owned, the consistency hierarchy proved, the proof arc (G ⟸ A + B + axiomatizability) mapped, the explosion elucidated. Next in the book: Chapter V, Part I §1 — "A Basic Incompleteness Theorem" (the representability-based abstract theorems), then Part II (Theorem B / Σ₁-completeness).

Debt finally previewed-as-due: Σ₁-completeness (the decidable ⟹ provable-or-refutable bridge, owed since July 28) is exactly Theorem B + its Part II strengthening — expected to be paid in Part II of this chapter.

Owed, standing (unchanged, July 24–28): 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 (GOAL, glossary, labelled steps citing owned labels only); Chapter V prelude done as a significance/summary piece (definitions table + hierarchy + arc + precise error-diagnosis on the two hard spots). Four tutor errors caught 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). This file: Ch. IV Appendix exercises + Ch. V prelude.