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.

Slides:



Advertisements
Similar presentations
3.4 More on the Conditional
Advertisements

Logic The study of correct 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.
Goals Determine the true value of statements with AND, OR, IF..THEN. Negate statements with the connectives above Construct truth tables Understand when.
Copyright © Cengage Learning. All rights reserved. CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS.
The Foundation: Logic Conditional Statements Muhammad Arief download dari
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.
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.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
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.
CSE115/ENGR160 Discrete Mathematics 01/17/12 Ming-Hsuan Yang UC Merced 1.
First Order Logic. Propositional Logic A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not.
Adapted from Discrete Math
The Foundations: Logic and Proofs
Propositions and Truth Tables
Propositions and Truth Tables. Proposition: Makes a claim that may be either true or false; it must have the structure of a complete sentence.
Discrete Maths 2. Propositional Logic Objective
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.
CS 285- Discrete Mathematics Lecture 2. Section 1.1 Propositional Logic Propositions Conditional Statements Truth Tables of Compound Propositions Translating.
Chapter 1: The Foundations: Logic and Proofs
2.3 Analyze Conditional Statements. Objectives Analyze statements in if-then form. Analyze statements in if-then form. Write the converse, inverse, and.
Logic The study of critical thinking. Mathematical Sentence A statement of fact…called a statement Can be judged as true or false Not a question, command,
(CSC 102) Lecture 3 Discrete Structures. Previous Lecture Summary Logical Equivalences. De Morgan’s laws. Tautologies and Contradictions. Laws of Logic.
Lesson 2-3 Conditional Statements. 5-Minute Check on Lesson 2-2 Transparency 2-3 Use the following statements to write a compound statement for each conjunction.
Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements
Conditional Statements
Lecture Propositional Equivalences. Compound Propositions Compound propositions are made by combining existing propositions using logical operators.
Reading: Chapter 4 (44-59) from the text book
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.
Thinking Mathematically Equivalent Statements, Conditional Statements, and De Morgan’s Laws.
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.
Chapter 1: The Foundations: Logic and Proofs
Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
ARTIFICIAL INTELLIGENCE Lecture 2 Propositional Calculus.
LECTURE 1. Disrete mathematics and its application by rosen 7 th edition THE FOUNDATIONS: LOGIC AND PROOFS 1.1 PROPOSITIONAL LOGIC.
Discrete Mathematics Lecture # 7. Bi conditional  If p and q are statement variables, the bi conditional of p and q is  “ p if, and only if, q ” and.
رياضيات متقطعة لعلوم الحاسب MATH 226. Text books: (Discrete Mathematics and its applications) Kenneth H. Rosen, seventh Edition, 2012, McGraw- Hill.
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.
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.
Section 1.3 Implications. Vocabulary Words conditional operation ( ⇒ or →) conditional proposition conditional statement (implication statement) hypothesis.
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 01: Boolean Logic Sections 1.1 and 1.2 Jarek Rossignac.
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
Law of logic Lecture 4.
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
Simple Logic.
Chapter 1 Propositional Logic
2. The Logic of Compound Statements Summary
Conditional Statements
Conditional Statements
Logic.
(CSC 102) Discrete Structures Lecture 2.
The Foundations: Logic and Proofs
Principles of Computing – UFCFA3-30-1
Information Technology Department
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Copyright © Cengage Learning. All rights reserved.
Conditional Statements
Discrete Mathematics and Its Applications Kenneth H
Discrete Mathematics Lecture # 3.
MAT 3100 Introduction to Proof
Equivalent Statements
Conditional Statements
Conditional Statements Section 2.3 GEOMETRY
Different Forms of Conditional Statements
Presentation transcript:

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 simpler statements p: "You earn an A in Math," and q: "I will buy you a computer." The original statement is then saying: if p is true, then q is true, or, more simply, if p, then q. We can also phrase this as p implies q, and we write p → q.

CONDITIONAL STATEMENTS OR IMPLICATIONS: It is false when p is true and q is false; otherwise it is true. The arrow "→ " is the conditional operator, and in p → q the statement p is called the hypothesis (or antecedent) and q is called the conclusion (or consequent).

CONDITIONAL STATEMENTS OR IMPLICATIONS:

