truth, deduction, computation lecture d

21
Truth, Deduction, Computation Lecture D Quantifiers, part 3 (almost there) Vlad Patryshev SCU 2013

Upload: vlad-patryshev

Post on 02-Nov-2014

290 views

Category:

Education


0 download

DESCRIPTION

My logic lectures at SCU Quantifiers, part 3

TRANSCRIPT

Page 1: Truth, deduction, computation   lecture d

Truth, Deduction, ComputationLecture DQuantifiers, part 3 (almost there)

Vlad PatryshevSCU2013

Page 2: Truth, deduction, computation   lecture d

Can we express “there’s only one”?

● ∃same as

● ∃ ∧ ∀ →

“quantifier” - a tool for measuring quantity; “some”, “all”, “just one” - look like ancient ways of counting people or stuff… or Gods.

Page 3: Truth, deduction, computation   lecture d

Translating English → FOL

EnglishEach cube is to the left of a tetrahedron

∀ → ∃ ∧

No cube to the right of a tetrahedron is to the left of a tetrahedron

∃ ∧ ∃ ∧ ∧∃ ∧

Every farmer who owns a donkey beats it.

∀ ∧ ∃ ∧then what? bad… try again!∀ →

∀ ∧ →

Only large objects have nothing in front of them

Every minute a man is mugged in NYC. We will interview him tonight.

∀ → ∃ ∧

or∃ ∧ ∀ →

Page 4: Truth, deduction, computation   lecture d

Try 11.27

Page 5: Truth, deduction, computation   lecture d

Function ---> Predicate

can be represented as

or∀ ∀ →

Page 6: Truth, deduction, computation   lecture d

Prenex Normal Form of WFF

A sentence is in prenex form if all its quantifiers are at the beginning of it.

But is it possible?!

source: https://en.wikipedia.org/wiki/Prenex_normal_form

Page 7: Truth, deduction, computation   lecture d

Steps to Convert a WFF to PNF

1. Conjunction

● ∀ ∧ ⇔ ∀ ∧

● ∃ ∧ ⇔ ∃ ∧

Page 8: Truth, deduction, computation   lecture d

Steps to Convert a WFF to PNF

2. Disjunction

● ∀ ∨ ⇔ ∀ ∨

● ∃ ∨ ⇔ ∃ ∨

Page 9: Truth, deduction, computation   lecture d

Steps to Convert a WFF to PNF

3. Implication

● → ∀ ⇔ ∀ →● → ∃ ⇔ ∃ →

Really?

Page 10: Truth, deduction, computation   lecture d

Steps to Convert a WFF to PNF

4. Implication

● ∀ → ⇔ ∃ →

● ∃ → ⇔ ∀ →Really?

Page 11: Truth, deduction, computation   lecture d

Steps to Convert a WFF to PNF

5. Negation (follows from 4, actually.)

● ∀ ⇔ ∃● ∃ ⇔ ∀

Page 12: Truth, deduction, computation   lecture d

PNF Example“if a cube is to the left of a tet, it’s behind a dodec”

“if a cube is to the left of tet, it’s behind a dodec”

Page 13: Truth, deduction, computation   lecture d

Proofs in FOLUniversal Elimination

∀ ⊢

Page 14: Truth, deduction, computation   lecture d

Proofs in FOLExistential Introduction (aka generalization)

⊢ ∃

Page 15: Truth, deduction, computation   lecture d

Proofs in FOLExistential Elimination (aka Instantiation)

1. Suppose ∃2. Invent a name (e.g. ) for such an 3.

Page 16: Truth, deduction, computation   lecture d

Proofs in FOLExistential Elimination (aka Instantiation)

Page 17: Truth, deduction, computation   lecture d

Proofs in FOLGeneral Conditional Proof

● To prove ⊢ ∀ →● Introduce a new name, e.g. , to

denote anything satisfying ● Prove ⊢● Profit

(this is not a “rule”, this is a trick with substitutions)

Page 18: Truth, deduction, computation   lecture d

Proofs in FOLUniversal Introduction (aka Generalization)

1. ∀ →2. ∀3. ∀

do you see modus ponens and prenex form transformations?

Page 19: Truth, deduction, computation   lecture d

Example (12.2)

Twas brillig, and the slithy toves Did gyre and gimble in the wabe:

All mimsy were the borogoves, And the mome raths outgrabe.

Page 20: Truth, deduction, computation   lecture d

How about mixing quantifiers?...

Page 21: Truth, deduction, computation   lecture d

That’s it for today