Section 1.2: Conditional Statements

Similar documents
CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

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

AMTH140 Lecture 8. Symbolic Logic

Section 2.3: Statements Containing Multiple Quantifiers

THE LOGIC OF QUANTIFIED STATEMENTS

EECS 1028 M: Discrete Mathematics for Engineers

Section 3.1: Direct Proof and Counterexample 1

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

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

HW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall

Section 2.1: Introduction to the Logic of Quantified Statements

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

Section 1.3: Valid and Invalid Arguments

CSC Discrete Math I, Spring Propositional Logic

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University

MATH CSE20 Homework 5 Due Monday November 4

Proofs. Joe Patten August 10, 2018

Section 1.1: Logical Form and Logical Equivalence

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.

Today. Proof using contrapositive. Compound Propositions. Manipulating Propositions. Tautology

Supplementary Logic Notes CSE 321 Winter 2009

Compound Propositions

Tools for reasoning: Logic. Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications:

DISCRETE MATH: FINAL REVIEW

Geometry: Notes

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 1

Logic Overview, I. and T T T T F F F T F F F F

Section 1.2: Propositional Logic

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

Unit 2: Logic and Reasoning. start of unit

Math Assignment 2 Solutions - Spring Jaimos F Skriletz Provide definitions for the following:

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof

Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives

Section 2-1. Chapter 2. Make Conjectures. Example 1. Reasoning and Proof. Inductive Reasoning and Conjecture

Propositional Logic. Spring Propositional Logic Spring / 32

Mat 243 Exam 1 Review

FUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic

- 1.2 Implication P. Danziger. Implication

Discrete Mathematics and Probability Theory Fall 2012 Vazirani Note 1

THE LOGIC OF COMPOUND STATEMENTS

Prof. Girardi Exam 1 Math 300 MARK BOX

1.1 Statements and Compound Statements

CS70 is a course about on Discrete Mathematics for Computer Scientists. The purpose of the course is to teach you about:

The statement calculus and logic

Boolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012

DISCRETE MATH: LECTURE 3

2 Conditional and Biconditional Propositions

MAT2345 Discrete Math

1.1 Language and Logic

Logic and Propositional Calculus

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

We last time we began introducing equivalency laws.

LECTURE 1. Logic and Proofs

Logic of Sentences (Propositional Logic) is interested only in true or false statements; does not go inside.

Unit 6 Logic Math 116

GEOMETRY. 2.1 Conditional Statements

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

Overview. 1. Introduction to Propositional Logic. 2. Operations on Propositions. 3. Truth Tables. 4. Translating Sentences into Logical Expressions

What is Logic? Introduction to Logic. Simple Statements. Which one is statement?

CSE 311: Foundations of Computing I. Spring 2015 Lecture 1: Propositional Logic

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

What is a proof? Proofing as a social process, a communication art.

Propositional Logic Introduction and Basics. 2.2 Conditional Statements. 2.3 Inferencing. mjarrar 2015

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

Logic Review Solutions

Discrete Mathematics and Its Applications

An Introduction to Logic 1.1 ~ 1.4 6/21/04 ~ 6/23/04

Writing proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction

ECOM Discrete Mathematics

Show Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page.

FORMAL PROOFS DONU ARAPURA

Intro to Logic and Proofs

3 The language of proof

HOMEWORK 1: SOLUTIONS - MATH 215 INSTRUCTOR: George Voutsadakis

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

COT 2104 Homework Assignment 1 (Answers)

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.

Math.3336: Discrete Mathematics. Propositional Equivalences

Introduction Propositional Logic

2-4: The Use of Quantifiers

Sec$on Summary. Mathematical Proofs Forms of Theorems Trivial & Vacuous Proofs Direct Proofs Indirect Proofs

22 3. STATEMENTS. P : 2 is an even number

Definition 2. Conjunction of p and q

2.2 Analyze Conditional

CS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.

1.5 MATHEMATICAL LANGUAGE

Box. Turn in your e xam to Kathy Stackhouse in Chem 303 by noon on Thursday, March 30.

The Logic of Compound Statements cont.

9/5/17. Fermat s last theorem. CS 220: Discrete Structures and their Applications. Proofs sections in zybooks. Proofs.

Proofs. Chapter 2 P P Q Q

