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.

Slides:



Advertisements
Similar presentations
Logic The study of correct reasoning.
Advertisements

Logic Day Two.
Logic ChAPTER 3.
TRUTH TABLES The general truth tables for each of the connectives tell you the value of any possible statement for each of the connectives. Negation.
Logic & Critical Reasoning
1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: The Moon is made of green cheese. Trenton.
Chapter 2. Logic Weiqi Luo ( 骆伟祺 ) School of Software Sun Yat-Sen University : Office : A309
John Rosson Thursday February 15, 2007 Survey of Mathematical Ideas Math 100 Chapter 3, Logic.
IB Math Studies – Topic 3. IB Course Guide Description.
Part 2 Module 2 The Conditional Statement. The Conditional Statement A conditional statement is a statement of the form "If p, then q," denoted pqpq.
Logic 2 The conditional and biconditional
Logic Chapter 2. Proposition "Proposition" can be defined as a declarative statement having a specific truth-value, true or false. Examples: 2 is a odd.
Logic: Connectives AND OR NOT P Q (P ^ Q) T F P Q (P v Q) T F P ~P T F
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
TRUTH TABLES. Introduction Statements have truth values They are either true or false but not both Statements may be simple or compound Compound statements.
The Foundations: Logic and Proofs
Propositions and Truth Tables
1.1 Sets and Logic Set – a collection of objects. Set brackets {} are used to enclose the elements of a set. Example: {1, 2, 5, 9} Elements – objects inside.
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.
Conditional Statements M Deductive Reasoning Proceeds from a hypothesis to a conclusion. If p then q. p  q hypothesis  conclusion.
Section 1.5 Implications. Implication Statements If Cara has a piano lesson, then it is Friday. If it is raining, then I need to remember my umbrella.
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
Discrete Maths 2. Propositional Logic Objective
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
(CSC 102) Lecture 3 Discrete Structures. Previous Lecture Summary Logical Equivalences. De Morgan’s laws. Tautologies and Contradictions. Laws of Logic.
Discrete Mathematics Lecture1 Miss.Amal Alshardy.
Conditional. Conditional Statements Vocabulary Conditional: A compound sentence formed by using the words if….then. Given the simple sentences p and q,
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements
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 7 Logic, Sets, and Counting
Conditional Statements
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.
MADAM SITI AISYAH ZAKARIA. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC LOGICAL CONNECTIVES CONDITIONAL STATEMENT.
MAIN TOPIC : Statement, Open Sentences, and Truth Values Negation Compound Statement Equivalency, Tautology, Contradiction, and Contingency Converse, Inverse,
Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.
Lecture 9 Conditional Statements CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
How do I show that two compound propositions are logically equivalent?
Chapter 7 Logic, Sets, and Counting Section 1 Logic.
Propositional Logic ITCS 2175 (Rosen Section 1.1, 1.2)
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
Conditional Statements – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Conditional Statements Reading: Kolman, Section 2.2.
Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Logic The Lost Art of Argument. Logic - Review Proposition – A statement that is either true or false (but not both) Conjunction – And Disjunction – Or.
Joan Ridgway. If a proposition is not indeterminate then it is either true (T) or false (F). True and False are complementary events. For two propositions,
Section 1.1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: a) The Moon is made of green.
Conditional Statements Lecture 2 Section 1.2 Fri, Jan 20, 2006.
Mathematics for Computing Lecture 2: Computer Logic and Truth Tables Dr Andrew Purkiss-Trew Cancer Research UK
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 01: Boolean Logic Sections 1.1 and 1.2 Jarek Rossignac.
1 Statements and Operations Statements and operators can be combined in any way to form new statements. PQ PQPQPQPQ  (P  Q) (  P)  (  Q) TTTFF.
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
Chapter 1 Logic and proofs
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Simple Logic.
Chapter 1 Propositional Logic
2. The Logic of Compound Statements Summary
CSNB 143 Discrete Mathematical Structures
1.2 Propositional Equivalences
Information Technology Department
Discrete Mathematics and Its Applications Kenneth H
1.2 Propositional Equivalences
MAT 3100 Introduction to Proof
1.2 Propositional Equivalences
Presentation transcript:

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 To form the implication p: I am hungry q: I will eat p: It is snowing q: = 8 IF I am hungry, THEN I will eat IF it is snowing, THEN 3+5=8 Normally you would use statements that have cause and effect.

IF p then q (p ⇒ q) is only considered false if p is true and q is false. p = t, q = f results in F pq p ⇒ q TTT TFF FTT FFT

IF p then q: p ⇒ q means all of the following: p implies q q if p p only if q p is a sufficient condition for q q is a necessary condition for p Converse of p ⇒ q is the implication q ⇒ p (IF q then p) Contrapositive of p ⇒ q is the implication q ⇒ p (if not q then not p)

IF it is raining, THEN I get wet p: It is raining q: I get wet Converse q ⇒ p (if q then p) IF I get wet, THEN it is raining Contrapositive q ⇒ p (if not q then not p) IF I do not get wet, then it is not raining

Equivalence or bi conditional ⇔ IF and only IF p ⇔ q (p if and only if q) is only true when both p and q are true or when both p and q are false pq p ⇔ q TTT TFF FTF FFT

3 >2 IF and only IF 0 < 3-2 p: 3 >2 q: 0 < 3-2 p ⇔ q (p if and only if q) is true because p is true and q is true.

A statement that is true for all possible values of its propositional variables is called a tautology. In other words, if the result column only has T’s in it, the statement is a tautology. Review Tautology handout Contradiction or Absurdity: is a statement that is always fasle: p ∧ p (p and not p) will always have a result of false. Contingency: a statement that can either be true or false, depending on the truth values of its propositional variables. (p ⇒ q) ∧ (p ∨ q)

Logically equivalent is denoted by ≡ IF p ⇔ q is a tautology then the two propositions are equal. Page 58 correction Last paragraph in example 6 the second & third should be third & fourth Review Page 59 properties Page 60: ∀ means for all ∃ means there exists