Copyright 2013, 2010, 2007, Pearson, Education, Inc. Objectives 1. Statements, quantifiers, and compound statements 2. Statements involving the words not,

Slides:



Advertisements
Similar presentations
Statements, Connectives, and Quantifiers
Advertisements

Symbolic Logic: The Language of Modern Logic
Chapter Two Symbolizing in Sentential Logic This chapter is a preliminary to the project of building a model of validity for sentential arguments. We.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
 LOGIC. Use of deductive reasoning to come to a conclusion given a set of information.
Copyright © Cengage Learning. All rights reserved. CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
1 Section 1.1 Logic. 2 Proposition Statement that is either true or false –can’t be both –in English, must contain a form of “to be” Examples: –Cate Sheller.
SEVENTH EDITION and EXPANDED SEVENTH EDITION
First Order Logic. Propositional Logic A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not.
Adapted from Discrete Math
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
Propositions and Truth Tables
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.4 Equivalent Statements.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
2009/9 1 Logic and Proofs §1.1 Introduction §1.2 Propositional Equivalences §1.3 Predicates and Quantifiers §1.4 Nested Quantifiers §1.5~7 Methods of Proofs.
Discrete Mathematics and Its Applications
CS 285- Discrete Mathematics Lecture 2. Section 1.1 Propositional Logic Propositions Conditional Statements Truth Tables of Compound Propositions Translating.
Chapter 2 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Thinking Mathematically Logic 3.2 Compound Statements and Connectives.
2.2 Statements, Connectives, and Quantifiers
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.1 Logic Statements.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
Logic. Statements, Connectives, and Quantifiers In symbolic logic, we only care whether statements are true or false – not their content. In logic, a.
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.
Lecture 4. CONDITIONAL STATEMENTS: Consider the statement: "If you earn an A in Math, then I'll buy you a computer." This statement is made up of two.
CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.
LOGIC Lesson 2.1. What is an on-the-spot Quiz  This quiz is defined by me.  While I’m having my lectures, you have to be alert.  Because there are.
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.
Logic. Statements, Connectives, and Quantifiers In symbolic logic, we only care whether statements are true or false – not their content. In logic, a.
Chapter 1: The Foundations: Logic and Proofs
Chapter 3 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
رياضيات متقطعة لعلوم الحاسب MATH 226. Text books: (Discrete Mathematics and its applications) Kenneth H. Rosen, seventh Edition, 2012, McGraw- Hill.
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.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
CS104 The Foundations: Logic and Proof 1. 2 What is Discrete Structure?  Discrete Objects  Separated from each other (Opposite of continuous)  e.g.,
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
Simple Logic.
Introduction to Logic © 2008 Pearson Addison-Wesley.
Logic.
AND.
CHAPTER 3 Logic.
Truth Tables and Equivalent Statements
Truth Tables for Negation, Conjunction, and Disjunction
Truth Tables for Negation, Conjunction, and Disjunction
3.1 Statements, Negations, and Quantified Statements
Truth Tables – Logic (Continued)
The Boolean Connectives
The Foundations: Logic and Proofs
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
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
(1.4) An Introduction to Logic
Discrete Mathematics and Its Applications Kenneth H
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
CHAPTER 3 Logic.
Thinking Mathematically
CHAPTER 3 Logic.
Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction
Statements and Logical Connectives
8A, 8B Propositions Unit 7: Logic and Sets 8A, 8B 6/1/ :59 AM.
Presentation transcript:

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Objectives 1. Statements, quantifiers, and compound statements 2. Statements involving the words not, and, or, if … then, and if and only if 3. Express compound statements in symbolic form. 4. Express symbolic statements with parentheses in English. 5. Use the dominance of connectives Section 3.1: Logic

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Statements Commands, questions, and opinions, are not statements because they are neither true or false. London is the capital of England Titanic is the greatest movie of all time. William Shakespeare wrote the last episode of The Sopranos. If I start losing my memory, how will I know? Read pages 23 – Statement Not a Statement Statement Not a Statement

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Using Symbols to Represent Statements In symbolic logic, we use lowercase letters such as p, q, r, and s to represent statements. p: London is the capital of England q: William Shakespeare wrote the last episode of The Sopranos. 3

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Negating Statements The negation of a statement has a meaning that is opposite that of the original meaning. The negation of a true statement is a false statement and the negation of a false statement is a true statement 4

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Forming Negations Form the negation of each statement (two different ways): a. Shakespeare wrote the last episode of The Sopranos. i. Shakespeare did not write the last episode of The Sopranos. ii. It is not true that Shakespeare wrote the last episode of The Sopranos. b. Today is not Monday. i. It is not true that today is not Monday. ii. Today is Monday. 5

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Expressing Negations Symbolically Let p and q represent the following statements: p: Shakespeare wrote the last episode of The Sopranos. q: Today is not Monday. Express each of the following statements symbolically: a. Shakespeare did not write the last episode of The Sopranos. ~p b. Today is Monday. ~q 6

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Quantified Statements Quantifiers: The words all, some, and no (or none). Statements containing a quantifier: All poets are writers. Some people are bigots. No math books have pictures. Some students do not work hard. 7

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Equivalent Ways of Expressing Quantified Statements 8 StatementAn Equivalent Way to Express the Statement Example (Two Equivalent Quantified Statements) All A are B. Some A are B. No A are B. Some A are not B. There are no A that are not B. There exists at least One A that is a B. All A are not B. Not all A are B. All poets are writers. There are no poets that are not writers. Some people are bigots. At least one person is a bigot. No common colds are fatal. All common colds are not fatal. Some students do not work hard. Not all students work hard.

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Negation of Quantified Statements The statements diagonally opposite each other are negations. Here are some examples of quantified statements and their negations: 9

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Simple and Compound Statements Simple statements convey one idea with no connecting words. Compound statements combine two or more simple statements using connectives. Connectives are words used to join simple statements. Examples are: and, or, if…then, and if and only if. 10