Section 4.2: Mathematical Induction 1

ICS141: Discrete Mathematics for Computer Science I

MA103 STATEMENTS, PROOF, LOGIC

AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic

Propositional Logic. Fall () Propositional Logic Fall / 30

Chapter 1 Elementary Logic

PHIL 422 Advanced Logic Inductive Proof

MATH 135 Fall 2006 Proofs, Part IV

1.1 Language and Logic

Transcription:

Section 1.2: Conditional Statements In this section, we study one of the most important tools in logic - conditional statements. Loosely speaking, conditional statements are statements of the form if p then q, and are in many respects the very foundation of most arguments. 1. The Conditional Statement Before we give a formal definition of the conditional statement, we start with an example so we can understand when a conditional statement should be true. For the example, we need the following notation and terminolgy: Notation 1.1. If p and q are statements, the conditional of q by p is if p then q denoted p q. We call p the hypothesis of the conditional and q the conclusion. Example 1.2. Consider the conditional statement, if I am healthy, I will come to class. To determine the truth value of this statement, we need to determine when this statement is false, so we consider the four different possibilities for the truth values of p and q. Let p := I am healthy and q := I will come to class. We shall fill in the following table: p q p q F T T For case # 1, if I am healthy and I come to class, the conditional is clearly true. For case # 2, if I am healthy, but I have decided to stay home and not go to class, the conditional is false - the hypothesis is satisfied, but the conclusion is not satisfied, so the statement cannot possibly be true. For case # 3, if I am not healthy, but I have come to class anyway though all the people sitting around may not be happy about it, the conditional statement has not been violated since the hypothesis does not hold i.e. the conditional statement is meaningless since the hypothesis is not true. Therefore, the conditional must be true. Likewise, for case # 4, if I am not healthy, and I did not come to class, the conditional statement has not been violated since 1

2 the hypothesis does not hold. Therefore, the conditional is true. This example implies that a conditional statement is false only when the hypothesis is true and the conclusion is false. Though it is clear that a conditional statement is false only when the hypothesis is true and the conclusion is false, it is not clear why when the hypothesis is false, the conditional statement is always true. To try to explain why this is this case, we consider another example. Example 1.3. Consider the mathematical statement if n is a perfect square, then n is not prime. Clearly this is a true statement for any n, so it will be true when we substitute values in for n. Now substitute 3 for n: if 3 is a perfect square, then 3 is not prime. As remarked above, this conditional statement is still true yet its hypothesis and conclusion are both false. Similarly, if we substitute 6 into this statement, it becomes if 6 is a perfect square, then 6 is not prime. This conditional statement is true yet its hypothesis is false and its conclusion is true. We can now write down a formal definition for the conditional statement. Definition 1.4. If p and q are statements, the conditional of q by p is if p then q or p implies q denoted p q. A conditional statement is false only when the hypothesis is false and the conclusion is true. The truth table for the conditional statement is as follows: p q p q F T T Remark 1.5. A conditional statement that is true by the fact that its hypothesis is false is often called vacuously true or true by default. Remark 1.6. (Order of Operations) In expressions that include as well other other logical operators, the order of operations is that is always performed last. 2. Basic Examples using Conditional Statements We consider some examples of how to work with conditional statements when trying to show logical equivalence or constructing basic truth tables.

Example 2.1. Show that the the statement p q p is a tautology. p q q p q p q p T T T F F T F T This is a tautology since the truth values are always true. Example 2.2. (Writing as ) Show that p q p q. We need to construct truth tables for these two statements. We have 3 and p q p p q T T F T F F T p q p q F T T They have the same truth values and thus they must be logically equivalent statements i.e. a statement of the form if p then q is equivalent to one of the form either not p or q. Example 2.3. Determine if the following statements are logically equivalent: (i) If you paid full price, you didn t buy it at Powells books (ii) You didn t buy it at Powells books or you paid full price Let p := you paid full price and q := you bought it at Powells books. The first statement is p q and the second statement is q p. We know p q is logically equivalent to p q, and the second statement is equivalent to p q (using the commutative law). Clearly these two statements are not equivalent and thus the statements above are not equivalent (even though they may initially seem so). 3. Logical Statements Related to Conditional Statements There are many statements closely related to the conditional statement which are built up from conditional statements. We shall consider some of them in detail.

