© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic.

Slides:



Advertisements
Similar presentations
Logic & Critical Reasoning Translation into Propositional Logic.
Advertisements

Statements, Connectives, and Quantifiers
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
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
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.
The Foundations: Logic and Proofs
Propositions and Truth Tables
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
Chapter 2 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
1 Propositional Logic Proposition 2 Propositions can be divided into simple propositions and compound propositions. A simple (or basic) proposition is.
Thinking Mathematically Logic 3.2 Compound Statements and Connectives.
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.
Conjunction A conjunction is a compound statement formed by combining two simple sentences using the word “AND”. A conjunction is only true when both.
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.
Thinking Mathematically Compound Statements and Connectives.
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.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic.
© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.4, Truth Tables for the Conditional and the Biconditional.
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. 
Chapter 1: The Foundations: Logic and Proofs
Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.
Chapter 3 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Introduction to Logic Lecture 13 An Introduction to Truth Tables By David Kelsey.
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.
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.
INTRODUCTION TO LOGIC. PURPOSE: – To distinguish good arguments from poor ones Arguments consist of STATEMENTS – A statement is a sentence that can be.
© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.3, Truth Tables for Negation, Conjuction, and Disjunction.
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Simple Logic.
Introduction to Logic © 2008 Pearson Addison-Wesley.
AND.
DISCRETE MATHEMATICS CHAPTER I.
Today’s Topics Symbolizing conditionals and bi-conditionals
Truth Tables and Equivalent Statements
Truth Tables for Negation, Conjunction, and Disjunction
Truth Tables for Negation, Conjunction, and Disjunction
Truth Tables – Logic (Continued)
The Boolean Connectives
The Foundations: Logic and Proofs
Information Technology Department
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.
Discrete Mathematics and Its Applications Kenneth H
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Lecture 2: Propositional Logic
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
CHAPTER 3 Logic.
Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction
Statements and Logical Connectives
Truth Tables for Conditional and Biconditional Statements
Presentation transcript:

© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic

© 2010 Pearson Prentice Hall. All rights reserved Compound Statements and Connectives

© 2010 Pearson Prentice Hall. All rights reserved. Objectives 1.Express compound statements in symbolic form. 2.Express symbolic statements with parentheses in English. 3.Use the dominance of connectives. 3

© 2010 Pearson Prentice Hall. All rights reserved. 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. 4

© 2010 Pearson Prentice Hall. All rights reserved. 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 ˄. 5

© 2010 Pearson Prentice Hall. All rights reserved. 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. 6

© 2010 Pearson Prentice Hall. All rights reserved. Common English Expressions for p  q 7

© 2010 Pearson Prentice Hall. All rights reserved. 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. 8

© 2010 Pearson Prentice Hall. All rights reserved. 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. 9

© 2010 Pearson Prentice Hall. All rights reserved. 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 10

© 2010 Pearson Prentice Hall. All rights reserved. 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. 11

© 2010 Pearson Prentice Hall. All rights reserved. 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. 12

© 2010 Pearson Prentice Hall. All rights reserved. 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. 13

© 2010 Pearson Prentice Hall. All rights reserved. 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. 14

© 2010 Pearson Prentice Hall. All rights reserved. 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. 15

© 2010 Pearson Prentice Hall. All rights reserved. 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. 16

© 2010 Pearson Prentice Hall. All rights reserved. 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. 17

© 2010 Pearson Prentice Hall. All rights reserved. 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.) 18

© 2010 Pearson Prentice Hall. All rights reserved. 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. 19

© 2010 Pearson Prentice Hall. All rights reserved. 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. 20

© 2010 Pearson Prentice Hall. All rights reserved. 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. 21

© 2010 Pearson Prentice Hall. All rights reserved. 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. 22

© 2010 Pearson Prentice Hall. All rights reserved. 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. ? 23

© 2010 Pearson Prentice Hall. All rights reserved. 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 24