HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.1 Logic Statements.

Slides:



Advertisements
Similar presentations
Logic The study of correct reasoning.
Advertisements

04 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Goals Determine the true value of statements with AND, OR, IF..THEN. Negate statements with the connectives above Construct truth tables Understand when.
1.1 a Introduction to Logic. Problem of the Day The weather at the Cape of Good Hope makes it a notorious location where many ships have been lost to.
Copyright © 2015, 2011, 2008 Pearson Education, Inc. Chapter 1, Unit 1B, Slide 1 Thinking Critically 1.
Logic 1 Statements and Logical Operators. Logic Propositional Calculus – Using statements to build arguments – Arguments are based on statements or propositions.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
SEVENTH EDITION and EXPANDED SEVENTH EDITION
Copyright © Cengage Learning. All rights reserved.
Statements and Quantifiers
Copyright © Cengage Learning. All rights reserved.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Adapted from Discrete Math
Lecture 8 Introduction to Logic CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Propositions and Truth Tables
Discrete Mathematics and Its Applications
HAWKES LEARNING SYSTEMS Students Matter. Success Counts. Copyright © 2013 by Hawkes Learning Systems/Quant Systems, Inc. All rights reserved. Section 1.1.
Lecture for Week Spring.   Introduction to Propositional Logic  Types of Proposition  Operator and Truth table Agenda.
Chapter 1: The Foundations: Logic and Proofs
Chapter 2 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
HAWKES LEARNING SYSTEMS Students Matter. Success Counts. Copyright © 2013 by Hawkes Learning Systems/Quant Systems, Inc. All rights reserved. Section 2.3.
HAWKES LEARNING SYSTEMS Students Matter. Success Counts. Copyright © 2013 by Hawkes Learning Systems/Quant Systems, Inc. All rights reserved. Section 2.5.
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
Chapter 1 Section 1.2 Symbolic Logic. Sentences vs Statements A truth value is one of two words either true (T) or false (F). A statement is a particular.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.7 Switching Circuits.
2.2 Statements, Connectives, and Quantifiers
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Objectives 1. Statements, quantifiers, and compound statements 2. Statements involving the words not,
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 1.1 Thinking Mathematically.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.2 Truth Tables.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
MATH 110 Sec 3-1 Lecture on Statements and Connectives STATEMENT: A declarative sentence that is either TRUE or FALSE (but not both at once).
MMiG2 b – Converses and conditional statements
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.3 Logical Equivalence.
Thinking Mathematically
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.
1 Propositional Logic Introduction. 2 What is propositional logic? Propositional Logic is concerned with propositions and their interrelationships. 
Logical Operations – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Logical Operations Reading: Kolman, Section 2.1.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Chapter 3 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Thinking Mathematically Statements, Negations, and Quantified Statements.
DEE: If you think we're wax-works, you ought to pay, you know. Wax-works weren't made to be looked at for nothing. Nohow. DUM: Contrariwise, if you think.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Learning Objectives  To define a proposition  To form a compound proposition using connectives  To determine the truth values of compound propositions.
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 01: Boolean Logic Sections 1.1 and 1.2 Jarek Rossignac.
CS104 The Foundations: Logic and Proof 1. 2 What is Discrete Structure?  Discrete Objects  Separated from each other (Opposite of continuous)  e.g.,
Propositional and predicate logic
Law of logic Lecture 4.
Chapter 1 Propositional Logic
Logic The study of correct reasoning.
Logic.
AND.
CSNB 143 Discrete Mathematical Structures
Truth Tables and Equivalent Statements
CHAPTER 3 Logic.
Chapter 3: Introduction to Logic
Geometry Pre-AP BOMLA LacyMath 10/6.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Section 3.1 Statements and Logical Connectives
1 Chapter An Introduction to Problem Solving
Logic Math Studies IB Propositions, truth tables, logic symbols, negation, conjunction, disjunction.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Lecture 2: Propositional Logic
1 Chapter An Introduction to Problem Solving
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Statements and Logical Connectives
8A, 8B Propositions Unit 7: Logic and Sets 8A, 8B 6/1/ :59 AM.
CHAPTER 3 Logic.
Presentation transcript:

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.1 Logic Statements and Their Negations

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Objectives o Construct statements using logic symbols

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Mathematical Logic Our ordinary English language is littered with opinions, sarcasm, riddles, commandments, and the list goes on. Because of this, it is often difficult to determine the validity of many of the things we hear day to day. However, there are times when we want to determine with certainty if statements are not only factually true, but also logically true. Mathematical logic provides a consistent framework in which to evaluate claims for logical truth.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Statement A statement is a complete sentence that asserts a claim that is either true or false, but not both at the same time. The following sentences are examples of mathematical statements. They are represented by lowercase letters, as is the practice in mathematical logic. a: The car is blue and the cat is black b: The first even number is 2.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Paradox A paradox is a sentence that contradicts itself and therefore has no single truth value. A paradox cannot be a mathematical statement.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 1: Identifying Statements Determine if the following sentences are statements. a: It is raining outside. b: Beaches are the most beautiful place to vacation. c: Today is Monday. d: Today is Monday and tomorrow is Friday. e: I lie all the time.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 1: Identifying Statements (cont.) Solution Sentence a is a statement because it can be assigned a truth value depending on the weather outside. However, sentence b is an opinion, and therefore not a statement. Sentence c is a statement since it can be either true or false, depending on the current day the statement is read. Sentence d is a statement even though it is always false. And finally, sentence e is a paradox and not a statement since it contradicts itself and therefore has no truth value.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Skill Check #1 Write down two statements of your own: one that is always true and one that is always false. Answer: Answers will vary.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Negation The negation of a statement is the logical opposite of that statement, or its denial. Negations always have the opposite truth value of the original statement. Consider the following statement and its negation noted by the symbol ~, read as “not.” e: 5 is a prime number.(True) ~e: 5 is not a prime number. (False)

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Negating Statements with Quantifiers Sometimes it takes a bit more thought to negate a statement in English. This is true when the statement contains words that are quantifiers such as all, some, none, or no. The table gives us ways to negate these quantifiers. Table 1: Negating Quantifiers QuantifierNegations All areNot all are; Some are not; At least one is not Some areNone are Some are notAll are None areThere is at least one that is; Some are

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 2: Negating a Statement Negate the following statements. a: Melony is wearing a red raincoat. b: The door is not closed. c: None of the tourists brought raincoats. d: I run less than Cara.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 2: Negating a Statement (cont.) Solution ~ a:Melony is not wearing a red raincoat. ~ b: The door is not not closed. However, when we negate a negation, we are back to no negation at all. So we more commonly say, “The door is closed.” ~ c: Some of the tourists brought raincoats.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 2: Negating a Statement (cont.) ~ d: I do not run less than Cara. Notice that we could also write, “I run the same as or more than Cara.” We need both parts since the opposite of “less than” is “more than or equal to.”

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Skill Check #2 Negate the following statement. Some of the students completed their assignments. Answer:None of the students completed their assignments.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Compound Statement A compound statement is composed of two or more statements joined together using connective words such as and, or, or implies. When combining two or more statements together to form a compound statement using the word and, the symbol ∧ is used between the lower case letters for the two statements, as in p ∧ q.p ∧ q. When combining two or more statements together using the connecting word or, the symbol ∨ is used, as in p ∨ q.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 3: Using Logic Symbols for Compound Statements Involving and Use the following simple statements a and b to symbolically write the given compound statement c. a: Snow is falling. b: The sun is shining. c: Snow is falling and the sun is shining.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 3: Using Logic Symbols for Compound Statements Involving and (cont.) Solution c = Snow is falling and the sun is shining. = (Snow is falling) AND (The sun is shining) = (Snow is falling) ∧ (The sun is shining) = a ∧ b

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Compound Statements Involving or There are two ways to think about the word or. If the meaning intended is one or the other, but not both, this is referred to as an exclusive or. If the intended meaning is that either or both of the statements can be true, this is known as the inclusive or. Note: The inclusive or is what is used in mathematical logic.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 4: Using Logic Symbols for Compound Statements Involving or Use the following statements p and q to symbolically write the given compound statement r. p: He will go to the movies tonight. q: He will stay home to give the dog a bath tonight. r : He will go to the movies tonight or he will stay home to give the dog a bath tonight.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 4: Using Logic Symbols for Compound Statements Involving or (cont.) Solution r = He will go to the movies tonight or he will stay home to give the dog a bath tonight. = (He will go to the movies tonight) OR (He will stay home to give the dog a bath tonight) = (He will go to the movies tonight) ∨ (He will stay home to give the dog a bath tonight) = p ∨ q

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Logic Symbols for Compound Statements Involving Implications Two statements can be joined together using the sentence structure “if a, then b.” We call this type of combination an implication because statement a implies statement b. Both “a implies b” and “if a, then b” have identical meanings in the English language. Mathematically we use a ⇒ b to symbolically represent “if a, then b.”

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 5: Using Logic Symbols for Compound Statements Involving Implications Use the following statements s and t to symbolically write the given compound statement q. s: The water temperature on Saturday is below 76.2°. t: You are allowed to wear a wetsuit in the triathlon. q: If the water temperature on Saturday is below 76.2°, then you are allowed to wear a wetsuit in the triathlon.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 5: Using Logic Symbols for Compound Statements Involving Implications (cont.) Solution q= If the water temperature on Saturday is below 76.2°, then you are allowed to wear a wetsuit in the triathlon. = If (the water temperature on Saturday is below 76.2°), then (you are allowed to wear a wetsuit in the triathlon). = If (s), then (t). = s ⇒ t

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Summary of Logic Symbols Table 2: Logic Symbols SymbolRead ∧ And ∨ Or ~Not ⇒ Implies

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Skill Check #3 Write the following compound statements mathematically given the simple statements a, b, and c. a: I am hungry. b: I am tired. c: I am in college. 1. I am hungry and tired. 2. I am hungry or I am in college. 3. I am tired and not in college.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Skill Check #3 Answer: 1. a ∧ b 2. a ∨ c 3. b ∧ ~c