4 3.1. The Negation of a Conditional Statement. Recall that the conditional statement p q is false only when p is true and q is false. Thus we get the following: Result 3.1. The negation of if p then q is p and not q. In symbolic notation, (p q) p q Example 3.2. The negation of the statement If the river is narrow, then we can cross it quickly is The river is narrow and we cannot cross it quickly. Warning. The negation of a conditional not a conditional - this is sometimes a misconception which can lead to bad logical inferences. 3.2. The Contrapositive of a Conditional Statement. One very important tool in mathematics and logic is the use of the contrapositive to prove arguments. The contrapositive is defined as follows. Definition 3.3. The contrapositive of the conditional if p then q is the conditional if not q then not p. In symbols, the contrapositive of p q is q p. The importance of the contrapositive of a conditional is that it is logically equivalent to the conditional. This means that a conditional statement holds only when its contrapositive holds. Though this may not currently seem helpful, we shall this is a very powerful tool in math. Before we do this, we shall prove a conditional is equivalent to its contrapositive. Result 3.4. The conditional statement p q is equivalent to its contrapositive q p. Proof. We shall use logical equivalences: p q p q q p ( q) p q p Example 3.5. Consider the statement if xy is not even, then either x is not odd or y is not even. Determining the truth value of this statement seems fairly difficult, and on first glance, it looks like it may be false. We shall examine its truth value using the contrapositive. First, let p := xy is even, q := x is odd, r := y is even. Then symbolically, the logical statement above is p q r.

The contrapositive of this statement is which is equivalent to which in turn is equivalent to ( q r) p ( (q r)) p q r p. Translating back to language, this statement says if x is odd and y is even, then xy is even which is clearly true, and hence the original statement must be true. 3.3. The Converse and Inverse of a Conditional Statement. There are two other statements related to a conditional statement which on first glance one may think are equivalent to the conditional but are in fact not. Definition 3.6. Suppose if p then q is a conditional statement. Then we define the following related statements: (i) The converse of if p then q is if q then p. In symbolic notation, the converse of p q is q p. (ii) The inverse of if p then q is if not p then not q. In symbolic notation, the inverse of p q is p q. The following result summarizes how these statements are related through logical equivalence. Result 3.7. (i) A conditional statement is not equivalent to its converse. (ii) A conditional statement is not equivalent to its inverse. (iii) The inverse and converse of a conditional statement are equivalent to eachother. Example 3.8. Consider the statement If I am tall, then I can dunk a basketball. The converse to this statement is If I can dunk a basketball, then I am tall, and the inverse is If I am not tall, then I cannot dunk a basketball. Notice that these last two statements are logically equivalent. 3.4. The only if Statement. A statement closely related to a conditional statement is an only if statement i.e. a statement of the form p only if q. To say p only if q means if not q then not p which is the contrapositive of if p then q. Summarizing, we have: Definition 3.9. If p and q are statements, then p only if q means if not q then not p or equivalently, if p then q. Example 3.10. The statement I will get an A in this class only if I work hard is logically equivalent to If I get an A in this class, then I have worked hard in this class. 5

6 3.5. The Biconditional Statement. A statement related to the conditional and the only if statement is the so-called biconditional statement defined as follows: Definition 3.11. If p and q are statements, then the biconditional of p and q is p if only if q and is denoted p q. It is true if both p and q have the same truth values and is false if they have opposite truth values. The truth table of a biconditional statement is as follows: p q p q F T F Sometimes we abbreviate if and only if to iff. 3.6. Necessary and Sufficient Conditions. Other phrases related to conditional statements are necessary and sufficient conditions. We summarize: Definition 3.12. If p and q are statements: p is a sufficient condition for q means if p then q p is a necessary condition for q means if not p then not q, or equivalently, if q then p. We finish with an example. Example 3.13. The statement doing homework regularly in this class is a necessary condition for achieving a good grade is logically equivalent to if homework is not done regularly in this class, then a good grade will not be acheived or equivalently, if a good grade is achieved in this class, then homework was done regularly. Homework (i) From the book, pages 27-29: Questions: 3, 10, 15, 17, 19, 20a, 20e, 20f, 25, 26, 33, 37, 39, 44, 46, 47, 48