Implications, Quantifiers, and Venn Diagrams. Implications Logical Quantifiers Venn Diagrams. Different Ways of Stating Implications

Similar documents
Introduction to Logic

Chapter 2: The Logic of Quantified Statements. January 22, 2010

To reason to a correct conclusion, we must build our arguments on true statements. Sometimes it is helpful to use truth tables. Simple Truth Table p

1.1 Language and Logic

Connectives Name Symbol OR Disjunction And Conjunction If then Implication/ conditional If and only if Bi-implication / biconditional

GEOMETRY. Chapter 2: LOGIC. Name: Teacher: Pd:

1.1 Language and Logic

Mathematical Reasoning (Part I) 1

3.2: Compound Statements and Connective Notes

LOGIC CONNECTIVES. Students who have an ACT score of at least 30 OR a GPA of at least 3.5 can receive a college scholarship.

Section 1.3. Let I be a set. When I is used in the following context,

Logic and Propositional Calculus

Chapter 3: Logic. Diana Pell. A statement is a declarative sentence that is either true or false, but not both.

Chapter 5: Section 5-1 Mathematical Logic

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)

Section 3.1 Statements, Negations, and Quantified Statements

Chapter 2. Reasoning and Proof

Logic. Def. A Proposition is a statement that is either true or false.

5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.

Unit 2: Logic and Reasoning. start of unit

~ p is always false. Based on the basic truth table for disjunction, if q is true then p ~

CSC Discrete Math I, Spring Propositional Logic

Section A (not in the text) Which of the following are statements? Explain. 3. The President of the United States in 2089 will be a woman.

Propositions. Frequently, we will use the word statement instead of proposition.

Conditional Statements

University of California, San Diego Department of Computer Science and Engineering CSE 20. Solutions to Midterm Exam Winter 2018

Sets and Logic Linear Algebra, Spring 2012

Conditional Statements

Math 1312 Lesson 1: Sets, Statements, and Reasoning. A set is any collection of objects. These objects are called the elements of the set.

2.1 Start Thinking. 2.1 Warm Up. 2.1 Cumulative Review Warm Up

A. Propositional Logic

Solutions to Exercises (Sections )

LECTURE 1. Logic and Proofs

EECS 1028 M: Discrete Mathematics for Engineers

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

Computer Science 280 Spring 2002 Homework 2 Solutions by Omar Nayeem

PSU MATH RELAYS LOGIC & SET THEORY 2017

1.1 Statements and Compound Statements

MAT 101 Exam 2 Logic (Part I) Fall Circle the correct answer on the following multiple-choice questions.

Chapter 1: The Logic of Compound Statements. January 7, 2008

III. Elementary Logic

Compound Propositions

The statement calculus and logic

Read ahead and use your textbook to fill in the blanks. We will work the examples together.

2.2: Logical Equivalence: The Laws of Logic

Foundation of proofs. Jim Hefferon.

Section L.1- Introduction to Logic

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

Note: The area of logic that deals with propositions is called the propositional calculus or propositional logic.

Chapter Summary. Propositional Logic. Predicate Logic. Proofs. The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.

6.1 Logic. Statements or Propositions. Negation. The negation of a statement, p, is not p and is denoted by p Truth table: p p

1.5 MATHEMATICAL LANGUAGE

G E O M E T R Y CHAPTER 2 REASONING AND PROOF. Notes & Study Guide CHAPTER 2 NOTES

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

AMTH140 Lecture 8. Symbolic Logic

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

HOMEWORK 1: SOLUTIONS - MATH 215 INSTRUCTOR: George Voutsadakis

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

DISCRETE MATHEMATICS BA202

Propositional Logic. Spring Propositional Logic Spring / 32

Discrete Structures for Computer Science

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 1

STRATEGIES OF PROBLEM SOLVING

Section 1.2: Conditional Statements

2-1. Inductive Reasoning and Conjecture. Lesson 2-1. What You ll Learn. Active Vocabulary

Discrete Structures Homework 1

Archdiocese of Washington Catholic Schools Academic Standards Mathematics

Useful for all Engineering Entrance Examinations held across India. STD. XII Sci.

Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

Propositional Calculus. Problems. Propositional Calculus 3&4. 1&2 Propositional Calculus. Johnson will leave the cabinet, and we ll lose the election.

