From d665a2048d4ea056f355817f4b4d6b1da1f3e6a5 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 1/3] provability.tex: the scope of the quantifier in the Ax1 instance As printed the universal ranges over the whole conditional, which is not an Ax1 instance (and can be false). Ledger: PS-643-OLAX-018, OLTEFOLAXDPRV-006 Co-Authored-By: Claude Opus 5.5 --- content/first-order-logic/axiomatic-deduction/provability.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/first-order-logic/axiomatic-deduction/provability.tex b/content/first-order-logic/axiomatic-deduction/provability.tex index efc206df..dced2594 100644 --- a/content/first-order-logic/axiomatic-deduction/provability.tex +++ b/content/first-order-logic/axiomatic-deduction/provability.tex @@ -242,7 +242,7 @@ From the hypotheses, $y$ is !!{free for} $c$ in $!A$ and $x$ is not free in $!A$, so by the previous \olref{lem:free-for}, $y$ is !!{free for} $x$ in $\Subst{!A}{x}{c}$. It follows that -$\lforall[x][\Subst{!A}{x}{c} \lif \Subst{!A}{x}{c} \Subst{}{y}{x}]$ +$\lforall[x][\Subst{!A}{x}{c}] \lif \Subst{!A}{x}{c} \Subst{}{y}{x}$ is an axiom (\textbf{Ax1}). Since $x$ is not free in $!A$, we have $\Subst{!A}{x}{c} \Subst{}{y}{x} = \Subst{!A}{y}{c}$, so that \[ From a5cfdb4f839e0443511bea1b7dbb63bd1723e704 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 2/3] comparing-sets.tex: equinumerosity needs u injective on X, not on the whole domain Domain N, X = evens, Y = N: equinumerous, yet no u injective on all of N maps X onto N. Ledger: OLP-SRC-0338-EQUINUMEROSITY-DOMAIN, OLSOL-015, PNB-CMP-077, BN-SRC-260, OLTESOLSET-006, OLPL-812, OLSOL-014 Co-Authored-By: Claude Opus 5.5 --- .../second-order-logic/sol-and-set-theory/comparing-sets.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/second-order-logic/sol-and-set-theory/comparing-sets.tex b/content/second-order-logic/sol-and-set-theory/comparing-sets.tex index 1364c42e..9fff1bee 100644 --- a/content/second-order-logic/sol-and-set-theory/comparing-sets.tex +++ b/content/second-order-logic/sol-and-set-theory/comparing-sets.tex @@ -50,7 +50,7 @@ The formula \begin{multline*} \lexists[u][(\lforall[x][(X(x) \lif Y(u(x)))] \land {}\\ - \lforall[x][\lforall[y][(\eq[u(x)][u(y)] \lif \eq[x][y])]] + \lforall[x][\lforall[y][((X(x) \land X(y) \land \eq[u(x)][u(y)]) \lif \eq[x][y])]] \land {} \\\lforall[y][(Y(y) \lif \lexists[x][(X(x) \land \eq[y][u(x)])])])] \end{multline*} From 4e0732689244a795930fc9c2f80590304ccd9029 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 3/3] dlo.tex: the Forth step also covers p empty and a already in the domain of p The proof notes the empty map is in I, but the cases use a_1 and a_n; for a in dom(p) all three cases fail. Ledger: OLPISV-LEGACY-0190-0002 Co-Authored-By: Claude Opus 5.5 --- content/model-theory/basics/dlo.tex | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/content/model-theory/basics/dlo.tex b/content/model-theory/basics/dlo.tex index 8d26dced..23678383 100644 --- a/content/model-theory/basics/dlo.tex +++ b/content/model-theory/basics/dlo.tex @@ -42,9 +42,10 @@ \section{Dense Linear Orders} To show $\PIso{I}$ satisfies the Forth property, let $p \in \PIso{I}$ and let $p(a_i) = b_i$ for $i = 1$, \dots,~$n$, and without loss of generality suppose $a_1 <_1 a_2 <_1 \cdots <_1 - a_n$. Given $a \in \Domain{M_1}$, find $b \in \Domain{M_2}$ as - follows: + a_n$. Given $a \in \Domain{M_1}$, if $a = a_i$ for some~$i$, then $q = p$ + will do. Otherwise, find $b \in \Domain{M_2}$ as follows: \begin{enumerate} + \item if $p = \emptyset$, let $b \in \Domain{M_2}$ be arbitrary; \item if $a <_1 a_1$ let $b \in \Domain{M_2}$ be such that $b <_2 b_1$; \item if $a_n <_1 a$ let $b \in \Domain{M_2}$ be such that $b_n <_2 b$;