From 05e2c5dc9c8898fdd90b191454c7e92e28ec63d1 Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:40 +0100 Subject: [PATCH 01/23] permutations.tex: remove the duplicated row of tab:permutation-conversions Rows 2 and 3 of the longtable are byte-identical (the ->E-over-\/E conversion). Ledger: (found 15 Nov; also ANALYSIS of the Persian edition) Co-Authored-By: Claude Opus 5.5 --- .../normalization/permutations.tex | 31 ------------------- 1 file changed, 31 deletions(-) diff --git a/content/proof-theory/normalization/permutations.tex b/content/proof-theory/normalization/permutations.tex index c5d65fba..08f90082 100644 --- a/content/proof-theory/normalization/permutations.tex +++ b/content/proof-theory/normalization/permutations.tex @@ -279,37 +279,6 @@ \AxiomC{$!D \lor !E$} \AxiomC{$\Discharge{!D}{x}$} \shortDeduce -\DeduceC{$!B \lif !C$} -\AxiomC{$\Discharge{!E}{y}$} -\shortDeduce -\DeduceC{$!B \lif !C$} -\DischargeRule{\Elim{\lor}}{x\,y} -\TrinaryInfC{$!B \lif !C$} -\AxiomC{$!B$} -\RightLabel{\Elim{\lif}} -\BinaryInfC{$!C$} -\DisplayProof -$\longrightarrow$\\[6ex] -\AxiomC{$!D \lor !E$} -\AxiomC{$\Discharge{!D}{x}$} -\shortDeduce -\DeduceC{$!B \lif !C$} -\AxiomC{$!B$} -\RightLabel{\Elim{\lif}} -\BinaryInfC{$!C$} -\AxiomC{$\Discharge{!E}{y}$} -\shortDeduce -\DeduceC{$!B \lif !C$} -\AxiomC{$!B$} -\RightLabel{\Elim{\lif}} -\BinaryInfC{$!C$} -\DischargeRule{\Elim{\lor}}{x\,y} -\TrinaryInfC{$!C$} -\DisplayProof -\\[10ex] -\AxiomC{$!D \lor !E$} -\AxiomC{$\Discharge{!D}{x}$} -\shortDeduce \DeduceC{$\lforall[x][!B(x)]$} \AxiomC{$\Discharge{!E}{y}$} \shortDeduce From 8e1c563f9bae080069c209002cb5eaedbc35482f Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:40 +0100 Subject: [PATCH 02/23] types.tex: refer to tab:tN3ip for the rules of tN3i The sentence defines tN3i and the table that follows (rules-tN3) is tab:tN3ip. Ledger: (found 15 Nov) Co-Authored-By: Claude Opus 5.5 --- content/proof-theory/propositions-as-types/types.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/proof-theory/propositions-as-types/types.tex b/content/proof-theory/propositions-as-types/types.tex index 91596582..fa6c2705 100644 --- a/content/proof-theory/propositions-as-types/types.tex +++ b/content/proof-theory/propositions-as-types/types.tex @@ -61,7 +61,7 @@ $\Gamma$ is~$!A$. The clauses in \olref{defn:type} should seem familiar: they are precisely the rules of \Log{tN2i} with one slight difference: the context~$\Gamma$ is the same throughout. We can codify the -definition as a calculus \Log{tN3i} with the rules given in \olref{tab:tN2ip}. +definition as a calculus \Log{tN3i} with the rules given in \olref{tab:tN3ip}. \subfile{rules-tN3} From 9128782be631963b8e65210508c2b19ce565a609 Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:40 +0100 Subject: [PATCH 03/23] cauchy.tex: real numbers are identified with equivalence classes, not relations The construction that follows defines reals as classes of one equivalence relation. Ledger: OLI-CAUCHY-CLASSES-NOT-RELATIONS Co-Authored-By: Claude Opus 5.5 --- content/sets-functions-relations/arithmetization/cauchy.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/sets-functions-relations/arithmetization/cauchy.tex b/content/sets-functions-relations/arithmetization/cauchy.tex index 811246a6..ea226ee1 100644 --- a/content/sets-functions-relations/arithmetization/cauchy.tex +++ b/content/sets-functions-relations/arithmetization/cauchy.tex @@ -108,7 +108,7 @@ Consequently, we again need to define an equivalence relation on the Cauchy sequences, and identify real numbers with equivalence -relations. First we need the idea of a function which tends to $0$ in +classes. First we need the idea of a function which tends to $0$ in the limit. For any function $h : \Nat \to \Rat$, say that \emph{$h$ tends to $0$} iff for any positive $\epsilon \in \Rat$ we have that $(\exists \ell \in \Nat)(\forall n > \ell)|h(n)| < From 9875a71c2194235c188af9515bdc4846104a500e Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:40 +0100 Subject: [PATCH 04/23] checking-details.tex: add the missing noun in '(tedious) task of checking' The phrase lacked its head noun. Ledger: OLI-CHECKING-DETAILS-MISSING-NOUN Co-Authored-By: Claude Opus 5.5 --- .../arithmetization/checking-details.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/sets-functions-relations/arithmetization/checking-details.tex b/content/sets-functions-relations/arithmetization/checking-details.tex index 0ab14ee1..72a66ae5 100644 --- a/content/sets-functions-relations/arithmetization/checking-details.tex +++ b/content/sets-functions-relations/arithmetization/checking-details.tex @@ -147,7 +147,7 @@ constitutes a \emph{complete} ordered field, i.e., an ordered field with the Completeness Property. Now, \olref[cuts]{realcompleteness} established that $\Real$ has the Completeness Property. However, it -remains to run through the (tedious) of checking that $\Real$ is an +remains to run through the (tedious) task of checking that $\Real$ is an ordered field. Before tearing off into \emph{that} laborious exercise, we need to From 925c6b8c635f0b826b621793d791d7bb9abd4420 Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:40 +0100 Subject: [PATCH 05/23] integers.tex: 'using ab to stand for' Missing 'to'. Ledger: OLI-INTEGERS-MISSING-TO Co-Authored-By: Claude Opus 5.5 --- content/sets-functions-relations/arithmetization/integers.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/sets-functions-relations/arithmetization/integers.tex b/content/sets-functions-relations/arithmetization/integers.tex index 8049754b..947caf7f 100644 --- a/content/sets-functions-relations/arithmetization/integers.tex +++ b/content/sets-functions-relations/arithmetization/integers.tex @@ -52,7 +52,7 @@ \equivrep{a, b}{\Intequiv} \times \equivrep{c, d}{\Intequiv} &= \equivrep{a c + b d, a d + b c}{\Intequiv}\\ \equivrep{a, b}{\Intequiv} \leq \equivrep{c, d}{\Intequiv} &\text{ iff }a + d \leq b + c \end{align*} -(As is common, I'm using `$ab$' stand for `$(a \times b)$', just to make the axioms easier to read.) Now, we need to make sure that these definitions behave as they \emph{ought} to. Spelling out what this means, and checking it through, is rather laborious; we relegate the details to \olref[check]{sec}. But the short point is: everything works! +(As is common, I'm using `$ab$' to stand for `$(a \times b)$', just to make the axioms easier to read.) Now, we need to make sure that these definitions behave as they \emph{ought} to. Spelling out what this means, and checking it through, is rather laborious; we relegate the details to \olref[check]{sec}. But the short point is: everything works! One final thing remains. We have constructed the integers using natural numbers. But this will mean that the natural numbers \emph{are From aa41124287b0dbeb2c17b08ffdb531992c8c792a Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:40 +0100 Subject: [PATCH 06/23] alonzo-church.tex: Church died on August 11, 1995 Enderton's obituary (BSL 1995, p. 488) gives 11 August 1995. Ledger: OLI-HIST-CHURCH-DEATH-DATE, BN-SRC-841, NOID-26, NOID-27 Co-Authored-By: Claude Opus 5.5 --- content/history/biographies/alonzo-church.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/history/biographies/alonzo-church.tex b/content/history/biographies/alonzo-church.tex index 668933c1..a8d2e916 100644 --- a/content/history/biographies/alonzo-church.tex +++ b/content/history/biographies/alonzo-church.tex @@ -37,7 +37,7 @@ Church continued his work into old age. In 1967 he left Princeton for UCLA, where he was professor until his retirement in 1990. Church -passed away on August 1, 1995 at the age of 92. +passed away on August 11, 1995 at the age of 92. \begin{reading} For a brief biography of Church, see \citet{EndertonND}. Church's From a36f30f7dec08d07dfe1c009eea01d22e1fccef6 Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:41 +0100 Subject: [PATCH 07/23] alonzo-church.tex: the 1927-29 fellowship was not all spent abroad National Research Fellowship 1927-29: Harvard, then Goettingen and Amsterdam (Enderton, p. 486). Ledger: OLI-HIST-CHURCH-FELLOWSHIP-LOCATION, OLTEHISBIOCHU-003 Co-Authored-By: Claude Opus 5.5 --- content/history/biographies/alonzo-church.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/history/biographies/alonzo-church.tex b/content/history/biographies/alonzo-church.tex index a8d2e916..2492cfbd 100644 --- a/content/history/biographies/alonzo-church.tex +++ b/content/history/biographies/alonzo-church.tex @@ -16,7 +16,7 @@ childhood, an air gun incident left Church blind in one eye. He finished preparatory school in Connecticut in 1920 and began his university education at Princeton that same year. He completed his -doctoral studies in 1927. After a couple years abroad, Church returned +doctoral studies in 1927. After a two-year research fellowship, Church returned to Princeton. Church was known to be exceedingly polite and careful. His blackboard writing was immaculate, and he would preserve important papers by carefully covering them in Duco cement (a clear From c95bfae7b953af67c79493917d6bc889b9c19812 Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:41 +0100 Subject: [PATCH 08/23] alonzo-church.tex: do not equate the Entscheidungsproblem with Church's Thesis Church1936 is the note on the Entscheidungsproblem, Church1936a the unsolvable-problem paper with the thesis. Ledger: OLI-HIST-CHURCH-THESIS-LABEL, BN-SRC-842, OLINC-308, OLTEHISBIOCHU-002 Co-Authored-By: Claude Opus 5.5 --- content/history/biographies/alonzo-church.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/content/history/biographies/alonzo-church.tex b/content/history/biographies/alonzo-church.tex index 2492cfbd..dbd9c4e8 100644 --- a/content/history/biographies/alonzo-church.tex +++ b/content/history/biographies/alonzo-church.tex @@ -41,8 +41,8 @@ \begin{reading} For a brief biography of Church, see \citet{EndertonND}. Church's -original writings on the lambda calculus and the Entscheidungsproblem -(Church's Thesis) are \citet{Church1936,Church1936a}. +original writings on the Entscheidungsproblem and on the lambda calculus +and Church's Thesis are \citet{Church1936,Church1936a}. \citet{Aspray1984} records an interview with Church about the Princeton mathematics community in the 1930s. Church wrote a series of book reviews of the \emph{Journal of From ca48398873a600e2d70c005c3525b0e3c21ef1a7 Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:41 +0100 Subject: [PATCH 09/23] refproofs.tex: close the parenthesis of phi(x,y) Unbalanced parenthesis. Ledger: OLI-STH-REFPROOFS-MISSING-PAREN-L147 Co-Authored-By: Claude Opus 5.5 --- content/set-theory/replacement/refproofs.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/set-theory/replacement/refproofs.tex b/content/set-theory/replacement/refproofs.tex index 9c8c3e66..2b92e2d9 100644 --- a/content/set-theory/replacement/refproofs.tex +++ b/content/set-theory/replacement/refproofs.tex @@ -144,7 +144,7 @@ \begin{thm}[in $\Z$ + Weak-Reflection]\label{thm:replacement} For any formula $\phi(v,w)$, and any $A$, if $(\forall x \in A)\lexists![y][\phi(x,y)]$, then -$\Setabs{y}{(\exists x \in A)\phi(x,y}$ exists. +$\Setabs{y}{(\exists x \in A)\phi(x,y)}$ exists. \end{thm} \begin{proof} From 774f0577061b570fb11b3eefff1e65937040a7b1 Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:41 +0100 Subject: [PATCH 10/23] terms.tex: fully parenthesize the application in the exercise term By the definition just given an application is (MN); the body juxtaposed two abstractions without it. Ledger: OLI-LAM-TERMS-APPLICATION-PARENTHESES, OLSOL-024, BN-SRC-919 Co-Authored-By: Claude Opus 5.5 --- content/lambda-calculus/syntax/terms.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/content/lambda-calculus/syntax/terms.tex b/content/lambda-calculus/syntax/terms.tex index b3fe7c09..585bfbc8 100644 --- a/content/lambda-calculus/syntax/terms.tex +++ b/content/lambda-calculus/syntax/terms.tex @@ -45,8 +45,8 @@ abstraction, and so on. \begin{prob} -Describe the formation of $(\lambd[g][(\lambd[x][(g (x x))]) - (\lambd[x][(g (x x))])])$. +Describe the formation of $(\lambd[g][((\lambd[x][(g (x x))]) + (\lambd[x][(g (x x))]))])$. \end{prob} \end{document} From dc0931b338a4f22a02978d920056962e3be51b71 Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:41 +0100 Subject: [PATCH 11/23] terms.tex: fix 'desginate' and 'demnostrates' Typos. Ledger: (found 15 Nov) Co-Authored-By: Claude Opus 5.5 --- content/lambda-calculus/syntax/terms.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/content/lambda-calculus/syntax/terms.tex b/content/lambda-calculus/syntax/terms.tex index 585bfbc8..410d84bb 100644 --- a/content/lambda-calculus/syntax/terms.tex +++ b/content/lambda-calculus/syntax/terms.tex @@ -12,7 +12,7 @@ The terms of the lambda calculus are built up inductively from an infinite supply of variables $\Obj{v_0}$, $\Obj{v_1}$, \dots, the symbol~``$\lambd$'', and parentheses. We will use $x$, $y$, $z$, \dots{} -to designate variables, and $M$, $N$, $P$, \dots{} to desginate terms. +to designate variables, and $M$, $N$, $P$, \dots{} to designate terms. \begin{defn}[Terms] \ollabel{defn:term} The set of \emph{terms} of the lambda calculus is defined inductively by: @@ -34,7 +34,7 @@ The terms defined above are fully parenthesized. This can get rather cumbersome, as the term -$(\lambd[x][((\lambd[x][x])(\lambd[x][(xx)]))])$ demnostrates. We will +$(\lambd[x][((\lambd[x][x])(\lambd[x][(xx)]))])$ demonstrates. We will introduce conventions for avoiding parentheses. However, the official definition makes it easy to determine how a term is constructed according to \olref{defn:term}. For example, the last step of forming From 10ac5e72a6d9cdc63e83bf1f0b35f8964f2791fe Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:41 +0100 Subject: [PATCH 12/23] addition.tex: the tagged components of alpha + 1 are joined by union, not disjoint sum Both parts are already tagged; applying the disjoint sum again changes the set. Ledger: OLTESTORDADD-001 Co-Authored-By: Claude Opus 5.5 --- content/set-theory/ord-arithmetic/addition.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/set-theory/ord-arithmetic/addition.tex b/content/set-theory/ord-arithmetic/addition.tex index 59350994..aa9c476e 100644 --- a/content/set-theory/ord-arithmetic/addition.tex +++ b/content/set-theory/ord-arithmetic/addition.tex @@ -75,7 +75,7 @@ \begin{proof} Consider the isomorphism $f$ from $\ordsucc{\alpha} = \alpha \cup \{\alpha\}$ to $\alpha\disjointsum1 = (\alpha \times \{0\}) -\disjointsum (\{0\} \times \{1\})$ given by $f(\gamma) = +\cup (\{0\} \times \{1\})$ given by $f(\gamma) = \tuple{\gamma, 0}$ for $\gamma \in \alpha$, and $f(\alpha) = \tuple{0, 1}$. \end{proof} From bce5ccad76b803f81121f2ab822025ee89cf66d3 Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:41 +0100 Subject: [PATCH 13/23] addition.tex: 0 x {1} is empty, not {0} 0 is the empty set, so 0 x {1} = 0 and nothing is added. Ledger: OLTESTORDADD-002 Co-Authored-By: Claude Opus 5.5 --- content/set-theory/ord-arithmetic/addition.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/set-theory/ord-arithmetic/addition.tex b/content/set-theory/ord-arithmetic/addition.tex index aa9c476e..4fd2726f 100644 --- a/content/set-theory/ord-arithmetic/addition.tex +++ b/content/set-theory/ord-arithmetic/addition.tex @@ -97,7 +97,7 @@ \begin{align*} \alpha \ordplus 0 & = \ordtype{(\alpha \times \{0\}) \cup (0 \times \{1\}), \rlexless} \\ - &= \ordtype{(\alpha \times \{0\}) \cup \{0\}, \rlexless}\\ + &= \ordtype{\alpha \times \{0\}, \rlexless}\\ &= \alpha\\ \alpha \ordplus (\beta \ordplus 1) %&= \ordtype{(\alpha\times \{0\}) \cup (\ordtype{\beta \ordplus 1}\times \{1\}), \rlexless} \\ From 3db1441bd1c24ff888bcb93b32434a6d716882b7 Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:41 +0100 Subject: [PATCH 14/23] addition.tex: the restricted relation ranges over pairs in (alpha + beta)^2 A relation on a set D is a set of pairs from D x D. Ledger: OLTESTORDADD-003 Co-Authored-By: Claude Opus 5.5 --- content/set-theory/ord-arithmetic/addition.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/set-theory/ord-arithmetic/addition.tex b/content/set-theory/ord-arithmetic/addition.tex index 4fd2726f..53928e34 100644 --- a/content/set-theory/ord-arithmetic/addition.tex +++ b/content/set-theory/ord-arithmetic/addition.tex @@ -48,7 +48,7 @@ \beta = \ordtype{\alpha \disjointsum \beta, \rlexless}$. \end{defn} \noindent -Note that we slightly abused notation here; strictly we should write ``$\Setabs{\tuple{x,y}\in \alpha\disjointsum\beta}{x \rlexless y}$'' in place of ``$\rlexless$''. For brevity, though, we will continue to abuse notation in this way in what follows. +Note that we slightly abused notation here; strictly we should write ``$\Setabs{\tuple{x,y}\in (\alpha\disjointsum\beta)^2}{x \rlexless y}$'' in place of ``$\rlexless$''. For brevity, though, we will continue to abuse notation in this way in what follows. The following result, together with \olref[ordinals][ordtype]{thmOrdinalRepresentation}, confirms that our From 84e5150bdd59c9412e2dd281a545b920ed50038a Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:41 +0100 Subject: [PATCH 15/23] classing.tex: beta is infinite because omega is closed under successor (defnomega) finitecardisoequal is about equinumerous finite ordinals; the step needs closure of omega under successor. Ledger: OLI-0584-SUCCESSOR-REFERENCE Co-Authored-By: Claude Opus 5.5 --- content/set-theory/cardinals/classing.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/set-theory/cardinals/classing.tex b/content/set-theory/cardinals/classing.tex index 34e255bd..59dccd95 100644 --- a/content/set-theory/cardinals/classing.tex +++ b/content/set-theory/cardinals/classing.tex @@ -88,7 +88,7 @@ \begin{proof} Let $\alpha$ be an infinite successor ordinal, so $\alpha = \beta -\ordplus 1$ for some $\beta$. By \olref{finitecardisoequal}, $\beta$ +\ordplus 1$ for some $\beta$. By \olref[z][infinity-again]{defnomega}, $\beta$ is also infinite, so $\cardeq{\beta}{\beta \ordplus 1}$ by \olref[ord-arithmetic][using-addition]{ordinfinitycharacter}. Now $\card{\beta} = \card{\beta\ordplus 1} = \card{\alpha}$ by From 35ad7ec38a587c14aac33fa3704a5db5103bb48c Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:41 +0100 Subject: [PATCH 16/23] interpretability.tex: Presburger: true in the standard model, not 'in the language' Truth is in a structure, as in the sentence before. Ledger: OLP-SRC-0366 Co-Authored-By: Claude Opus 5.5 --- .../theories-computability/interpretability.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/content/incompleteness/theories-computability/interpretability.tex b/content/incompleteness/theories-computability/interpretability.tex index 26cfa778..56264246 100644 --- a/content/incompleteness/theories-computability/interpretability.tex +++ b/content/incompleteness/theories-computability/interpretability.tex @@ -62,8 +62,8 @@ symbols, and then one can define $+$ in terms of $\times$ and $'$. So the set of true sentences in the language $\Obj 0$, $'$, $\times$ is undecidable. On the other hand, Presburger has shown that the set of -sentences in the language $\Obj 0$, $'$, $+$ true in the language of -arithmetic is decidable. The procedure is computationally infeasible, +sentences in the language $\Obj 0$, $'$, $+$ true in the standard model +is decidable. The procedure is computationally infeasible, however. \end{document} From 46e5c2059512ba871815d3d744d662f2d9b34e5a Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:41 +0100 Subject: [PATCH 17/23] reading-proofs.tex: part (b) is the reverse inclusion (a) and (b) were the same inclusion; the proof itself proves the reverse in (b). Ledger: OLP0610-SRC-02 Co-Authored-By: Claude Opus 5.5 --- content/methods/proofs/reading-proofs.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/content/methods/proofs/reading-proofs.tex b/content/methods/proofs/reading-proofs.tex index 4dbd6d5a..a55579dd 100644 --- a/content/methods/proofs/reading-proofs.tex +++ b/content/methods/proofs/reading-proofs.tex @@ -82,8 +82,8 @@ explicit: \begin{proof}{} [By definition of $=$ for sets, $A \cap (A \cup B) = A$ we have to - show (a) $A \cap (A \cup B) \subseteq A$ and (b) $A \cap (A \cup B) - \subseteq A$. (a): By definition of $\subseteq$, we have to show + show (a) $A \cap (A \cup B) \subseteq A$ and (b) $A \subseteq A \cap (A + \cup B)$. (a): By definition of $\subseteq$, we have to show that if $z \in A \cap (A \cup B)$, then $z \in A$.] If $z \in A \cap (A \cup B)$, then $z \in A$ [since by definition of $\cap$, $z \in A \cap (A \cup B)$ iff $z \in A$ and $z \in A \cup B$], so $A From 3b139da49305e62bfcec692511678b3edaf06f54 Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:41 +0100 Subject: [PATCH 18/23] reading-proofs.tex: remove a stray parenthesis Unbalanced ')' inside the formula. Ledger: (found 15 Nov) Co-Authored-By: Claude Opus 5.5 --- content/methods/proofs/reading-proofs.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/methods/proofs/reading-proofs.tex b/content/methods/proofs/reading-proofs.tex index a55579dd..1837b70c 100644 --- a/content/methods/proofs/reading-proofs.tex +++ b/content/methods/proofs/reading-proofs.tex @@ -93,7 +93,7 @@ (1) $z \in A$ or $z \in B$, which by definition of $\cup$ means $z \in A \cup B$], and therefore also $z \in A \cap (A \cup B)$ [since the definition of $\cap$ requires that $z \in A$, i.e., (1), and $z - \in A \cup B)$, i.e., (2)]. + \in A \cup B$, i.e., (2)]. \end{proof} \begin{prob} From 635fcff5dd5be241facead491b1fc3921654b544 Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:42 +0100 Subject: [PATCH 19/23] valuations-sat.tex: Local Determination: variables occurring in A, not 'in some formula A' A is already fixed; 'some formula' reads as a different quantifier. Ledger: TR-ADV-0062-011, OLP0061-SRC-01 Co-Authored-By: Claude Opus 5.5 --- .../syntax-and-semantics/valuations-sat.tex | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/content/propositional-logic/syntax-and-semantics/valuations-sat.tex b/content/propositional-logic/syntax-and-semantics/valuations-sat.tex index 103c383d..4314aa46 100644 --- a/content/propositional-logic/syntax-and-semantics/valuations-sat.tex +++ b/content/propositional-logic/syntax-and-semantics/valuations-sat.tex @@ -134,8 +134,7 @@ \ollabel{thm:LocalDetermination} Suppose that $\pAssign{v_1}$ and $\pAssign{v_2}$ are !!{valuation}s that agree on the !!{propositional variable}s occurring in $!A$, i.e., $\pAssign{v_1}(\Obj p_n) = -\pAssign{v_2}(\Obj p_n)$ whenever $\Obj p_n$ occurs in some -!!{formula}~$!A$. Then $\pValue{v_1}$ and $\pValue{v_2}$ also agree +\pAssign{v_2}(\Obj p_n)$ whenever $\Obj p_n$ occurs in~$!A$. Then $\pValue{v_1}$ and $\pValue{v_2}$ also agree on~$!A$, i.e., $\pValue{v_1}(!A) = \pValue{v_2}(!A)$. \end{thm} From f7c55ebea95ed2765047d53d1f7e3c0e843c5f1b Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:42 +0100 Subject: [PATCH 20/23] first-incompleteness.tex: 'This theorem is' Typo. Ledger: (found 15 Nov) 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..c371fc5d 100644 --- a/content/incompleteness/theories-computability/first-incompleteness.tex +++ b/content/incompleteness/theories-computability/first-incompleteness.tex @@ -24,7 +24,7 @@ \end{proof} \begin{explain} -This theorems is not that far from G\"odel's original 1931 formulation +This theorem is not that far from G\"odel's original 1931 formulation of the First Incompleteness Theorem. Aside from the more modern terminology, the key differences are this: G\"odel has ``$\omega$-consistent'' instead of ``consistent''; and he could not From d302fae1a494bc5d31fccbbeb612dbe3962459f7 Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:42 +0100 Subject: [PATCH 21/23] search-algorithm.tex: 'occurring' (3x) and a missing full stop Typos. Ledger: (found 15 Nov) Co-Authored-By: Claude Opus 5.5 --- content/proof-theory/proof-search/search-algorithm.tex | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/content/proof-theory/proof-search/search-algorithm.tex b/content/proof-theory/proof-search/search-algorithm.tex index 71e5f9da..1e30944d 100644 --- a/content/proof-theory/proof-search/search-algorithm.tex +++ b/content/proof-theory/proof-search/search-algorithm.tex @@ -21,7 +21,7 @@ !!{formula} in $\Gamma \Sequent \Delta$, or in a sequent produced in the proof search, is ``reduced,'' i.e., it is treated as the principal formula of an inference rule applied backwards, and that this happens -as often as necessary. We call this feature \emph{fairness} +as often as necessary. We call this feature \emph{fairness}. The algorithm works in stages. The output of each stage is a tree of sequents, and the output of the next stage is produced by reducing @@ -43,11 +43,11 @@ the !!{constant}s $\Obj c_0$, $\Obj c_1$, $\Obj c_2$, \dots, using any of the function symbols occurring in~$\Gamma$ and $\Delta$. We assume that the set of all these terms is given in some fixed enumeration, so -that we can talk about, e.g., ``the first !!{constant} not occuring in +that we can talk about, e.g., ``the first !!{constant} not occurring in $\Gamma \Sequent \Delta$.'' Each indexed sequent in the tree the algorithm produces has an associated set of !!{constant}s. The set of !!{constant}s assigned to the sequent in stage~$0$ is the set of all -!!{constant}s occuring in it (if there are any), and $\{\Obj c_0\}$ if +!!{constant}s occurring in it (if there are any), and $\{\Obj c_0\}$ if it contains no !!{constant}s. Suppose the algorithm has generated a tree of indexed sequents, with @@ -130,7 +130,7 @@ \Sequent \Lambda$. All inferences are correct inferences of~\Log{G3c}. This is obvious for the propositional inferences. Observe that at each step, the set~$C$ of !!{constant}s assigned to a sequent contains all -the !!{constant}s occuring in the sequent. Hence, in the reduction +the !!{constant}s occurring in the sequent. Hence, in the reduction using \LeftR{\lexists} and \RightR{\lforall}, the eigenvariable condition is satisfied, since the eigenvariable~$c$ was !!a{constant} not in the set~$C$ assigned to the conclusion, $c$ also did not occur From 537d89fb958fe017dd8f522ea14174149d591dec Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:42 +0100 Subject: [PATCH 22/23] quantifiers.tex: 'occurring', 'Thus' Typos. Ledger: (found 15 Nov) Co-Authored-By: Claude Opus 5.5 --- content/proof-theory/natural-deduction/quantifiers.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/content/proof-theory/natural-deduction/quantifiers.tex b/content/proof-theory/natural-deduction/quantifiers.tex index 752fa9cb..d039367f 100644 --- a/content/proof-theory/natural-deduction/quantifiers.tex +++ b/content/proof-theory/natural-deduction/quantifiers.tex @@ -156,11 +156,11 @@ Note that as $c$ is an eigenvariable, it does not occur in~$\lforall[x][!A(x)]$ or an open assumption. The proof $\delta_2$ is regular, since it contains no eigenvariable inferences at all. Let $a$ -be !!a{constant} not occuring in~$\delta$. By +be !!a{constant} not occurring in~$\delta$. By \olref{lem:subst-regular}, $\Subst{\delta_2}{a}{c}$ is a regular proof of $!A(a)$. By the eigenvariable condition, no open assumption of~$\delta_2$ contains~$c$, hence no open assumption -of~$\Subst{\delta_2}{a}{c}$ contains~$a$. Thuse we can +of~$\Subst{\delta_2}{a}{c}$ contains~$a$. Thus we can apply~$\Intro{\lforall}$. If we replace $\delta_1$ in~$\delta$ by the proof $\delta_1'$, \[ From 2353c69568685c7073c55677d9f889bb0a3b5d92 Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:36:46 +0100 Subject: [PATCH 23/23] types.tex: inj_i applies to the term N whose type is given The clause says 'If N has type A' but then injects M. Ledger: (found 15 Nov) Co-Authored-By: Claude Opus 5.5 --- content/proof-theory/propositions-as-types/types.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/proof-theory/propositions-as-types/types.tex b/content/proof-theory/propositions-as-types/types.tex index fa6c2705..519d0df7 100644 --- a/content/proof-theory/propositions-as-types/types.tex +++ b/content/proof-theory/propositions-as-types/types.tex @@ -37,7 +37,7 @@ has type $!A \land !B$. \item If $N$ has type~$!A_1 \land !A_2$, then $\proj{i}{N}$ has type~$!A_i$. \item If $N$ has type $!A$, then - $\inj[!B]{i}{!M}$ has type $!A \lor !B$ if $i=1$ and type $!B \lor + $\inj[!B]{i}{N}$ has type $!A \lor !B$ if $i=1$ and type $!B \lor !A$ if $i=2$. \item If $M$ has type $!A \lor !B$, $N_1$ has type $!C$ relative to $x_1:!A, \Gamma$, and $N_2$ has type~$!C$ relative to $x_2:!B,