Professional Documents
Culture Documents
S.R. Levy
Remaining Schedule
Φ 31 – Symbolic Logic
S.R. Levy
SRL 007
k it
Th in
u g h
thr o
Φ 31 – Symbolic Logic
S.R. Levy
SRL 007
T T F
~G Since
0 1 this is G,
G we need
H H an H
Φ 31 – Symbolic Logic
S.R. Levy
SRL 008
k it
Th in
u g h
thr o
Φ 31 – Symbolic Logic
S.R. Levy
SRL 008
T T T F
ab
0 1
An object can have
G G
more than one
name.
Φ 31 – Symbolic Logic
S.R. Levy
SRL 009
k it
Th in
u g h
thr o
Φ 31 – Symbolic Logic
S.R. Levy
SRL 009
T T F
0 1
F F
G
H
Φ 31 – Symbolic Logic
S.R. Levy
SRL 010
T T F
0 1
F F
Φ 31 – Symbolic Logic
S.R. Levy
Useful Theorems
Useful Theorems
Useful Theorems
Useful Theorems
SRL 010
∃xFx →ⱯyGy
T T F
0 1
F F
G G
Φ 31 – Symbolic Logic
S.R. Levy
Φ 31 – Symbolic Logic
S.R. Levy
SRL 010
u th -
a tr
d o a l
w
No nction
fu s i o n
p a n
e x
Φ 31 – Symbolic Logic
S.R. Levy
SRL 010
F T T T F T F T
T T F
T T T F
0 1
T T
F F
T T G G
Φ 31 – Symbolic Logic
S.R. Levy
SRL 011
T F
T T F
0 1
G G ms
eore
Th
Φ 31 – Symbolic Logic
S.R. Levy
SRL011
n a l
c ti o
- f un
ut h i o n
Tr p a n s
e x
Φ 31 – Symbolic Logic
S.R. Levy
SRL 012
Φ 31 – Symbolic Logic
S.R. Levy
SRL 012
F F F T T F T T F TT F
T T F
T T F T F
F T T T T
F T F F TT F0 F1 G0 G1
F T F F T T
Φ 31 – Symbolic Logic
S.R. Levy
SRL 012
ut h -
y T r
D o b n a l
c tio
f u n i o n
a n s ion
exp erivat
e d D
Fa il
Φ 31 – Symbolic Logic
S.R. Levy
SRL 16
Φ 31 – Symbolic Logic
S.R. Levy
SRL 16
Fa ile d D e r iv a t ion
SRL 013
Φ 31 – Symbolic Logic
S.R. Levy
SRL 013
F T F F F T F F T T F F T F T T T
T T T F
T T T T T T F F
F T F T F T F F T T
F0 F1 G0 G1 H0
H
F1 F T F T T
Φ 31 – Symbolic Logic
S.R. Levy
i k m o p q
0 1 2 3 4 5
⃠ ⃠ ⃠⃠ ⃠ ⃠
F F F F F F
G
H
⃠⃠⃠ ⃠⃠
G G
H H
G
H H
G
H
G
Φ 31 – Symbolic Logic
S.R. Levy
Invalidity:
Homework
3.114
3.116
3.118(i)
3.118(iii)
3.202 Derivations:
3.203
3.036
3.206
3.810
3.420
3.032
Φ 31 – Symbolic Logic
S.R. Levy
See ya later…