Next: Augmentation; Completion of Completeness
Up: Completeness
Previous: First Steps
At this point, then, our task has reduced to that of establishing
4.1. Our strategy will be to show, first,
that every set having the two properties
- being maximally consistent; and
- containing witnesses
is satisfiable. The second part of the strategy is to show that every
consistent set can be augmented to become a set having these two
properties.
So, what is maximally consistency? The concept is the same here as it
was in our chapter on propositional languages: a set
is
maximally consistent iff it's consistent, and every formula
consistent with
is in
.
The concept of
containing witnesses, however, is new. Here is the definition.
Definition 4.8
A set

contains witnesses iff for every formula of the form

there exists a term
t such that
where

is the result of replacing the variable
x in

with
t.
Now here is a lemma (currently left as an exercise for the reader) that
will prove indispensable.
Now we proceed to define a Henkin interpretation 
=
,
which will
have the property that
Our first step is to introduce a binary relation
on the set of all
terms TS that can be generated from a given symbol set S:
It is
relatively easy to prove
Lemma 4.2
- (a)
is an equivalence relation.
- (b)
- If
then for n-ary
,
and for n-ary
,
We denote the equivalence class of term t by
,
where
And let the domain
of

be the set of all equivalence classes, i.e.,
The structure 
is defined on
as
follows.
|
(4.3) |
 |
|
(4.4) |
 |
|
(4.5) |
 |
|
(4.6) |
 |
Lemma 4.3
- (a)
- For all t,
.
- (b)
- For every atomic formula
,
Theorem 4.2 (Henkin's Theorem)
Let

be a maximally consistent set containing
witnesses. Then for all

,
Proof. The proof is by induction on the
rank of
.4.3 If rank(
)
= 0, then
is atomic, and the theorem holds by Lemma
4.3. The induction step divides into three
separate cases.
- 1.
-
.
In this case
By the induction hypothesis we get
But then (why?) we have
- 2.
-
.
(For now, omited.)
- 3.
-
.
(For now, omited.)
Corollary 4.1

.
Hence

is satisfiable.
Next: Augmentation; Completion of Completeness
Up: Completeness
Previous: First Steps
Selmer Bringsjord
1999-04-19