Copyright 2013, 2010, 2007, Pearson, Education, Inc. And Statements If p and q are two simple statements, then the compound statement “p and q” is symbolized by p  q. The compound statement formed by connecting statements with the word and is called a conjunction. The symbol for and is ˄. 11

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 1: Translating from English to Symbolic Form Let p and q represent the following simple statements: p: It is after 5 P.M. q: They are working. Write each compound statement below in symbolic form: a. It is after 5 P.M. and b. It is after 5 P.M. and they are working. they are not working. a. p ^ qb. p ^ ~ q 12

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Common English Expressions for p  q 13 Note: and can be replaced by but, yet, however, nevertheless

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Or Statements The connective or can mean two different things. Consider the statement: I visited London or Paris. This statement can mean (exclusive or) I visited London or Paris but not both. It can also mean (inclusive or) I visited London or Paris or both. 14

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Or Statements Disjunction is a compound statement formed using the inclusive or represented by the symbol . Thus, “p or q or both” is symbolized by p  q. 15

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 2: Translating from English to Symbolic Form Let p and q represent the following simple statements: p: The bill receives majority approval. q: The bill becomes a law. Write each compound statement below in symbolic form: a. The bill receives majority approval or the bill becomes a law. Solution: p  q b. The bill receives majority approval or the bill does not become a law. Solution: p  ~q 16

Copyright 2013, 2010, 2007, Pearson, Education, Inc. If -Then Statements The compound statement “If p, then q is symbolized by p  q. This is called a conditional statement. The statement before the  is called the antecedent. The statement after the  is called the consequent. 17

Copyright 2013, 2010, 2007, Pearson, Education, Inc. If -Then Statements This diagram shows a relationship that can be expressed 3 ways: All poets are writers. There are no poets that are not writers. If a person is a poet, then that person is a writer. 18

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 3: Translating from English to Symbolic Form Let p and q represent the following simple statements: p: A person is a father. q: A person is a male. Write each compound statement below in symbolic form: a. If a person is a father, then that person is a male. c.If a person is not a male, then that person is not a father. 19

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Common English expressions for p  q Symbolic Statement English Statement Example p: A person is a father. q: A person is a male. p qp q If p then q.If a person is a father, then that person is a male. p qp q q if p.A person is a male, if that person is a father. p qp q p is sufficient for q.Being a father is sufficient for being a male. p qp q q is necessary for p.Being a male is necessary for being a father. p qp q p only if q.A person is a father only if that person is a male. p qp q Only if q, p.Only if a person is a male is that person a father. 20

