Skip to content
18 changes: 9 additions & 9 deletions content/proof-theory/proof-search/search-algorithm.tex
Original file line number Diff line number Diff line change
Expand Up @@ -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.
Expand All @@ -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
Expand All @@ -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
Expand All @@ -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
Expand All @@ -109,14 +109,14 @@
\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
\]
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.
Expand All @@ -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
Expand Down
11 changes: 6 additions & 5 deletions content/proof-theory/proof-search/tableaux.tex
Original file line number Diff line number Diff line change
Expand Up @@ -42,9 +42,9 @@
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
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
$\sFmla{\True}{!A}$ and $\sFmla{\False}{!A}$, or contains $\sFmla{\True}{\lfalse}$. If every branch is
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}
Expand Down Expand Up @@ -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.)
Expand All @@ -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
Expand Down