PRACTICE WITH CONDITIONAL STATEMENTS: 1. “If 1 = 1, then 3 = 3.” TRUE 2. “If 1 = 1, then 2 = 3.” FALSE 3. “If 1 = 0, then 3 = 3.” TRUE 4. “If 1 = 2, then 2 = 3.” TRUE 5. “If 1 = 1, then 1 = 2 and 2 = 3.” FALSE 6. “If 1 = 3 or 1 = 2 then 3 = 3.” TRUE

ALTERNATIVE WAYS OF EXPRESSING IMPLICATIONS: The implication p → q could be expressed in many alternative ways as: “if p then q” “not p unless q” “p implies q” “q follows from p” “if p, q” “q if p” “p only if q” “q whenever p” “p is sufficient for q” “q is necessary for p”

ALTERNATIVE WAYS OF EXPRESSING IMPLICATIONS: That you get the job implies that you have the best credentials. – If you get the job, then you have the best credentials It is necessary to walk 8 miles to get to the top of the Peak. – If you get to the top of the peak, then you must have walked 8 miles.

HIERARCHY OF OPERATIONS FOR LOGICAL CONNECTIVES ~ (negation) ∧ (conjunction), ∨ (disjunction) → (conditional)

TRANSLATING ENGLISH SENTENCES TO SYMBOLS: Let p and q be propositions: p = “you get an A on the final exam” q = “you do every exercise in this book” r = “you get an A in this class” To get an A in this class it is necessary for you to get an A on the final. p → r You do every exercise in this book; You get an A on the final, implies, you get an A in the class. p ∧ q → r

Construct a truth table for the statement form p ∨ ~ q → ~ p

LOGICAL EQUIVALENCE INVOLVING IMPLICATION Use truth table to show p→q = ~q → ~p

IMPLICATION LAW p→q = ~p ∨ q

NEGATION OF A CONDITIONAL STATEMENT: Since p→q = ~p ∨ q therefore ~ (p → q) = ~ (~ p ∨ q) = ~ (~ p) ∧ (~ q) by De Morgan’s law = p ∧ ~ q by the Double Negative law Thus the negation of “if p then q” is logically equivalent to “p and not q”. Accordingly, the negation of an if-then statement does not start with the word if.

EXAMPLES Write negations of each of the following statements: If Ali lives in Pakistan then he lives in Lahore. Ali lives in Pakistan and he does not live in Lahore. If my car is in the repair shop, then I cannot get to class. 3. My car is in the repair shop and I can get to class

INVERSE OF A CONDITIONAL STATEMENT: The inverse of the conditional statement p → q is ~p → ~q A conditional and its inverse are not equivalent as could be seen from the truth table.

WRITING INVERSE: If today is Friday, then = 5. If today is not Friday, then ≠ 5. If it snows today, I will ski tomorrow. If it does not snow today I will not ski tomorrow. If P is a square, then P is a rectangle. If P is not a square then P is not a rectangle. If my car is in the repair shop, then I cannot get to class. If my car is not in the repair shop, then I shall get to the class.

CONVERSE OF A CONDITIONAL STATEMENT: The converse of the conditional statement p → q is q →p A conditional and its converse are not equivalent.

WRITING CONVERSE: If today is Friday, then = 5. If = 5, then today is Friday. If it snows today, I will ski tomorrow. I will ski tomorrow only if it snows today. If P is a square, then P is a rectangle. If P is a rectangle then P is a square. If my car is in the repair shop, then I cannot get to class. If I cannot get to the class, then my car is in the repair shop.

CONTRAPOSITIVE OF A CONDITIONAL STATEMENT: The contrapositive of the conditional statement p → q is~ q → ~ p A conditional and its contrapositive are equivalent. Symbolically 1. If today is Friday, then = 5. If ≠ 5, then today is not Friday. If it snows today, I will ski tomorrow. I will not ski tomorrow only if it does not snow today. If P is a square, then P is a rectangle. If P is not a rectangle then P is not a square. If my car is in the repair shop, then I cannot get to class. If I get to the class, then my car is not in the repair shop.

BICONDITIONAL If p and q are statement variables, the biconditional of p and q is “p if, and only if, q” and is denoted p↔q. if and only if abbreviated iff. The double headed arrow " ↔" is the biconditional operator.

BICONDITIONAL “1+1 = 3 if and only if earth is flat” TRUE “Sky is blue iff 1 = 0” FALSE “Milk is white iff humans are mortals” TRUE “33 is divisible by 4 if and only if horse has four legs” FALSE p↔q = (p→q) ∧ (q→p)