Next: Problem 4 - Paging
Up: Information Science I
Previous: Problem 2 - Hardware
Consider the following formula:
- 1.
- Show that every interpretation with a finite domain satisfies the formula.
- 2.
- Find an interpretation which does not satisfy the formula.
- 1.
- Let us assume that we have an interpretation
such that
is finite. We want to show that the
above formula is always true under the valuation associated with . To show that the implication
is true, we just have to show that the truth of
implies the
truth of
. So, we assume that the left-hand side of the
implication is true. It signifies in particular that:
is true. Let us choose
so that:
If for the whole set of variable ranging over
(which is finite),
is true, then it is
over. If not, we consider one of the
such that . We call it
and for that
we have:
But now, we do know that the set of
verifying
contains at least one element (). In the
same way we build .
Let us assume that the cardinality of
is
and that we have just built , that is:
Where the set of
verifying
contains
. I have succeeded in
finding a
such that:
We conclude by saying that all interpreation
where
is finite satisfies the wff.
- 2.
- If you choose the interpreation
with
and
then the wff states that:
which is obviously false.
Next: Problem 4 - Paging
Up: Information Science I
Previous: Problem 2 - Hardware
Reynald AFFELDT
2000-06-08