From 65ee3324fb32dfa981fed7c936addbd6262e0e36 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 1/7] search-algorithm.tex: stop only at atomic identities, as G3c's axioms require G3c axioms have atomic C; a compound A on both sides is not an axiom, so erasing indices gives no G3c proof. Ledger: OLI-PT-SEARCH-ATOMIC-CLOSURE, OLCMP-191, BN-SRC-920 Co-Authored-By: Claude Opus 5.5 --- content/proof-theory/proof-search/search-algorithm.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/content/proof-theory/proof-search/search-algorithm.tex b/content/proof-theory/proof-search/search-algorithm.tex index 71e5f9da..a08ecf37 100644 --- a/content/proof-theory/proof-search/search-algorithm.tex +++ b/content/proof-theory/proof-search/search-algorithm.tex @@ -54,7 +54,7 @@ associated sets of !!{constant}s, at stage~$n$. At stage~$n+1$, we do the following, for each topmost sequent. -If there is !!a{formula}~$!A$ that occurs on both the left and the +If there is an atomic !!{formula}~$!A$ that occurs on both the left and the right of the sequent, or the left contains~$\lfalse$, we do nothing: such sequents have !!{proof}s in~\Log{G3c}, and for this particular topmost sequent there is nothing left to do. @@ -126,7 +126,7 @@ sequent, the algorithm terminates successfully. In this case we have found !!a{proof} of~$\Gamma \Sequent \Delta$, obtained from the tree at stage $n+1$ by erasing all indices. The topmost sequents are all of -the form $!A, \Pi \Sequent \Lambda, !A$ or of the form $\lfalse, \Pi +the form $!A, \Pi \Sequent \Lambda, !A$ with $!A$ atomic, or of the form $\lfalse, \Pi \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 From 567ce0944fb175b8b7395e6abd706b23273ee7bf 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 2/7] search-algorithm.tex: new formulas get indices above the maximum k; right-exists label k is the maximal index already in use, so index k repeats one; the rule shown with the existential on the right is the right rule. Ledger: BN-SRC-600, OLCMP-192, BN-SRC-599, BN-SRC-601:rule-side-component, OLCMP-193 Co-Authored-By: Claude Opus 5.5 --- .../proof-theory/proof-search/search-algorithm.tex | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/content/proof-theory/proof-search/search-algorithm.tex b/content/proof-theory/proof-search/search-algorithm.tex index a08ecf37..39c892e1 100644 --- a/content/proof-theory/proof-search/search-algorithm.tex +++ b/content/proof-theory/proof-search/search-algorithm.tex @@ -76,7 +76,7 @@ \item $!A \ident !B \land !C$ and occurs on the left: Add one new topmost sequent above $(!B \land !C)^i, \Pi \Sequent \Lambda$: \[ - \Axiom$!B^k, !C^{k+1}, \Pi \fCenter \Lambda$ + \Axiom$!B^{k+1}, !C^{k+2}, \Pi \fCenter \Lambda$ \RightLabel{\LeftR{\land}} \UnaryInf$(!B \land !C)^i, \Pi \fCenter \Lambda$ \DisplayProof @@ -85,8 +85,8 @@ \item $!A \ident !B \land !C$ and occurs on the right: Add two new topmost sequents above $\Pi \Sequent \Lambda, (!B \land !C)^i$: \[ - \Axiom$\Pi \fCenter \Lambda, !B^k$ - \Axiom$\Pi \fCenter \Lambda, !C^k$ + \Axiom$\Pi \fCenter \Lambda, !B^{k+1}$ + \Axiom$\Pi \fCenter \Lambda, !C^{k+1}$ \RightLabel{\RightR{\land}} \BinaryInf$\Pi \fCenter \Lambda, (!B \land !C)^i$ \DisplayProof @@ -99,7 +99,7 @@ \item $!A \ident \lexists[x][!B(x)]$ and occurs on the left: Add one new topmost sequent above $\lexists[x][!B(x)]^i, \Pi \Sequent \Lambda$: \[ - \Axiom$!B(c)^k, \Pi \fCenter \Lambda$ + \Axiom$!B(c)^{k+1}, \Pi \fCenter \Lambda$ \RightLabel{\LeftR{\lexists}} \UnaryInf$\lexists[x][!B(x)]^i, \Pi \fCenter \Lambda$ \DisplayProof @@ -109,8 +109,8 @@ \item $!A \ident \lexists[x][!B(x)]$ and occurs on the right: Add one new topmost sequent above $\Pi \Sequent \Lambda, \lexists[x][!B(x)]$: \[ - \Axiom$\Pi \fCenter \Lambda, \lexists[x][!B(x)]^k, !B(t)^{k+1}$ - \RightLabel{\LeftR{\lexists}} + \Axiom$\Pi \fCenter \Lambda, \lexists[x][!B(x)]^{k+1}, !B(t)^{k+2}$ + \RightLabel{\RightR{\lexists}} \UnaryInf$\Pi \fCenter \Lambda, \lexists[x][!B(x)]^i$ \DisplayProof \] From e68f68076222545ec527e85fe5bc55df8e412de2 Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:43 +0100 Subject: [PATCH 3/7] search-algorithm.tex: the fallback term is a constant from C, so C keeps covering the sequent c_0 need not be in C; using it breaks the invariant on which the eigenvariable condition rests. Ledger: OLI-PT-SEARCH-FALLBACK-CONSTANT, BN-SRC-888, OLCMP-194 Co-Authored-By: Claude Opus 5.5 --- content/proof-theory/proof-search/search-algorithm.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/proof-theory/proof-search/search-algorithm.tex b/content/proof-theory/proof-search/search-algorithm.tex index 39c892e1..5160c934 100644 --- a/content/proof-theory/proof-search/search-algorithm.tex +++ b/content/proof-theory/proof-search/search-algorithm.tex @@ -116,7 +116,7 @@ \] where $t$ is the first term containing only !!{constant}s in~$C$ not already used in the reduction of $\lexists[x][!B(x)]$ on the right - below this sequent (or $\Obj c_0$ if all such terms have been used). + below this sequent (or the first !!{constant} in~$C$ if all such terms have been used). The set of !!{constant}s assigned to the new sequent is $C$. \item The cases where $!A \ident \lforall[x][!B(x)]$ are similar and left as exercises. From f9f1774729415daef1d02555fdd94e6d765e8fc6 Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:43 +0100 Subject: [PATCH 4/7] tableaux.tex: a branch containing T falsum is closed Tc has no rule for T falsum, and the search algorithm already treats falsum on the left as an axiom. Ledger: BN-SRC-889, OLCMP-198 Co-Authored-By: Claude Opus 5.5 --- content/proof-theory/proof-search/tableaux.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/proof-theory/proof-search/tableaux.tex b/content/proof-theory/proof-search/tableaux.tex index 2889ac58..cbfc18fa 100644 --- a/content/proof-theory/proof-search/tableaux.tex +++ b/content/proof-theory/proof-search/tableaux.tex @@ -42,7 +42,7 @@ principal on the left or right side of a sequent, respectively. A branch of a tableau is \emph{closed} if it contains both -$\sFmla{\True}{!A}$ and $\sFmla{\False}{!A}$. If every branch is +$\sFmla{\True}{!A}$ and $\sFmla{\False}{!A}$, or contains $\sFmla{\True}{\lfalse}$. If every branch is closed, we say the entire tableaux is closed. For instance, here is a clause tableau for $!A \lor (!B \land !C) \Sequent (!A \lor !B) \land (!A \lor !C)$, i.e., starting with $\sFmla{\True}{!A \lor (!B \land From 14b6347a0c9e25650bc89ac6970a4adef58afade Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:43 +0100 Subject: [PATCH 5/7] tableaux.tex: 'tableau is closed', 'closed tableau' Typos (kept in this bundle because they are next to the falsum fix). Ledger: (found 15 Nov) Co-Authored-By: Claude Opus 5.5 --- content/proof-theory/proof-search/tableaux.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/content/proof-theory/proof-search/tableaux.tex b/content/proof-theory/proof-search/tableaux.tex index cbfc18fa..44205f43 100644 --- a/content/proof-theory/proof-search/tableaux.tex +++ b/content/proof-theory/proof-search/tableaux.tex @@ -43,8 +43,8 @@ A branch of a tableau is \emph{closed} if it contains both $\sFmla{\True}{!A}$ and $\sFmla{\False}{!A}$, or contains $\sFmla{\True}{\lfalse}$. If every branch is -closed, we say the entire tableaux is closed. For instance, here is a -clause tableau for $!A \lor (!B \land !C) \Sequent (!A \lor !B) \land +closed, we say the entire tableau is closed. For instance, here is a +closed tableau for $!A \lor (!B \land !C) \Sequent (!A \lor !B) \land (!A \lor !C)$, i.e., starting with $\sFmla{\True}{!A \lor (!B \land !C)}$ and $\sFmla{\False}{(!A \lor !B) \land (!A \lor !C)}$: \begin{maxwidth} From 9ed1ee80f7efacdbff85158f136b57144950604a Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:43 +0100 Subject: [PATCH 6/7] tableaux.tex: the search picks the first unchecked non-atomic formula Atomic signed formulas have no rule and are never checked off, so the first unchecked formula can block the search. Ledger: BN-SRC-892, OLCMP-196 Co-Authored-By: Claude Opus 5.5 --- content/proof-theory/proof-search/tableaux.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/proof-theory/proof-search/tableaux.tex b/content/proof-theory/proof-search/tableaux.tex index 44205f43..06a1c53c 100644 --- a/content/proof-theory/proof-search/tableaux.tex +++ b/content/proof-theory/proof-search/tableaux.tex @@ -118,7 +118,7 @@ Proof search is easy in tableaux. We generate a tableau in stages. At stage $0$, simply write down the starting !!{formula}s at the top. At stage $n+1$, do the following for each leaf node: Find the first -(top-most) signed formula not yet checked off. Apply the branch +(top-most) non-atomic signed formula not yet checked off that is not of the form $\sFmla{\True}{\lforall}$ or $\sFmla{\False}{\lexists}$. Apply the branch extension rule to that formula. Once the rule has been applied in every branch that includes the signed formula in question, check it off. (The example above is generated using this algorithm.) From df43c27d65d6190cb086ddf6df2ea0689803588b Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:43 +0100 Subject: [PATCH 7/7] tableaux.tex: T-forall and F-exists are never checked off, so say what saturation means for them Those formulas are never checked off by the text's own rule, so the finite case as stated cannot occur. Ledger: BN-SRC-890, OLCMP-197 Co-Authored-By: Claude Opus 5.5 --- content/proof-theory/proof-search/tableaux.tex | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/content/proof-theory/proof-search/tableaux.tex b/content/proof-theory/proof-search/tableaux.tex index 06a1c53c..9bc24a0e 100644 --- a/content/proof-theory/proof-search/tableaux.tex +++ b/content/proof-theory/proof-search/tableaux.tex @@ -139,7 +139,8 @@ If this proof search does not produce a closed tableau, it either contains a finite open branch where all non-atomic !!{formula}s are -checked off, or the search produces an infinite, finitely branching +checked off, except those of the form $\sFmla{\True}{\lforall}$ and +$\sFmla{\False}{\lexists}$, which have been applied to every available term, or the search produces an infinite, finitely branching tree, which must contain an infinite branch. Just like in \olref[cpl]{sec}, we can define !!a{structure}~$\Struct{M}$ such that if $\sFmla{\True}{!A}$ occurs on the branch, then $\Sat{M}{!A}$ and if