Copyright 2013, 2010, 2007, Pearson, Education, Inc. If and Only If Statements Biconditional statements are conditional statements that are true if the statement is still true when the antecedent and consequent are reversed. The compound statement “p if and only if q” (abbreviated as iff ) is symbolized by p  q. 21

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Common English Expressions for p  q. Symbolic Statement English StatementExample p: A person is an unmarried male. q: A person is a bachelor. p  qp  q p if and only if q.A person is an unmarried male if and only if that person is a bachelor. p  qp  q q if and only if p.A person is a bachelor if and only if that person is an unmarried male. p  qp  q If p then q, and if q then p. If a person is an unmarried male then that person is a bachelor, and if a person is a bachelor, then that person is an unmarried male. p  qp  q p is necessary and sufficient for q. Being an unmarried male is necessary and sufficient for being a bachelor. p  qp  q q is necessary and sufficient for p. Being a bachelor is necessary and sufficient for being an unmarried male. 22

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Statements of Symbolic Logic NameSymbolic Form Common English Translations Negation~pNot p. It is not true that p. Conjunction p  q p and q, p but q. Disjunction p  q p or q. Conditional p  q If p, then q, p is sufficient for q, q is necessary for p. Biconditional p  q p if and only if q, p is necessary and sufficient for q. 23

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 6: Expressing Symbolic Statements with and without Parenthesis in English Let p and q represent the following simple statements: p: She is wealthy. q: She is happy. Write each of the following symbolic statements in words: a. ~(p  q) It is not true that she is wealthy and happy. b. ~p  q She is not wealthy and she is happy. c. ~(p  q) She is neither wealthy nor happy. (Literally, it is not true that she is either wealthy or happy.) 24

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Expressing Symbolic Statements with Parentheses in English Notice that when we translate the symbolic statement into English, the simple statements in parentheses appear on the same side of the comma. Symbolic Statement Statements to Group Together English Translation (q  ~p)  ~rq  ~p If q and not p, then not r. q  ( ~p  ~r)~p  ~r q, and if not p then not r. 25

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 7: Expressing Symbolic Statements with Parentheses in English Let p, q, and r represent the following simple statements: p: A student misses lecture. q: A student studies. r: A student fails. Write each of these symbolic statements in words: a. (q  ~ p) ~ r If a student studies and does not miss lecture, then the student does not fail. 26

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 7: continued Let p, q, and r represent the following simple statements: p: A student misses lecture. q: A student studies. r: A student fails. Write each of these symbolic statements in words: b. q  (~p  ~r) A student studies, and if the student does not miss lecture then the student does not fail. 27

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Dominance of Connectives If a symbolic statement appears without parentheses, statements before and after the most dominant connective should be grouped. The dominance of connectives used in symbolic logic is defined in the following order. 28

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Using the Dominance of Connectives StatementMost Dominant Connective Highlighted in Red Statements Meaning Clarified with Grouping Symbols Type of Statement p  q  ~r p  (q  ~r) Conditional p  q  ~r (p  q)  ~r Conditional p  q  r p  (q  r) Biconditional p  q  r (p  q)  r Biconditional p  ~q  r  s (p  ~q)  (r  s) Conditional p  q  r The meaning is ambiguous. ? 29

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 8: Using the Dominance of Connectives Let p, q, and r represent the following simple statements. p: I fail the course. q: I study hard. r: I pass the final. Write each compound statement in symbolic form: a. I do not fail the course if and only if I study hard and I pass the final. ~p  (q  r ) b. I do not fail the course if and only if I study hard, and I pass the final. (~p  q)  r 30