LOGIC. Name: Teacher: Pd: Page 1

Be careful of that wasp: it might sting. Every triangle has three sides. The figure I drew is a triangle. Therefore my figure must have three sides.

Unit 1 Day 1. Set Operations & Venn Diagrams

Equivalence and Implication

Logical Representations. LING 7800/CSCI 7000 Martha Palmer 9/30/2014

Rational Expressions

For all For every For each For any There exists at least one There exists There is Some

More examples of mathematical. Lecture 4 ICOM 4075

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations

Sec$on Summary. Propositions Connectives. Truth Tables. Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional

Today s Topic: Propositional Logic

Propositional Equivalence

Mathematics 220 Homework 4 - Solutions. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B.

Full file at

Logic CHAPTER. 3.1 A Little Dash of Logic Two Methods of Logical Reasoning p. 101

Discrete Mathematics and Probability Theory Fall 2012 Vazirani Note 1

Basic Logic and Proof Techniques

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)

Chapter 1, Part I: Propositional Logic. With Question/Answer Animations

PHIL 422 Advanced Logic Inductive Proof

Introduction Propositional Logic. Discrete Mathematics Andrei Bulatov

Introducing Proof 1. hsn.uk.net. Contents

CSC 125 :: Final Exam May 3 & 5, 2010

NAME DATE PERIOD. Inductive Reasoning and Conjecture , 5, 9 2 2, 4

Logic, Sets, and Proofs

1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points

Topic 5: Probability. 5.4 Combined Events and Conditional Probability Paper 1

Answers. Investigation 2. ACE Assignment Choices. Applications. Problem 2.5. Problem 2.1. Problem 2.2. Problem 2.3. Problem 2.4

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

Transcription:

E6 PPENDIX E Introduction to Logic E.2 Implications, Quantifiers, and Venn Diagrams Implications Logical Quantifiers Venn Diagrams Implications statement of the form If p, then q is called an implication (or a conditional statement) and is denoted by p q. The letter p is the hypothesis and the letter q is the conclusion. There are many different ways to epress the implication p q, as shown in the following list. Different Ways of Stating Implications The implication p q has the following equivalent verbal forms. 1. If p, then q. 2. p implies q. 3. p, only if q. 4. q follows from p. 5. q is necessary for p. 6. p is sufficient for q. Implication p q p q T T T T F F F T T F F T Normally, you think of the implication p q as having a cause-and-effect relationship between the hypothesis p and the conclusion q. However, you should be careful not to confuse the truth value of the component statements with the truth value of the implication. The following truth table should help you keep this distinction in mind. Note in the table at the left that the implication p q is false only when p is true and q is false. This is like a promise. Suppose you promise a friend that If the sun shines, I will take you fishing. The only way your promise can be broken is if the sun shines (p is true) and you do not take your friend fishing (q is false). If the sun doesn t shine (p is false), you have no obligation to go fishing, and so, the promise cannot be broken. EXMPLE 1 Finding Truth Values of Implications Give the truth value of each implication. (a) If 3 is odd, then 9 is odd. (b) If 3 is odd, then 9 is even. (c) If 3 is even, then 9 is odd. (d) If 3 is even, then 9 is even.

PPENDIX E Introduction to Logic E7 Hypothesis Conclusion Implication (a) T T T (b) T F F (c) F T T (d) F F T The net eample shows how to write an implication as a disjunction. EXMPLE 2Identifying Equivalent Statements p q ~p q p q ~p ~p q p q T T F T T T F F F F F T T T T F F T T T Use a truth table to show the logical equivalence of the following statements. (a) If I get a raise, I will take my family on a vacation. (b) I will not get a raise or I will take my family on a vacation. Let p represent the statement I will get a raise, and let q represent the statement I will take my family on a vacation. Then, you can represent the statement in part (a) as p q and the statement in part (b) as ~p q. The logical equivalence of these two statements is shown in the truth table at the left. ecause the fourth and fifth columns of the truth table are identical, you can conclude that the two statements p q and ~p q are equivalent. Identical From the table in Eample 2 and the fact that ~ ~p p, you can write the negation of an implication. That is, because p q is equivalent to ~p q, it follows that the negation of p q must be ~ ~p q, which by DeMorgan s Laws can be written as follows. ~ p q p ~q For the implication p q, there are three important associated implications. 1. The converse of p q: q p 2. The inverse of p q: ~p ~q 3. The contrapositive of p q: ~q ~p

