Thinking Mathematically Compound Statements and Connectives.

Slides:



Advertisements
Similar presentations
Geometry Logic.
Advertisements

Truth Tables How to Make and Use. Making a Truth Table To determine the number of rows other than the heading row. To determine the number of rows other.
Today’s Topics Logical Syntax Logical Syntax o Well-Formed Formulas o Dominant Operator (Main Connective) Putting words into symbols Putting words into.
2-1 Making Decisions Sample assignment statements PayAmount = Hours * Rate PayAmount = 40*Rate + (Hours – 40)*Rate*1.5.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
3.2 – Truth Tables and Equivalent Statements
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.4 Equivalent Statements.
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
Chapter 2 Reasoning and Proof. AIM: Introduction to Logic What types of statements are considered mathematical ? Statements in which truth value (either.
Thinking Mathematically Logic 3.2 Compound Statements and Connectives.
Logic Geometry Unit 11, Lesson 5 Mrs. Reed. Definition Statement – a sentence that is either true or false. Example: There are 30 desks in the room.
2.2 Statements, Connectives, and Quantifiers
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Objectives 1. Statements, quantifiers, and compound statements 2. Statements involving the words not,
Discrete Mathematics Lecture1 Miss.Amal Alshardy.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
Conjunction A conjunction is a compound statement formed by combining two simple sentences using the word “AND”. A conjunction is only true when both.
Objectives: To solve and graph simple and compound inequalities.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.1, Slide Logic The Study of What’s True or False or Somewhere in Between.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.1, Slide Logic The Study of What’s True or False or Somewhere in Between.
Thinking Mathematically Logic 3.5 Equivalent Statements and Variation of Conditional Statements.
Thinking Mathematically Equivalent Statements, Conditional Statements, and De Morgan’s Laws.
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.
Thinking Mathematically
COMP 170 L2 Part 3 of Course Chapter 3 of Textbook.
3.1 Statements and Quantifiers 3.2 Truth Tables.  A statement is a declarative sentence that is either true or false.  Examples: Mr. Healey is my math.
Thinking Mathematically Statements, Negations, and Quantified Statements.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic.
9.2 Compound Sentences Standard 5.0, 24.0 Standard 5.0, 24.0 Two Key Terms Two Key Terms.
Symbolic Logic The Following slide were written using materials from the Book: The Following slide were written using materials from the Book: Discrete.
Review Find a counter example for the conjecture Given: JK = KL = LM = MJ Conjecture: JKLM forms a square.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
INTRODUCTION TO LOGIC. PURPOSE: – To distinguish good arguments from poor ones Arguments consist of STATEMENTS – A statement is a sentence that can be.
Simple Logic.
Introduction to Logic © 2008 Pearson Addison-Wesley.
Presented by: Tutorial Services The Math Center
AND.
DISCRETE MATHEMATICS CHAPTER I.
Thinking Mathematically
Truth Tables and Equivalent Statements
CHAPTER 3 Logic.
Truth Tables for Negation, Conjunction, and Disjunction
Sequence, Selection, Iteration The IF Statement
Chapter 3: Introduction to Logic
Conditional Statements
Truth Tables for Negation, Conjunction, and Disjunction
Discrete Mathematics Lecture # 2.
Mathematics for Computing
2 Chapter Introduction to Logic and Sets
Information Technology Department
2-1 Making Decisions Sample assignment statements
Drawing and Supporting Conclusions
(1.4) An Introduction to Logic
Available at © University of Florida 2009.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Lecture 2: Propositional Logic
Discrete Mathematics Lecture 2: Propositional Logic
Statements of Symbolic Logic
Thinking Mathematically
CHAPTER 3 Logic.
Algebra 1 Section 4.5.
Truth tables Mrs. Palmer.
Section 3.3 Truth Tables for the Conditional and Biconditional
Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction
Truth Tables for the Conditional and Biconditional
CHAPTER 3 Logic.
A3 2.1d To Solve Compound Inequalities
CHAPTER 3 Logic.
boolean Expressions Relational, Equality, and Logical Operators
Presentation transcript:

Thinking Mathematically Compound Statements and Connectives

“Compound” Statements Simple statements can be connected with “and”, “Either … or”, “If … then”, or “if and only if.” These more complicated statements are called “compound.” Examples “Miami is a city in Florida” is a true statement. “Atlanta is a city in Florida” is a false statement. “Either Miami is a city in Florida or Atlanta is a city in Florida” is a compound statement that is true. “Miami is a city in Florida and Atlanta is a city in Florida” is a compound statement that is false.

“And” Statements When two statements are represented by p and q the compound “and” statement is p /\ q. p: Harvard is a college. q: Disney World is a college. p/\q: Harvard is a college and Disney World is a college. p/\~q: Harvard is a college and Disney World is not a college.

“Either... or” Statements When two statements are represented by p and q the compound “Either... or” statement is p\/q. p: The bill receives majority approval. q: The bill becomes a law. p\/q: The bill receives majority approval or the bill becomes a law. p\/~q: The bill receives majority approval or the bill does not become a law.

“If... then” Statements When two statements are represented by p and q the compound “If... then” statement is: p  q. p: Ed is a poet. q: Ed is a writer. p  q: If Ed is a poet, then Ed is a writer. q  p: If Ed is a writer, then Ed is a poet. ~q  ~p: If Ed is not a writer, then Ed is not a Poet

“If and only if” Statements When two statements are represented by p and q the compound “if and only if” statement is: p  q. p: The word is set. q: The word has 464 meanings. p  q: The word is set if and only if the word has 464 meanings. ~q  ~p: The word does not have 464 meanings if and only if the word is not set.

Symbolic Logic Statements of Logic NameSymbolic Form Negation~p Conjunctionp/\q Disjunctionp\/q Conditionalp  q Biconditionalp  q