A is a knight:A A eats his hat:H. A is a knight:A A eats his hat:H If I am a knight then I’ll eat my hat: A  H.

Slides:



Advertisements
Similar presentations
TRUTH TABLES Section 1.3.
Advertisements

TRUTH TABLES The general truth tables for each of the connectives tell you the value of any possible statement for each of the connectives. Negation.
AE1APS Algorithmic Problem Solving John Drake. The island of Knights and Knaves is a fictional island to test peoples ability to reason logically. There.
PROOF BY CONTRADICTION
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Solving Word Problems II
Logic Use mathematical deduction to derive new knowledge.
Lab 2 - CA Chapter 1 Section 1.5
Logic ChAPTER 3 1. Truth Tables and Validity of Arguments
DEDUCTIVE REASONING: PROPOSITIONAL LOGIC Purposes: To analyze complex claims and deductive argument forms To determine what arguments are valid or not.
TR1413: Discrete Mathematics For Computer Science Lecture 3: Formal approach to propositional logic.
Logic: Connectives AND OR NOT P Q (P ^ Q) T F P Q (P v Q) T F P ~P T F
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
1 Inference Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
Through the Looking Glass, 1865
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
Propositional Logic 7/16/ Propositional Logic A proposition is a statement that is either true or false. We give propositions names such as p, q,
Truth Tables for Negation, Conjunction, and Disjunction.
TRUTH TABLES. Introduction Statements have truth values They are either true or false but not both Statements may be simple or compound Compound statements.
The Foundations: Logic and Proofs
The Foundations: Logic and Proofs
Week 1 - Wednesday.  Course overview  Propositional logic  Truth tables  AND, OR, NOT  Logical equivalence.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
Lecture 5 Knights and Knaves.. Administration Show hand in form. Show plagiarism form. Any problems with coursework? Google knight and knaves and look.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
Valid and Invalid Arguments
Conditional Statements CS 2312, Discrete Structures II Poorvi L. Vora, GW.
Dr. Naveed Riaz Design and Analysis of Algorithms 1 1 Formal Methods in Software Engineering Lecture # 24.
Math 240: Transition to Advanced Math Deductive reasoning: logic is used to draw conclusions based on statements accepted as true. Thus conclusions are.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Logic Review. FORMAT Format Part I 30 questions 2.5 marks each Total 30 x 2.5 = 75 marks Part II 10 questions Answer only 5 of them! Total 5 x 5 marks.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
The Foundations Logic and Proofs by raedRASHEED 2014.
Chapter 3 section 3. Conditional pqpqpq TTT TFF FTT FFT The p is called the hypothesis and the q is called the conclusion.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
Chapter 7 Logic, Sets, and Counting
Conditional Statements
Chapter 3: Introduction to Logic. Logic Main goal: use logic to analyze arguments (claims) to see if they are valid or invalid. This is useful for math.
CS1022 Computer Programming & Principles Lecture 1 Logic and Proof.
Lecture 9 Conditional Statements CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
How do I show that two compound propositions are logically equivalent?
Chapter 7 Logic, Sets, and Counting Section 1 Logic.
LOGIC.
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
Do you agree with the following proofs? 1.Prove that  2 is irrational. Proof: Suppose that  2 is not irrational, then  2 = p/q for some natural numbers.
Logics for Data and Knowledge Representation
Chapter 1: The Foundations: Logic and Proofs
Conditional Statements – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Conditional Statements Reading: Kolman, Section 2.2.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Notes - Truth Tables fun, fun, and more fun!!!!. A compound statement is created by combining two or more statements, p and q.
Joan Ridgway. If a proposition is not indeterminate then it is either true (T) or false (F). True and False are complementary events. For two propositions,
Week 1 - Wednesday.  Course overview  Propositional logic  Truth tables  AND, OR, NOT  Logical equivalence.
Dr. Naveed Riaz Design and Analysis of Algorithms 1 1 Formal Methods in Software Engineering Lecture # 25.
Outline Logic Propositional Logic Well formed formula Truth table
Section 1.1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: a) The Moon is made of green.
Conditional Statements Lecture 2 Section 1.2 Fri, Jan 20, 2006.
Introduction to Proofs. The use of Reasoning and Logic in proofs Inductive Reasoning- “reasoning from detailed facts to general principles” – Specific.
Conditional statement or implication IF p then q is denoted p ⇒ q p is the antecedent or hypothesis q is the consequent or conclusion ⇒ means IF…THEN.
Logic and Truth Tables Winter 2012 COMP 1380 Discrete Structures I Computing Science Thompson Rivers University.
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
Chapter 1 Logic and proofs
Logic- Meaning & Logical Reasoning Neil Heffernan (Slides from Andrew Moore at CMU) See Chapter 6 of Russell and Norvig.
Logical functors and connectives. Negation: ¬ The function of the negation is to reverse the truth value of a given propositions (sentence). If A is true,
Logics for Data and Knowledge Representation
Propositional Equivalences
CS 220: Discrete Structures and their Applications
Formal Methods in Software Engineering
Associativity of Equivalence
Logical and Rule-Based Reasoning Part I
A THREE-BALL GAME.
Presentation transcript:

