Logic 2 The conditional and biconditional

Slides:



Advertisements
Similar presentations
3.4 More on the Conditional
Advertisements

Geometry Chapter 2 Terms.
Geometry 2.2 Big Idea: Analyze Conditional Statements
The Conditional & Biconditional MATH 102 Contemporary Math S. Rook.
John Rosson Thursday February 15, 2007 Survey of Mathematical Ideas Math 100 Chapter 3, Logic.
Notes on Logic Continued
Conditional Statements
Chapter 1 The Logic of Compound Statements. Section 1.2 – 1.3 (Modus Tollens) Conditional and Valid & Invalid Arguments.
2.2 Conditional Statements. Goals Identify statements which are conditional Identify the antecedent and consequent of a conditional statement Negate conditional.
Today’s Topics n Symbolizing conditionals and bi-conditionals n Other complex symbolizations. n Unless.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
From Chapter 4 Formal Specification using Z David Lightfoot
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.
Conditional Statements
Adapted from Discrete Math
Propositions and Truth Tables
Chapter 1 Section 1.4 More on Conditionals. There are three statements that are related to a conditional statement. They are called the converse, inverse.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.3, Slide Logic The Study of What’s True or False or Somewhere in Between.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.3, Slide Logic The Study of What’s True or False or Somewhere in Between.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
Discrete Mathematics and Its Applications
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
Chapter 1: The Foundations: Logic and Proofs
Conditional Statements Lesson 2-1. Conditional Statements have two parts: Hypothesis ( denoted by p) and Conclusion ( denoted by q)
Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements
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.
Lecture Propositional Equivalences. Compound Propositions Compound propositions are made by combining existing propositions using logical operators.
Section 2-2: Conditional Statements. Conditional A statement that can be written in If-then form symbol: If p —>, then q.
Unit 01 – Lesson 07 – Conditional Statements
Propositional Logic ITCS 2175 (Rosen Section 1.1, 1.2)
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.
Logic The Lost Art of Argument. Logic - Review Proposition – A statement that is either true or false (but not both) Conjunction – And Disjunction – Or.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
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.
Lesson 2-1 Conditional Statements 1 Lesson 2-3 Conditional Statements.
Conditional statement or implication IF p then q is denoted p ⇒ q p is the antecedent or hypothesis q is the consequent or conclusion ⇒ means IF…THEN.
CONDITIONAL STATEMENTS Intro to AlgebraFarris 2015.
Section 1.3 Implications. Vocabulary Words conditional operation ( ⇒ or →) conditional proposition conditional statement (implication statement) hypothesis.
Section 2.2 Homework Quiz Question Put the following Conditional Statement into If Then Form: All birds have feathers.
Simple Logic.
Chapter 1 Logic and Proof.
If – Then Statements Lesson 1.5.
Introduction to Deductive Proofs
2. The Logic of Compound Statements Summary
Section 2.1 Conditional Statements
Conditional Statements
CSNB 143 Discrete Mathematical Structures
Today’s Topics Symbolizing conditionals and bi-conditionals
Conditional Statements
Logic.
Biconditional - 2 CS-708.
(CSC 102) Discrete Structures Lecture 2.
The Foundations: Logic and Proofs
Conditional Statements
Information Technology Department
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
2.2 Analyze Conditional Statements
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics and Its Applications Kenneth H
Discrete Mathematics Lecture # 3.
MAT 3100 Introduction to Proof
Conditional Statements
1.3 Propositional Equivalences
Logic and Reasoning.
Conditional Statements
TODAY’S OBJECTIVE: Standard: MM1G2
Conditional Statements Section 2.3 GEOMETRY
TODAY’S OBJECTIVE: Standard: MM1G2
Conditional Statements
Interpreting Truth tables (biconditional statements)
Presentation transcript:

Logic 2 The conditional and biconditional

The Conditional Consider two statements, p and q. If p being true always leads to q being true, we have a conditional relationship “if p is true then q is true”, “if p then q”, “p q”. See Waner and Conenoble for other equivalent phrases. These all say the same thing, and have the following truth table: P is the antecedent of hypothesis, q is the consequent or conclusion.

Rules of the conditional The only way p q is false is if p is true and q is false. Called a “broken promise.” If p and q are both false, p q is true. p q is true when p is false, no matter what the truth value of q. True always implies true. If p and q are both true, then pq is true. True can’t imply false. If p is true and q is false then pq is false. False implies anything. If p is false, then pq is true no matter if q is true or not.

The “switcheroo” law Show that p q  (p)q This is often important for proofs. This implies that p q is true if either p is false or if q is true. Using DeMorgan’s Law, this also means that p q  (p(q))

Important equivalencies of p q if p then q is the same as p implies q q follows from p is the same as not p unless q q if p is the same as p only if q whenever p, q is the same as q whenever p p is sufficient for q is the same as q is necessary for p Notice how p being a sufficient condition for q makes q a necessary condition for p.

Exercise: Show that the commutative law does not hold for the conditional, that is that p q is not equivalent to q p using a truth table. The statement p q is called the converse of q p, and q p is the converse of p q. They are not equivalent.

Exercises Give an example where the converse of a conditional is not true. (Think advertising). Give an example when the converse of a conditional is true.

Contrapositive The contrapositive of p q is (q) (p) Exercise 1: Use truth tables to show a statement and its contrapositive are equivalent. Exercise 2: Use switcheroo and other properties to show a statement and its contrapositive are equivalent. p q  (p)q  q(p)  (q)(p)  (q) (p) switcheroo; commutative; double neg; switcheroo

Exercise 3: Give the converse and contrapositive of the statement If you study hard you will get a good grade. Explain how the contrapositive can be interpreted as true, but not necessarily the converse. Converse: If you get a good grade you studied hard. Contrapositive: If you don’t get a good grade, you did not study hard.

Biconditional The biconditional, written pq, is defined to be the statement (p q)(q p). With the true table Exercise: Use truth tables to show that pq (p q)(q p).

Common phrasings for the biconditional p if and only if q p is necessary and equivalent for q p is equivalent to q