# More on the König-lemma system

The system of Chapter 3 is in some sense a minimal logical system for propositional logic. (See example 7.28.) It is no real surprise that König's lemma arises straightforwardly from the Completeness theorem for this system, but perhaps the manner in doing this appears somewhat artificial. After all, we have used the full strength of König's lemma (and perhaps a bit more) in obtaining from Zorn's lemma the maximal set $Σ +$ that cannot derive $σ$ in the proof of Theorem 3.12. Nevertheless the proof of Theorem 3.13 is slighty curious in that it actually shows that a tree with no infinite paths is finite, and almost - but not quite - gives a bound on the size of the tree (via the number $n$ for which $Σ$ contains all strings of size $n$). I don't know if any more can be said in this direction.

For those that, perhaps rightly, think that there is something suspicious about this proof of König from Zorn, I offer here some alternatives.

First, the application of Zorn in Theorem 3.12 can be replaced by a more straightforward direct argument. We have $Σ ⊆ 2 *$ such that $Σ ⊬ σ$ and wish to find a maximal such $Σ +$ extending $Σ$. This can be done by an induction, as follows.

Let $Σ 0 = Σ$ and enumerate all $τ ∈ 2 *$ as $τ 0 , τ 1 , …$. Now define $Σ i + 1$ as follows. Inductively assume $Σ i ⊬ σ$ and consider $τ i$. If $Σ i ∪ τ i ⊬ σ$ let $Σ i + 1 = Σ i ∪ τ i$ and if not let $Σ i + 1 = Σ i$. Of course the inductive assumption holds for $i + 1$ too, i.e. $Σ i + 1 ⊬ σ$, so this construction continues for all $i$. Finally let $Σ + = ⋃ i ∈ ℕ Σ i$.

Note that the final set $Σ +$ obtained will depend on the particular choice of enumeration of $τ ∈ 2 *$ we started with.

Exercise.

Show that, irrespective of the choice of enumeration $τ i$ of $2 *$, the set $Σ +$ is a superset of $Σ$ such that $Σ + ⊬ σ$ and if $ρ ∉ Σ +$ then $Σ + ∪ ρ ⊢ σ$.

Thus the maximal set can be constructed by a rather more direct means other than appealing to Zorn's lemma.

Now for an alternative derivation of König's lemma from the material given.

First, let us modify the definition of semantics for the system. The intention behind the definition of $Σ ⊨ σ$ is that $Σ$ traps us at $σ$ in the sense that if we are at $σ$ in the tree $2 *$ we have no escape to infinity $P$ which is an infinite path containing $σ$ and avoiding all elements of $Σ$. To vary this slightly we can modify our idea of a route that we are willing to escape on.

Definition.

An escape from $σ$ is an infinite tree $E ⊆ 2 *$ containing $σ$ for which the following holds: for each $τ ∈ E$ of length less than the length of $σ$, $τ$ is an initial part of $σ$.

Thus an escape from $σ$ is an infinite tree for which no branching is allowed before $σ$. Any infinite path containing $σ$ is an escape from $σ$. In this way, all infinite paths are escapes, but not conversely.

Definition.

Let $Σ ⊆ 2 *$ and $σ ∈ 2 *$. We write $Σ ⊨ + σ$ ($Σ$ strongly entails $σ$) to mean that for all escapes $E$ from $σ$ we have $Σ ∩ E ≠ ∅$.

Since an infinite path is an escape, this clearly implies the previous notion: $Σ ⊨ + σ$ implies $Σ ⊨ σ$.

Exercise.

Show that the soundness theorem also holds for the notion of strong entailment. That is: $Σ ⊢ σ$ implies $Σ ⊨ + σ$.

Note too that the completeness theorem as previous stated and proved in the book shows $Σ ⊨ σ$ implies $Σ ⊢ σ$, so these three notions, provability and the two semantic entailments, are all equivalent.

Now suppose $T$ is an infinite tree. Let $Σ = T c$ be the set of strings not in $T$. Then obviously $Σ ⊭ + ⊥$ as there is an escape from $⊥$, $T$ itself, containing $⊥$ that does not meet $Σ$. It follows by the equivalences just proved that $Σ ⊭ ⊥$, meaning there is an infinite path $P$ containing $⊥$ that does not meet $Σ$. In other words $P$ is an infinite path which is contained in $T$, so König's lemma is proved.

Finally, for this web page, one student has pointed out to me that there is a very easy proof of the completeness theorem for this system, $Σ ⊨ σ$ implies $Σ ⊢ σ$, in the special case when $Σ$ is finite. It goes like this. Suppose $Σ ⊨ σ$, that $Σ$ is finite, and that $n ∈ ℕ$ is greater than the length of all $τ ∈ Σ$ and greater than the length of $σ$. Suppose $ρ ∈ 2 *$ has length $n$ and has $σ$ as an initial part. Then any infinite path through $ρ$ contains $σ$ and cannot contain any $τ ∈ Σ$ of longer length. Since $Σ ⊨ σ$ this means that $ρ$ must contain some $τ ∈ Σ$ as an initial part. In other words all such $ρ$ can be obtained from $Σ$ by the Given and Lengthening rules only. Since all such $ρ$ extending $σ$ can be so derived from $Σ$, then so can $σ$ be derived by deriving all these $ρ$ and then using the Shortening rule to get $σ$.

It's nice to see that this proof also constructs a proof of $σ$ from $Σ$, and one in which all the Given rules come first, then all the lengthening rules, and then all the shortening rules.

Exercise.

Prove directly the assertion just implied, directly by induction on the length of derivations, that if $Σ ⊢ σ$ there is a derivation of $σ$ from $Σ$ consisting of three blocks: the first consisting of all applications of the Given rule; the second (which is possibly empty) consisting of applications of lengthening; and the third (again possibly empty) consisting of applications of the shortening rule.