Truth, deduction, computation lecture 8

15
Truth, Deduction, Computation Lecture 8 Conditionals and Other Connectives Vlad Patryshev SCU 2013

description

My logic lectures at SCU Conditionals and Other Connectives

Transcript of Truth, deduction, computation lecture 8

Page 1: Truth, deduction, computation   lecture 8

Truth, Deduction, ComputationLecture 8Conditionals and Other Connectives

Vlad PatryshevSCU2013

Page 2: Truth, deduction, computation   lecture 8

Examples in Plain English

1. It rains because we prayed2. It rains after we prayed3. We go to school unless it rains4. If we go to school, it rains5. We don’t go to school only if it rains

Any logic in these sentences?How about truth tables?

Some of the sentences are not truth-functional

causation,correlation...

Page 3: Truth, deduction, computation   lecture 8

Conditional Symbol →

Material conditional

P Q P→Q

T T T

T F F

F T T

F F T

Looks familiar? How about DNF?

Page 4: Truth, deduction, computation   lecture 8

Conditional Symbol →

Material conditional

P Q P→Q

T T T

T F F

F T T

F F T

¬PvQ

T

F

T

T

Page 5: Truth, deduction, computation   lecture 8

Necessary and Sufficient Conditions

● P only if Q - meaning if P, then Q● Q if P - same thing● Q is necessary● P is sufficient

Page 6: Truth, deduction, computation   lecture 8

Conditions in DeductionP1∧P

2∧...P

i∧...∧P

n→Q is a logical truth

if and only if P

1

Pn

Q

Page 7: Truth, deduction, computation   lecture 8

Biconditional Symbol ↔

● A ↔ B● A if and only if B● A iff B● A “just in case” B (in math only)

○ Math: n is even just in case n2 is even○ Real life: We took umbrellas just in case it

rains

Page 8: Truth, deduction, computation   lecture 8

Biconditional Symbol ↔

P Q P↔Q

T T T

T F F

F T F

F F T

Looks familiar? How about DNF?

Page 9: Truth, deduction, computation   lecture 8

Biconditional Symbol ↔

P Q P↔Q

T T T

T F F

F T F

F F T

(P∧Q)v(¬P∧¬Q)

T

F

F

T

Page 10: Truth, deduction, computation   lecture 8

Completeness

Given a truth-valued function, can it be expressed via the connectives we know?E.g. via ∧v¬?

Easy for n=1:

General case? f(P1, P

2, …, P

n)

P f1 f2 f3 f4

T T T F F

F T F T F

Page 11: Truth, deduction, computation   lecture 8

Completeness

∧v¬ is enough.Actually,one of ∧v, and ¬

Other solutions?

Actually...

Page 12: Truth, deduction, computation   lecture 8

Peirce’s Arrow

NOR, aka ↓

A ↓ B ⇔ ¬(AvB)

¬A ⇔ A↓AAvB ⇔ ¬¬(AvB) ⇔ ¬(A↓B) ⇔ (A↓B)↓(A↓B)

“A or B” is “neither (neither A or B) nor (neither A or B)

Other solutions?

Page 13: Truth, deduction, computation   lecture 8

Sheffer Stroke

NAND, aka ↑

A ↑ B ⇔ ¬(A∧B)

¬A ⇔ A∧A

A∧B ⇔ ¬¬(A∧B) ⇔ ¬(A↑B) ⇔ (A↑B)↑(A↑B)

Page 14: Truth, deduction, computation   lecture 8

Exercise

Page 15: Truth, deduction, computation   lecture 8

That’s it for today