E8 PPENDIX E Introduction to Logic NOTE The connective is used to determine the truth values in the last three columns of the table. From the table below you can see that these four statements yield two pairs of logically equivalent implications. p q ~p ~q p q ~q ~p q p T T F F T T T T T F F T F F T T F T T F T T F F F F T T T T T T ~p ~q Identical Identical NOTE In Eample 3, be sure you see that neither the converse nor the inverse is logically equivalent to the original implication. To see this, consider that the original implication simply states that if you get a on your test, then you will pass the course. The converse is not true, because knowing that you passed the course does not imply that you got a on the test. fter all, you might have gotten an on the test. EXMPLE 3 Writing the Converse, Inverse, and Contrapositive Write the converse, inverse, and contrapositive for the implication If I get a on my test, then I will pass the course. (a) Converse: If I pass the course, then I got a on my test. (b) Inverse: If I do not get a on my test, then I will not pass the course. (c) Contrapositive: If I do not pass the course, then I did not get a on my test. biconditional statement, denoted by p q, is the conjunction of the implications p q and q p. biconditional statement is written as p if and only if q, or in shorter form as p iff q. biconditional statement is true when both components are true and when both components are false, as shown in the following truth table. iconditional Statement: p if and only if q p q p q q p p q p q q p T T T T T T T F F T F F F T T F F F F F T T T T

PPENDIX E Introduction to Logic E9 The following list summarizes some of the laws of logic that have been discussed up to this point. Laws of Logic 1. For every statement p, either Law of Ecluded Middle 2. ~ ~p p Law of Double Negation p is true or p is false. 3. ~ p q ~p ~q DeMorgan s Law 4. ~ p q ~p ~q DeMorgan s Law 5. p q ~p q Law of Implication 6. p q ~q ~p Law of Contraposition Logical Quantifiers Logical quantifiers are words such as some, all, every, each, one, and none. Here are some eamples of statements with quantifiers. Some isosceles triangles are right triangles. Every painting on display is for sale. Not all corporations have male chief eecutive officers. ll squares are parallelograms. eing able to recognize the negation of a statement involving a quantifier is one of the most important skills in logic. For instance, consider the statement ll dogs are brown. In order for this statement to be false, we do not have to show that all dogs are not brown, we must simply find at least one dog that is not brown. So, the negation of the statement is Some dogs are not brown. Net we list some of the more common negations involving quantifiers. Negating Statements with Quantifiers Statement Negation Statement Negation 1. ll p are q. Some p are not q. 2. Some p are q. No p is q. 3. Some p are not q. ll p are q. 4. No p is q. Some p are q. When logical quantifiers are used, the word all can be replaced by the word each or the word every. For instance, the following are equivalent. ll p are q. Each p is q. Every p is q. Similarly, the word some can be replaced by the words at least one. For instance, the following are equivalent. Some p are q. t least one p is q.

E10 PPENDIX E Introduction to Logic EXMPLE 4 Negating Quantifying Statements Write the negation of each of the following. (a) ll students study. (b) Not all prime numbers are odd. (c) t least one mammal can fly. (d) Some bananas are not yellow. (a) Some students do not study. (c) No mammal can fly. (b) ll prime numbers are odd. (d) ll bananas are yellow. Venn Diagrams Venn diagrams are figures that are used to show relationships between two or more sets of objects. They can help you interpret quantifying statements. Study the following Venn diagrams in which the circle marked represents people over 6 feet tall and the circle marked represents the basketball players. 1. ll basketball players are over 2. Some basketball players are over 6 feet tall. 6 feet tall. 3. Some basketball players are not 4. No basketball player is over over 6 feet tall. 6 feet tall.

