Solution to Problem 2.24 ECS 101 Lab 4.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Truth Functional Logic
MAT 142 Lecture Video Series. Symbolic Logic Objectives Determine if a sentence or question is a statement or not. Write a sentence that represents the.
Symbolic Logic: Conjunction • , Negation ~, Disjunction v
Symbolic Logic. Objectives Determine if a sentence or question is a statement or not. Write a sentence that represents the negation of a given statement.
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
1.2 – Open Sentences and Graphs
Solving Compound Inequalities 1. Solve compound inequalities containing the word and then graph the solution. 2. Solve compound inequalities containing.
Algebra 1 Chapter 3 Section 7.
Predicates and Quantifiers
 This rocket can fly the same distance each day.  So on the first day if it travelled 2 space miles,the second day it will have travelled 4 miles. 
Chapter 1 Logic Section 1-1 Statements Open your book to page 1 and read the section titled “To the Student” Now turn to page 3 where we will read the.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
Compound Inequalities “And” & “Or” Graphing Solutions.
1.6 Compound and Absolute Value Inequalities Compound inequalities are just more than one inequality at the same time. Sometimes, they are connected by.
Objectives: To solve and graph simple and compound inequalities.
Original Material © Cambridge University Press 2010 Decide if these statements are true or false. Give some examples if you can.  The last digit of a.
Computer Science: A Structured Programming Approach Using C1 5-2 Two-Way Selection The decision is described to the computer as a conditional statement.
Computer Science: A Structured Programming Approach Using C1 5-2 Two-Way Selection The decision is described to the computer as a conditional statement.
5.2: Solving Systems of Equations using Substitution
InequalitiesInequalities. An inequality is like an equation, but instead of an equal sign (=) it has one of these signs: Inequalities work like equations,
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
Lesson 1.4 Equations and Inequalities Goal: To learn how to solve equations and check solutions of equations and inequalities.
Holt McDougal Algebra Solving Absolute-Value Inequalities Solve compound inequalities in one variable involving absolute-value expressions. Objectives.
1 Section 6.2 Propositional Calculus Propositional calculus is the language of propositions (statements that are true or false). We represent propositions.
Analyzing Arguments Section 1.5. Valid arguments An argument consists of two parts: the hypotheses (premises) and the conclusion. An argument is valid.
Discrete Mathematics Lecture # 4. Conditional Statements or Implication  If p and q are statement variables, the conditional of q by p is “If p then.
3.3 – The Conditional A conditional statement is a compound statement that uses the connective if…then. The conditional is written with an arrow, so “if.
WARM UP Graph the following inequalities: a. x ≤ 1 b. x < 2 3. – 4x – 3 < (1 – x ) ≥ 3.
Introduction to Logic © 2008 Pearson Addison-Wesley.
Truth Tables for Negation, Conjunction, and Disjunction
Presented by: Tutorial Services The Math Center
8.1 Determine whether the following statements are correct or not
AND.
Objectives Solve compound inequalities in one variable involving absolute-value expressions. When an inequality contains an absolute-value expression,
EQUATION IN TWO VARIABLES:
DISCRETE MATHEMATICS CHAPTER I.
Solving Compound Inequalities
Truth Tables and Equivalent Statements
Truth Tables for Negation, Conjunction, and Disjunction
1-5 Equations Goals: Solve equations with one variable
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
6-2 Solving Systems using Substitution
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
3.5 Symbolic Arguments.
Solving and Simplifying
TRUTH TABLES.
Discrete Mathematics Lecture # 8.
Algebra 1 Section 4.4.
Objectives Solve compound inequalities in one variable involving absolute-value expressions.
5-4 Compound Inequalities
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Find the reference angle for the angle measuring {image}
SECTION 2-4 : SOLVING EQUATIONS WITH THE VARIABLE ON BOTH SIDES
Section 3.7 Switching Circuits
Predicates and Quantifiers
Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction
Homework YWBAT recognize and describe the layers of the Earth.
Solving for x and y when you have two equations
Truth Tables for the Conditional and Biconditional
LI4 Inequalities- True or False?.
CHAPTER 3 Logic.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
True or False True or False
3.5 Symbolic Arguments.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
The return Statement © 2018 Kris Jordan.
Presentation transcript:

Solution to Problem 2.24 ECS 101 Lab 4

Solution to 2.24 Lets look at a problem that includes: Connectives in Compound Statements Arguments using previous Conclusions

Do Martians have three heads? Are they green? Can they fly? When the first astronaut to visit the planet Mars returned to Earth, he was asked to describe the inhabitants of the “red planet." Still suffering from the effects of interplanetary travel, he answered in the following correct, but confusing, manner:  "It is not true that if Martians are green then they either have three heads or else they cannot fly, unless it is also true that they are green if and only if they can fly and that they do not have three heads."  Assume that all Martians look alike and that they have at least one of the three characteristics referred to.

How do we solve the problem? Lets define a set of statements whose truth values will represent the solution. g : Martians are green. h : Martians have three heads. f : Martians can fly. Now take the astronaut’s statement and represent it symbolically:

Use a Symbolic Representation "It is not true that if Martians are green (g) then (->) they either have three heads (h) or else they cannot fly (~f), unless it is also true that (->) they are green (g) if and only if (<->) they can fly (f) and that they do not have three heads (~h).“ [ g -> ( h OR ( ~f ) ) ] -> [ ( g <-> f ) AND ( ~h ) ] THIS IS A COMPOUND STATEMENT.

Use Previous Conclusions Looking at the expression: [ g -> ( h OR ( ~f ) ) ] -> [ ( g <-> f ) AND ( ~h ) ] From Conclusion If 4: Either [ g -> ( h OR ( ~f ) ) ] is false, Or [ ( g <-> f ) AND ( ~h ) ] is true.

If [ g -> ( h OR ( ~f ) ) ] is false From Conclusion If 5: g must be true, and h OR (~f) must be false. For the second result we use Condition Or 1: h must be false. (~f) must be false. Therefore, f must be true.

If [ ( g <-> f ) AND ( ~h ) ] is true From Conclusion And 1: g <-> f must be true, and (~h) must be true. Therefore h must be false. For the first result, we use Condition Bi 1: g must be true. f must be true.

Compare Results Both alternatives have the same results: g must be true. h must be false. f must be true. So we have solved the problem: Martians are green. Martians do not have three heads. Martians can fly.