* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download Document
Fuzzy logic wikipedia , lookup
Intuitionistic logic wikipedia , lookup
History of the function concept wikipedia , lookup
Foundations of mathematics wikipedia , lookup
Modal logic wikipedia , lookup
Tractatus Logico-Philosophicus wikipedia , lookup
Analytic–synthetic distinction wikipedia , lookup
Interpretation (logic) wikipedia , lookup
Laws of Form wikipedia , lookup
Propositional calculus wikipedia , lookup
Law of thought wikipedia , lookup
Quantum logic wikipedia , lookup
Meaning (philosophy of language) wikipedia , lookup
Natural deduction wikipedia , lookup
Propositional formula wikipedia , lookup
Bernard Bolzano wikipedia , lookup
The Barber’s Puzzle . – p.1/8 The Barber’s Puzzle In Puzzletown John has opened a new barber shop . . – p.1/8 The Barber’s Puzzle In Puzzletown John has opened a new barber shop . . – p.1/8 The Barber’s Puzzle In Puzzletown John has opened a new barber shop . John shaves all men, and only those men, who do not shave themselves. . – p.1/8 The Barber’s Puzzle In Puzzletown John has opened a new barber shop . John shaves all men, and only those men, who do not shave themselves. Who is shaving John the barber? . – p.1/8 Applied Logic: . – p.2/8 Applied Logic: You come across 3 people, A, B and C. one person is honest and always tells the truth one is a notorious liar one is a pokerface, sometimes liar sometimes honest . – p.2/8 Applied Logic: You come across 3 people, A, B and C. one person is honest and always tells the truth one is a notorious liar one is a pokerface, sometimes liar sometimes honest They make the following statements: A says: "I love mathematics." B says: "C always tells the truth." C says: "A hates math." . – p.2/8 Applied Logic: You come across 3 people, A, B and C. one person is honest and always tells the truth one is a notorious liar one is a pokerface, sometimes liar sometimes honest They make the following statements: A says: "I love mathematics." B says: "C always tells the truth." C says: "A hates math." Who is most likely the honest one? . – p.2/8 Recall from last time: . – p.3/8 Recall from last time: A statement is called a Proposition if it is either true or false. true ↔ truth value 1. false ↔ truth value 0. . – p.3/8 Logical Operators and Truth Tables . – p.4/8 Logical Operators and Truth Tables The operator "neg": ¬ or " not" . – p.4/8 Logical Operators and Truth Tables The operator "neg": ¬ or " not" "¬" changes proposition p to its opposite ¬p. . – p.4/8 Logical Operators and Truth Tables The operator "neg": ¬ or " not" "¬" changes proposition p to its opposite ¬p. "¬" reverses truth values. . – p.4/8 Logical Operators and Truth Tables The operator "neg": ¬ or " not" "¬" changes proposition p to its opposite ¬p. "¬" reverses truth values. the proposition "3+2=6" if false, but the proposition "¬(3 + 2 = 6)" is true. . – p.4/8 Logical Operators and Truth Tables The operator "neg": ¬ or " not" "¬" changes proposition p to its opposite ¬p. "¬" reverses truth values. the proposition "3+2=6" if false, but the proposition "¬(3 + 2 = 6)" is true. "¬(3 + 2 = 6)" is not the same as "3 + 2 = 5". . – p.4/8 Logical Operators and Truth Tables The operator "neg": ¬ or " not" "¬" changes proposition p to its opposite ¬p. "¬" reverses truth values. the proposition "3+2=6" if false, but the proposition "¬(3 + 2 = 6)" is true. "¬(3 + 2 = 6)" is not the same as "3 + 2 = 5". the effect of "¬" is shown in the Truth Table: p ¬p 1 0 0 1 . – p.4/8 The Operators ∧ and ∨ ∧ := ‘and’, ∨ :=‘or’ . – p.5/8 The Operators ∧ and ∨ ∧ := ‘and’, ∨ :=‘or’ used to combine elementary propositions . – p.5/8 The Operators ∧ and ∨ ∧ := ‘and’, ∨ :=‘or’ used to combine elementary propositions rules for truth values follow ‘sound common sense’: p, q p∧q p∨q 1,1 1 1 1,0 0 1 0,1 0 1 0,0 0 0 . – p.5/8 Examples ‘(5 ≥ 3) ∧ (5 ≥ 7)’ is false . – p.6/8 Examples ‘(5 ≥ 3) ∧ (5 ≥ 7)’ is false ‘(5 ≥ 3) ∨ (5 ≥ 7)’ is true. . – p.6/8 Examples ‘(5 ≥ 3) ∧ (5 ≥ 7)’ is false ‘(5 ≥ 3) ∨ (5 ≥ 7)’ is true. ‘¬p ∧ p’ is always false: a contradiction . . – p.6/8 Examples ‘(5 ≥ 3) ∧ (5 ≥ 7)’ is false ‘(5 ≥ 3) ∨ (5 ≥ 7)’ is true. ‘¬p ∧ p’ is always false: a contradiction . ‘¬p ∨ p’ is always true: a tautology. . – p.6/8 Theorem 1 . – p.7/8 Theorem 1 ‘¬(p ∧ q)’ is equivalent to ‘¬p ∨ ¬q’. ‘¬(p ∨ q)’ is equivalent to ‘¬p ∧ ¬q’. . – p.7/8 Theorem 1 ‘¬(p ∧ q)’ is equivalent to ‘¬p ∨ ¬q’. ‘¬(p ∨ q)’ is equivalent to ‘¬p ∧ ¬q’. Proof: Check all possibilities in the following truth tables: p, q p∧q ¬(p ∧ q) ¬p ¬q ¬p ∨ ¬q 1,1 1 0 0 0 0 1,0 0 1 0 1 1 0,1 0 1 1 0 1 0,0 0 1 1 1 1 ⋄ . – p.7/8 Where are the errors in this Table? p, q, r (p ∧ q) ¬(p ∧ q) ¬(p ∧ q) ∨ r 1,1,1 1 0 1 1,1,0 1 0 1 1,0,1 0 1 1 0,1,1 0 1 1 0,1,0 0 1 1 0,0,1 0 1 1 0,0,0 0 1 1 . – p.8/8