A is a knight:A A eats his hat:H

A is a knight:A A eats his hat:H If I am a knight then I’ll eat my hat: A  H

We have seen that (X  S) Therefore (A  A  H) Objective is to logically deduce H

AH A  HA  (A  H) Truth Table Columns

Proof Using Truth Table AH A  H TTT FTT TFF FFT

Proof Using Truth Table A A  HA  (A  H) TTT FTF TFF FTF

Proof Using Truth Table AH A  HA  (A  H) TTTT FTTF TFFF FFTF

Proof using equivalences A  (A  H)  A  (not A or H)  (A and (not A or H)) or (not A and not (not A or H))

Proof using equivalences A and (not A or H)  (A and not A) or (A and H)  false or (A and H)  A and H

Proof using equivalences not A and not (not A or H)  not A and (A and not H)  (not A and A) and not H  false and not H  false

Proof using equivalences Hence A  (not A or H)  (A and H) or false  A and H

Rules of Inference and Logical Deduction Introduction Elimination

Rules of Inference and Logical Deduction Introduction p q ______________ p and q

Rules of Inference and Logical Deduction Introduction p q ___________________ p or q

Rules of Inference and Logical Deduction Elimination p and q ___________________ p q

Rules of Inference and Logical Deduction Introduction [p] q ______________ p  q

Rules of Inference and Logical Deduction Elimination p p  q ______________________ q

Rules of Inference and Logical Deduction Elimination p not p false ____________________ _______________ false p

Does the Superman Exist? If Superman were able and willing to prevent evil, he would do so. If Superman were unable to prevent evil, he would be incapable; if he were unwilling to prevent evil, he would be malevolent. Superman does not prevent evil. If Superman exists, he is neither incapable nor malevolent. Therefore Superman does not exist.

Inference and deduction Superman existsX Superman is willing to prevent evilW Superman is able to prevent evilA Superman is malevolentM Superman is incapableI Superman prevents evilE

Inference and Deduction Our objective is to prove the proposition: ((W and A)  E) and ((not A)  I) and ((not W)  M) and (not E) and (X  not (I or M))  not X

1.Assume ((W and A)  E) and ((not A)  I) and ((not W)  M) and (not E) and (X  not (I or M)) The objective is now to prove not X

2.Assume X

Use Elimination Rules to break No. 1 down into 5 premises 3.(W and A)  E 4.(not A)  I 5.(not W)  M 6.not E 7.X  not (I or M)

Now application of elimination on 2 and 7 derives another simple proposition 2. Assume X 7. X  not (I or M) 8.not (I or M)

Now application of elimination on 2 and 7 derives another simple proposition 2. Assume X 7. X  not (I or M) 8.not (I or M) Now proving I or M will result in a contradiction

We will now analyze W 9. Assume not W 10. M(from 5 and 9) 11. I or M(from 10 - introduction)

12. Assume W 13. Assume A 14. W and A(12 and 13) 15. E(3 and 14) 16. false(6 and 15) 17. I or M(16)

18. Assume not A 19. I(4 and 18) 20. I or M(19) 21. I or M(17 and 20) 22. I or M(11 and 21) 23. false (contradiction 8 and 22) 24. not X(2 and 23)

Logic problem for the day On the island of knights and knaves, it is rumored that there is gold buried on the island. You ask one of the natives, A, whether there is gold on the island. He makes the following response: “There is gold on this island if and only if I am a knight.”

Logic problem for the day On the island of knights and knaves, it is rumored that there is gold buried on the island. You ask one of the natives, A, whether there is gold on the island. He makes the following response: “There is gold on this island if and only if I am a knight.” The problem is as follows: a)Can it be determined whether A is a knight or a knave? b)Can it be determined whether there is gold on the island?