Professional Documents
Culture Documents
p iff (v P)( p, i) = t.
2. i |=
A B iff i |=
A and i |=
B.
3. i |=
A B iff i |=
A or i |=
B.
4. i |=
A iff i |=
A.
5. i |=
A or j |=
A.
Theorem 6.3 Where < I, P, $, v > is a model, if A contains no subformulas im-
possible on < P, ($ P), (v P) >, then for all i P, i |= A if and only if i |=
A.
Proof:
Case 1: A = p. Then, i |= p if and only if i |=
.
Case 2: A = B C.
i |= B C (i |= B & i |= C)
(i |=
B & i |=
C) by inductive hypothesis
i |=
B C
Case 3: A = B C. Similar to Case 2.
WHOS AFRAID OF IMPOSSIBLE WORLDS? 525
Case 4: A = B.
i |=B i |= B Corollary 6.2
i |=
B by inductive hypothesis
i |=
B
Case 5: A = B 2C.
Suppose rst that i |= B 2C. Since B is possible on < P, ($ P), (v P) >, there
is some i
P such that i
|=
|= B. So, B 2C
is not vacuously true at i. Then there is some $(i) such that i
, i
|= B and
i
, if i
|= B, i
P,
i
|= B and i
B, j |=
C
and there is an i
P, i
|=
B and i
|=
B 2C.
On the other hand, suppose that P. Then it follows straightforwardly from
the inductive hypothesis that i |=
B 2C.
Now suppose that i |=