PPENDIX E Introduction to Logic E11 E.2 Eercises In Eercises 1 4, write the verbal form for each of the following. (a) p q (b) q p (c) ~q ~p (d) p ~q 1. p: The engine is running. q: The engine is wasting gasoline. 2. p: The student is at school. q: It is nine o clock. 3. p: The integer is even. 4. p: The person is generous. q: It is divisible by 2. q: The person is rich. In Eercises 5 10, write the symbolic form of the compound statement. Let p represent the statement The economy is epanding, and let q represent the statement Interest rates are low. 5. If interest rates are low, then the economy is epanding. 6. If interest rates are not low, then the economy is not epanding. 7. n epanding economy implies low interest rates. 8. Low interest rates are sufficient for an epanding economy. 9. Low interest rates are necessary for an epanding economy. 10. The economy will epand only if interest rates are low. In Eercises 11 20, give the truth value of the implication. 11. If 4 is even, then 12 is even. 12. If 4 is even, then 2 is odd. 13. If 4 is odd, then 3 is odd. 14. If 4 is odd, then 2 is odd. 15. If 2n is even, then 2n 2 is odd. 16. If 2n 1 is even, then 2n 2 is odd. 17. 3 11 > 16 only if 2 3 5. 1 1 18. 6 < 2 3 is necessary for 2 > 0. 19. 2follows from 2 3 1. 20. If 2 224, then 10. In Eercises 21 26, write the converse, inverse, and contrapositive of the statement. 21. If the sky is clear, then you can see the eclipse. 22. If the person is nearsighted, then he is ineligible for the job. 23. If taes are raised, then the deficit will increase. 24. If wages are raised, then the company s profits will decrease. 25. It is necessary to have a birth certificate to apply for the visa. 26. The number is divisible by 3 only if the sum of its digits is divisible by 3. In Eercises 27 40, write the negation of the statement. 27. Paul is a junior or a senior. 28. Jack is a senior and he plays varsity basketball. 29. If the temperature increases, then the metal rod will epand. 30. If the test fails, then the project will be halted. 31. We will go to the ocean only if the weather forecast is good. 32. Completing the pass on this play is necessary if we are to win the game. 33. Some students are in etracurricular activities. 34. Some odd integers are not prime numbers. 35. ll contact sports are dangerous. 36. ll members must pay their dues prior to June 1. 37. No child is allowed at the concert. 38. No contestant is over the age of 12. 39. t least one of the $20 bills is counterfeit. 40. t least one unit is defective.

E12 PPENDIX E Introduction to Logic In Eercises 41 48, construct a truth table for the compound statement. 41. ~ p ~q 42. ~q p q 43. ~ q p q 44. p ~p q 45. p q ~p q 46. p q ~q p 47. p ~q ~p 48. p ~q q ~p In Eercises 49 56, use a truth table to show the logical equivalence of the two statements. 49. q p 50. ~p q 51. ~ p q 52. p q q 53. p q ~q 54. q ~p q 55. p ~p q 56. ~ p q ~q ~p ~q p q p ~q p q p ~p q ~q ~p p ~q 57. Select the statement that is logically equivalent to the statement If a number is divisible by 6, then it is divisible by 2. (a) If a number is divisible by 2, then it is divisible by 6. (b) If a number is not divisible by 6, then it is not divisible by 2. (c) If a number is not divisible by 2, then it is not divisible by 6. (d) Some numbers are divisible by 6 and not divisible by 2. 58. Select the statement that is logically equivalent to the statement It is not true that Pam is a conservative and a Democrat. (a) Pam is a conservative and a Democrat. (b) Pam is not a conservative and not a Democrat. (c) Pam is not a conservative or she is not a Democrat. (d) If Pam is not a conservative, then she is a Democrat. 59. Select the statement that is not logically equivalent to the statement Every citizen over the age of 18 has the right to vote. (a) Some citizens over the age of 18 have the right to vote. (b) Each citizen over the age of 18 has the right to vote. (c) ll citizens over the age of 18 have the right to vote. (d) No citizen over the age of 18 can be restricted from voting. 60. Select the statement that is not logically equivalent to the statement It is necessary to pay the registration fee to take the course. (a) If you take the course, then you must pay the registration fee. (b) If you do not pay the registration fee, then you cannot take the course. (c) If you pay the registration fee, then you may take the course. (d) You may take the course only if you pay the registration fee. In Eercises 61 70, sketch a Venn diagram and shade the region that illustrates the given statement. Let be a circle that represents people who are happy, and let be a circle that represents college students. 61. ll college students are happy. 62. ll happy people are college students. 63. No college students are happy. 64. No happy people are college students. 65. Some college students are not happy. 66. Some happy people are not college students. 67. t least one college student is happy. 68. t least one happy person is not a college student. 69. Each college student is sad. 70. Each sad person is not a college student.