Let Q be the question Let A be “the native is a knight”

Slides:



Advertisements
Similar presentations
AE1APS Algorithmic Problem Solving John Drake. The island of Knights and Knaves is a fictional island to test peoples ability to reason logically. There.
Advertisements

Solving Word Problems II
The Island of Knights and Knaves. Knights always tell the truth.
Island of Knights and Knaves Jack says: “At least one of us is a knave.” Question: Is Jack a knight or knave? What about Jill? Answer: If Jack is a knave,
Some Puzzles About Truth (and belief, knowledge, opinion, and lying)
The Island of Knights and Knaves. Raymond Smullyan 1978 A little learning is a dangerous thing; Drink deep, or taste not the Pierian spring: There shallow.
AE1APS Algorithmic Problem Solving John Drake.  Invariants – Chapter 2  River Crossing – Chapter 3  Logic Puzzles – Chapter 5 (13) ◦ Knights and Knaves.
MORE Theorems Relating Lines and Planes
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
Logical Puzzles Truth and Lies. The Island of Rilas On the island of Rilas there are just two types of people: knights and knaves Knights always tell.
Lecture 5 Knights and Knaves.. Administration Show hand in form. Show plagiarism form. Any problems with coursework? Google knight and knaves and look.
Chapter 1: The Foundations: Logic and Proofs
“I am the way and the truth and the life. No one comes to the Father except through me” John 14:6.
Conditions in Java. First…Boolean Operators A boolean data type is always true or false. Boolean operators always return true or false For example: (x.
Divide Rational Numbers. Objective The student will be able to:
What is gossip? When people spread rumors about another person it is called gossip. Gossip is talking about something that is not your problem.
Thinking Mathematically Statements, Negations, and Quantified Statements.
Lesson 1.4 Equations and Inequalities Goal: To learn how to solve equations and check solutions of equations and inequalities.
Lecture Coursework 2 AGAIN. Rectangle Game Look at proof of matchsticks A rectangular board is divided into m columns by n rows. The area of the board.
Dr. Naveed Riaz Design and Analysis of Algorithms 1 1 Formal Methods in Software Engineering Lecture # 25.
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.
Lecture Coursework 2. Rectangle Game Look at proof of matchsticks Read thru the question. A rectangular board is divided into m columns by n rows. The.
Truth Tables for Negation, Conjunction, and Disjunction
Three in One St Patrick's Day.
Propositional Equivalences
CS344: Introduction to Artificial Intelligence (associated lab: CS386)
How confidence intervals work
Truth Tables and Equivalent Statements
Lesson 3.1: Solving Equations using Addition or Subtraction
7/3/2018 EMR 17 Logical Reasoning Lecture 11.
“I am the way and the truth and the life
Liar liar.
Logic – Bell Ringer.
Factors, multiple, primes: Factors from prime factors
“Some”s and “All”s By Linda Perel 10-02, last updt
“‘Yes Lord,’ Peter said, ‘you know that I love you.’”
Applications of Propositional Logic
Who Wants To Be A Millionaire?
Adding & Subtracting Integers
Solving Equations with Variables on Both Sides Day 2
CS 220: Discrete Structures and their Applications
Equations and Inequalities
TRUTH TABLES.
Propositional Logic.
Solving Equations with Variables on Both Sides
Find the reference angle for the angle measuring {image}
There are infinite solutions to the system.
Formal Methods in Software Engineering
Associativity of Equivalence
Knights and Knaves.
Philosophical Methods
Starter Which pair of lines are parallel?
B2 [accelerated] Ms. Wright had her purse stolen. The thief was either Rebecca, Emily, Bryan, Jimmy, or Allie. When questioned each student said the.
Discrete Structures Prepositional Logic 2
Variables and Equations
Solving Inequalities.
Logical and Rule-Based Reasoning Part I
Transposition (p > q) : : ( ~ q > ~ p) Negate both statements
Solving Equations with Variables on Both Sides Day 2
7.NS.1 Positive and Negative Numbers
Challenge #2: That’s Not Funny!
A THREE-BALL GAME.
THE LAWS OF LOGIC Let’s be reasonable!.
Factors, multiple, primes: Multiples
Multiplying Fractions: Visual Fraction Models
Solving Linear Equations
Standard form: In standard form?
True or False True or False
Coordinates: Naming 2D coordinates – quadrant 1
Presentation transcript:

Let Q be the question Let A be “the native is a knight” Let L be “the left fork leads to the restaurant”

Let Q be the question Let A be “the native is a knight” Let L be “the left fork leads to the restaurant” The response to the question Q is yes is equivalent to Q  A

Let Q be the question Let A be “the native is a knight” Let L be “the left fork leads to the restaurant” The response to the question Q is yes is equivalent to Q  A So we require that: L  Q  A or Q  (L  A )

Let Q be the question Let A be “the native is a knight” Let L be “the left fork leads to the restaurant” The response to the question Q is yes is equivalent to Q  A So we require that: L  Q  A or Q  (L  A ) Is the statement that the left fork leads to the restaurant equivalent to your being a knight?

Negation p  p  false p  (p  false) (p  p)  false

Negation p  p  false p  (p  false) (p  p)  false p  p  q  p  r  q p  p  p  q  q  r true  p  false  r p   r

There are two natives A and B There are two natives A and B. A says, “B is a knight is the same as I am a knave.” What can you determine about A and B?

There are two natives A and B There are two natives A and B. A says, “B is a knight is the same as I am a knave.” What can you determine about A and B? A’s statement is: B   A

There are two natives A and B There are two natives A and B. A says, “B is a knight is the same as I am a knave.” What can you determine about A and B? A’s statement is: B   A So, we have: A  B   A A   A  B false  B  B A?

Golden Rule p  q  p  q  p  q

Implication p  q  p  p  q p  q  q  p  q

If I am a knight, B is a knight A  B

If I am a knight, B is a knight A  B A  A  B A  A  A  B A  B

Three of the inhabitants – A, B, and C – were standing together in a garden. A stranger passed by and asked A, “Are you a knight or a knave?” A answered but the stranger could not understand. The stranger then asked B, “What did A say?”. B replied, “A said that he is a knave”. At this point, the third C, said, “Don’t believe B; he is lying!” What are A, B, and C?

B’s statement is: A   A

B’s statement is: A   A C’s statement is:  B

B’s statement is: A   A C’s statement is:  B So, we have: (B  A   A)  (C   B)

B’s statement is: A   A C’s statement is:  B So, we have: (B  A   A)  (C   B)  B  (C   B) ( B  C)  ( B   B) ( B  C)   B  B  C

A says, either I am a knave or B is a knight

A says, either I am a knave or B is a knight A   A  B A  (A  false ) B A  (A  B  false  B) A  A  B  B

A says, either I am a knave or B is a knight A   A  B A  (A  false ) B A  (A  B  false  B) A  A  B  B A  B