Poet: Au Predicate Logic,III All that glitters is not gold. - - PDF document

poet
SMART_READER_LITE
LIVE PREVIEW

Poet: Au Predicate Logic,III All that glitters is not gold. - - PDF document

Mathematics for Computer Science Math vs. English MIT 6.042J/18.062J G Poet: Au Predicate Logic,III All that glitters is not gold. IMPLIES NOT ( in English x. [G(x) Au (x))] Two Meta-Theorems No : gold glitters


slide-1
SLIDE 1

1

lec 2F.1 Albert R Meyer, February 17, 2012

Mathematics for Computer Science

MIT 6.042J/18.062J

Predicate Logic,III

∀ ∃ in English

Two Meta-Theorems

lec 2F.2 Albert R Meyer, February 17, 2012

Au

Math vs. English

Poet:

G

  • Au

“All that glitters is not gold.” ∀x. [G(x)

IMPLIES NOT(

(x))]

No :gold glitters like gold!

lec 2F.3 Albert R Meyer, February 17, 2012

Math vs. English

Poet:

necessarily

  • “All that glitters is not gold.”

NOT( x

∀ . [ ( G A x) IMPLIES u(x)])

(Poetic license)

lec 2F.4 Albert R Meyer, February 17, 2012

Math vs. English

Poet: “There is a season to every purpose under heaven”

∃s ∈Season∀p ∈Purpose. s is for p

Some season, say Summer, is good for all Purposes? NO, Summer no good for snow shoveling

lec 2F.5 Albert R Meyer, February 17, 2012

Math vs. English

Poet: “There is a season to every purpose under heaven”

∃s ∈Season∀p ∈Purpose. s is for p

  • Poet’s meaning flips the quantiers

lec 2F.6 Albert R Meyer, February 17, 2012

Math vs. English

Poet: “There is a season to every purpose under heaven”

∀p ∈Purpose ∃s ∈Season. s is for p

Poet’s meaning flips the quantiers

slide-2
SLIDE 2

2

lec 2F.7 Albert R Meyer, February 17, 2012

Math vs. English

Poet: “There is a season to every purpose under heaven”

∀p ∈Purpose ∃s ∈Season. s is for p

for snow shoveling, Winter is good for planting, Spring is good for leaf watching, Fall is good

lec 2F.8 Albert R Meyer, February 17, 2012

Power & Limits of Logic

Two Profound

Meta-

Theorems about Mathematical Logic

lec 2F.9 Albert R Meyer, February 17, 2012

Gödel's Completeness Theorem

Thm 1, good news: only need to know a few axioms & rules to prove all valid formulas.

(in theory; in practice need lots of rules)

lec 2F.10 Albert R Meyer, February 17, 2012

Axioms & Inference Rules

Rules are just UG and modus

  • ponens. Most of the valid

axioms shown already.

lec 2F.11 Albert R Meyer, February 17, 2012

Validity is undecidable

Thm 2, Bad News: there is no procedure to determine whether a quantified formula is valid (in contrast to propositional formulas).

lec 2F.13 Albert R Meyer, February 17, 2012

Profound Meta-Theorems We won't examine these Theorems

  • further. Their proofs usually

require half a term in an intro logic course after 6.042. But they are interesting to think about.

slide-3
SLIDE 3

MIT OpenCourseWare http://ocw.mit.edu

6.042J / 18.062J Mathematics for Computer Science

Spring 2015 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.