# Section 1.2: Problem 6 Solution

Working problems is a crucial part of learning mathematics. No one can learn... merely by poring over the definitions, theorems, and examples that are worked out in the text. One must work part of it out for oneself. To provide that opportunity is the purpose of the exercises.

James R. Munkres

(a) Show that if
and
are truth assignments which agree on all the sentence symbols in the wff
, then
. Use the induction principle.

(b) Let
be a set of sentence symbols that includes those in
and
(and possibly more). Show that
iff every truth assignment for
which satisfies every member of
also satisfies
. (This is an easy consequence of part (a). The point of part (b) is that we do not need to worry about getting the domain of a truth assignment

*exactly*perfect, as long as it is big enough. For example, one option would be always to use truth assignments on the set of*all*sentence symbols. The drawback is that these are infinite objects, and there are a great many — uncountably many — of them.)
(a) Let
be the set of all sentence symbols, which includes sentence symbols found in
. Further, let
be the set of all symbols in
, and let
be the set of all wffs
for which
holds. Then, by assumption,
. Further, if
contains
and
then
and
, and for
,
and
are calculated according to the truth tables, that is they are identical, and
. Using the induction principle,
, and
.

(b) Let
be the set of sentence symbols used in
and
.
iff for every truth assignment
on
such that for every wff
,
,
iff (using (a)) for every truth assignment
on
such that for every wff
,
,
iff every truth assignment for
which satisfies every member of
also satisfies
.