Semantical Considerations on Modal Logic

Saul. A. Kripke
1. System M(normal system).
* Notation)
- (atomic formula): P, Q, R
- (formula): A, B,, C
- (connective): , ,
1.1 Axiom schemas and rules
A1. A A
A2. (A B) . A B
R1. A, A B / B
R2. A / A
- S4: M .
A A
- B: M .
A A
- S5: M .
A A
1.2 Model Structure(m.s. ): (G, K, R)
- K , R , GK( K , G , R
).
- H 1 , H 2 , H 1 R H 2 H 2 H 1 :
H 2 H 1 (). R . H
H .
. . 1.1
.
- R S4 m.s.
- R B m.s.
- R , , S5 m.s.
1.3 Model(): , (
).

- {T, F} (P, H). P , H(K)

.
1.4 Rules of Truth assignment
- (A, H) (B, H) ,
.
- (A, H) = T iff (A, H) = T for every H(K) such that HRH
( H H )
1.5 Completemess theorem. A in M(S4, S5, B) iff (A, G) = T for every model
on an M-(S4-, S5-, B- ) model structure (G, K, R).

2. Quantificational modal logic.

2.1 Quantificational model structure: (G, K, R) and (H)
- (H) H(K) H (, K
).
* Notation)
- (variable): x, y, z,
- N (n-adic predicate letter): P n , Q n , (n )
- () 0 .
2.2 Quantificational model: .
- (P(x), H) = T if H P x .
= F otherwise.
- H P P .
2.3 : x (
, .).
- (x is bald, H) , H . x ,
?1
- ? .
substitution
1

(PP)

. ,
? . , .
( ).

 (F(x)F(x))
. x
, F(x) F(x) (Frege, Strawson
). (F(x)F(x)) ?
: substitution , .
- (, validity not
false ) subsitution . A A
substitution .
2.4 q.m.
- Frege-Strawson :
.2
-U=

U (H) (U K )

H K

- q.m.s. (G, K, R) q.m. (P n , H) . P n n

, H K .
- n=0 , P , .
n1 , (P n , H) = a subset of U n 3
-
(P n ( x ), H) = T if

a (P n , H)( a x )4

F otherwise
, , , .
- .

((x)A(x,
iff (A(x,

y ), H) = T relative to I of b to y

y ), H) = T, for every I of a, b to x, y where a(H)

.
. (P n , H) [(H)] n
. : P n (x 1 , , x n
)(y)A(y). . A(x i ). .
3

x
.
4
P ~ . (P, w) w P . a ,
w P , (Px, w) T .

Ex) .
F: ~ .
(Fx, w)( ) ((x)Fx, w)(
) .
3. Counterexamples
Barcan formula: (x)A(x) (x)A(x)
The reverse of Barcan formula: (x)A(x) (x)A(x)
3.1 Barcan formula .
- (G, K, R), K = {G, H}, G H, R K 2 .
(G) = {a}, (H) = {a, b}(a b)
(P, G) = {a}, (P, H) = {a}
- (P(x), G) = T, (P(x), H) = T(G P ,
P ). .
- , G , H P
. .
- P ,
, .
- Barcan formula
: (H) (H), HRH.
3.2 Barcan formula .
- (G) = {a, b}(a b), (H) = {a}
(P, G) = {a, b}, (P, H) = {a}
- (x)P(x): .
- (x)P(x): P . H P
b .
- A A
(x)A(x) , .
-
.
4. Counterexample .
- Prior Barcan formula S5 , M .

4.1 M Barcan formula .

(A) (x)A(x) A(y) (by quantification theory)
(B) ((x)A(x) A(y)) (by necessitation)
(C) ((x)A(x) A(y)) (x)A(x) A(y) (Axiom A2)
(D) (x)A(x) A(y)) (from (B) and (C))
(E) (y)((x)A(x) A(y)) (generalizing on (D))
(F) (x)A(x) (y)A(y) (by quantification theory, and (E))
4.2 Kripke: (A) necessitation . (A)
.
(A) (y)((x)A(x) A(y))
(A) necessitation .
(B) (y)((x)A(x) A(y))
(B) .
(B) (y)((x)A(x) A(y))
(B) (B) Barcan formula (
).
4.3
, Barcan formula (
).
- Kripke (x)A(x) A(a) . a
. ,
, .
5. M .
(0) Truth-functional tautologies
(1) A A
(2) (A B) . . A B
(3) A (x)A, where x is not free in A
(4) (x)(A B) . . (x)A (x)B

(5) (y) ((x)A(x) A(y))

5.1
- .
- Barcan formula .
- .
- .
5.2 Existence as a predicate