Φ 31 – Symbolic Logic

S.R. Levy

Validity and Invalidity

Φ 31 – Symbolic Logic
S.R. Levy

The Home Stretch

 Φ 31 – Symbolic Logic
S.R. Levy

Time traveling to the Final Exam

 Φ 31 – Symbolic Logic
S.R. Levy
If You Need Help
You are here.
Φ 31 – Symbolic Logic
S.R. Levy

13 Perfect
Scores
Φ 31 – Symbolic Logic
S.R. Levy
Φ 31 – Symbolic Logic
S.R. Levy

SRL I 001
 Φ 31 – Symbolic Logic
S.R. Levy

Valid Argument

One in which it is impossible for the premises all

to be true and the conclusion false.

Construct a counterexample in order to show that

an argument is invalid.
 Φ 31 – Symbolic Logic
S.R. Levy

Demo SRL I 001

Pirates exist.

All pirates are mean.

Something is not mean.

Therefore
All mean things are pirates.

True
True
True False
 Φ 31 – Symbolic Logic
S.R. Levy

Invalidity in Sentential Logic

Describe a logically possible

situation where the premises can
be true and the conclusion false.

Use truth tables.

 Φ 31 – Symbolic Logic
S.R. Levy

Invalidity in Sentential
Logic
P⋀Q→R ∴P∨Q→R

a r d!
e bo
th
U se
Jump to
theorems
 Φ 31 – Symbolic Logic
S.R. Levy

Invalidity in Sentential
T F F Logic T F
P⋀Q→R ∴P∨Q→R
T F
F F T F
T
 Φ 31 – Symbolic Logic
S.R. Levy

F T F F F F F F F T F F F

T T T T T F
T T T F F F F F T F
T F F
 Φ 31 – Symbolic Logic
S.R. Levy

SRL 001

T T T F
Φ 31 – Symbolic Logic
S.R. Levy
 Φ 31 – Symbolic Logic
S.R. Levy

SRL 001

T T T F
T F
0 1 2
F G G
G F F Why do we have to make
sure that 2 does not have
 Φ 31 – Symbolic Logic
S.R. Levy

SRL 002

T T T F

0 1
F F
G G
H
 Φ 31 – Symbolic Logic
S.R. Levy

SRL 003

T T F
a
0 1
F G
H
 Φ 31 – Symbolic Logic
S.R. Levy

SRL 004

T T T T F
c a b
0 1 2
F F F
H H H
G G G
 Φ 31 – Symbolic Logic
S.R. Levy

SRL 005

T T T T T F

c a bd One thing has two

0 1 2 names
F F F
G G G
H H H
 Φ 31 – Symbolic Logic
S.R. Levy

T T T F

0 1 2 3
F F F F
G G G G
 Φ 31 – Symbolic Logic
S.R. Levy

SRL 010

T T F
0 1
F F
 Φ 31 – Symbolic Logic
S.R. Levy

Useful Theorems

Confines Universal and Existential Quantifiers over a

conjunction
 Φ 31 – Symbolic Logic
S.R. Levy

Useful Theorems

Confines Universal and Existential Quantifiers over a

disjunction
 Φ 31 – Symbolic Logic
S.R. Levy

Useful Theorems

Confines Universal and Existential Quantifiers over a

conditional
 Φ 31 – Symbolic Logic
S.R. Levy

Useful Theorems

Distributes Existential Quantifiers over a disjunction

Distributes Universal Quantifiers over a conjunction

 Φ 31 – Symbolic Logic
S.R. Levy

SRL 010
∃xFx →ⱯyGy

T T F
0 1
F F
G G
 Φ 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

∃y~Gy vⱯxGx ∃yGy →ⱯxGx

T F
T T F
0 1
G G
Φ 31 – Symbolic Logic
S.R. Levy

Homework

Derivations
3.026
3.027
3.411
Invalidities
3.113
3.115
3.117
3.201
Φ 31 – Symbolic Logic
S.R. Levy

See ya later…