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.

Slides:



Advertisements
Similar presentations
Propositional Equivalences
Advertisements

Discrete Mathematics Lecture 1 Logic of Compound Statements
Goals Determine the true value of statements with AND, OR, IF..THEN. Negate statements with the connectives above Construct truth tables Understand when.
The Foundation: Logic Conditional Statements Muhammad Arief download dari
2.2 Conditional Statements. Goals Identify statements which are conditional Identify the antecedent and consequent of a conditional statement Negate conditional.
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.
Discrete Mathematics Lecture 1 Logic of Compound Statements Harper Langston New York University.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
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.
Discrete Mathematics Math 6A Instructor: M. Welling.
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
Propositions and Truth Tables
Discrete Maths 2. Propositional Logic Objective
MATERI II PROPOSISI. 2 Tautology and Contradiction Definition A tautology is a statement form that is always true. A statement whose form is a tautology.
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.
(CSC 102) Lecture 3 Discrete Structures. Previous Lecture Summary Logical Equivalences. De Morgan’s laws. Tautologies and Contradictions. Laws of Logic.
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
Thinking Mathematically Logic 3.6 Negations of Conditional Statements and De Morgan’s Laws.
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.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.
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 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
Chapter 1: The Foundations: Logic and Proofs
UMBC CMSC 203, Section Fall CMSC 203, Section 0401 Discrete Structures Fall 2004 Matt Gaston
Symbolic Logic The Following slide were written using materials from the Book: The Following slide were written using materials from the Book: Discrete.
Mathematics for Comter I Lecture 3: Logic (2) Propositional Equivalences Predicates and Quantifiers.
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.
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.
Law of logic Lecture 4.
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
Simple Logic.
Chapter 1 – Part 3 ELEMENTARY LOGIC
Chapter 1 Propositional Logic
Discrete Mathematical
2. The Logic of Compound Statements Summary
The Foundations: Logic and Proofs
DISCRETE MATHEMATICS CHAPTER I.
Discrete Mathematics Lecture 1 Logic of Compound Statements
CSNB 143 Discrete Mathematical Structures
Truth Tables and Equivalent Statements
Chapter 1 – Logic and Proof
6/20/2018 Arab Open University Faculty of Computer Studies M131 - Discrete Mathematics 6/20/2018.
Logic.
Lecture 03 Logic and Propositional Calculus Profs. Koike and Yukita
MATH 245 Spring 2009 This is mathematics for computer science
Biconditional - 2 CS-708.
(CSC 102) Discrete Structures Lecture 2.
Discrete Mathematics Lecture # 2.
CMSC Discrete Structures
Propositional Equivalences
Information Technology Department
CS 220: Discrete Structures and their Applications
Discrete Mathematics Dr.-Ing. Erwin Sitompul
CSS 342 Data Structures, Algorithms, and Discrete Mathematics I
Discrete Mathematics and Its Applications Kenneth H
Discrete Mathematics Lecture 2: Propositional Logic
Discrete Mathematics Lecture # 3.
Discrete Mathematics CMP-200 Propositional Equivalences, Predicates & Quantifiers, Negating Quantified Statements Abdul Hameed
CSE 321 Discrete Structures
Discrete Mathematics Lecture 2: Propositional Logic
1.3 Propositional Equivalences
Discrete Structures Prepositional Logic 2
Conditional Statements Section 2.3 GEOMETRY
Presentation transcript:

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 is denoted p  q. if and only if abbreviated iff.  The double headed arrow "  " is the bi conditional operator.

Truth Table

Examples

 “ 1+1 = 3 if and only if earth is flat ”  TRUE  “ Sky is blue iff 1 = 0 ”  FALSE  “ Milk is white iff birds lay eggs ”  TRUE  “ 33 is divisible by 4 if and only if horse has four legs ”  FALSE  “ x > 5 iff x2 > 25 ”  FALSE

Rephrasing Bi conditional p  q is also expressed as:  “p is necessary and sufficient for q”  “if p then q, and conversely”  “p is equivalent to q”

Exercise  Rephrase the following propositions in the form “p if and only if q” in English.  1. If it is hot outside you buy an ice cream cone, and if you buy an ice cream cone it is hot outside.  Sol You buy an ice cream cone if and only if it is hot outside.  2. For you to win the contest it is necessary and sufficient that you have the only winning ticket.  Sol You win the contest if and only if you hold the only winning ticket.  3. If you read the news paper every day, you will be informed and conversely.  Sol You will be informed if and only if you read the news paper every day.

Exercise  4.It rains if it is a weekend day, and it is a weekend day if it rains.  Sol It rains if and only if it is a weekend day.  5. The train runs late on exactly those days when I take it.  Sol The train runs late if and only if it is a day I take the train.  6. This number is divisible by 6 precisely when it is divisible by both 2 and 3.  Sol This number is divisible by 6 if and only if it is divisible by both 2 and 3.

Exercise  4.It rains if it is a weekend day, and it is a weekend day if it rains.  Sol It rains if and only if it is a weekend day.  5. The train runs late on exactly those days when I take it.  Sol The train runs late if and only if it is a day I take the train.  6. This number is divisible by 6 precisely when it is divisible by both 2 and 3.  Sol This number is divisible by 6 if and only if it is divisible by both 2 and 3.

Truth Table  (p  q)  (~ q  ~ p)

Truth Table  (p  q)  (r  q)

Truth Table  p  ~r  q  r  Here p  ~ r  q  r means (p  (~ r))  (q  r)

Logical Equivalence Involving Bi-conditional  Show that ~p  q and p  ~q are logically equivalent

Logical Equivalence Involving Bi-conditional  Show that ~(p  q) and p  q are logically equivalent

Laws of Logic

APPLICATION  Rewrite the statement forms without using the symbols  or   p  ~q  r  SOLUTION  p  ~q  r  (p  ~q)  r order of operations   ~(p  ~q)  r implication law

APPLICATION  Rewrite the statement forms without using the symbols  or   (p  r)  (q  r)  SOLUTION   (~p  r)  (~q  r) implication law   [(~p  r)  (~q  r)]  [(~q  r)  (~p  r)] equivalence of biconditional   [~(~p  r)  (~q  r)]  [~(~q  r)  (~p  r)] implication law

APPLICATION  Rewrite the statement form ~p  q  r  ~q to a logically equivalent form that uses only ~ and   SOLUTION  =~p  q  r  ~q Given statement form   (~p  q)  (r  ~q) Order of operations   ~[(~p  q)  ~ (r  ~q)] Implication law p  q  ~(p  ~ q)   ~[~(p  ~q)  (~r  q)] De Morgan’s law

APPLICATION  Show that ~(p  q)  p is a tautology without using truth tables.  SOLUTION  STATEMENTREASON  ~(p  q)  pGiven statement form   ~[~(p  ~q)]  pImplication law p  q  ~(p  ~q)   (p  ~q)  pDouble negation law   ~(p  ~q)  pImplication law p  q  ~p  q   (~p  q)  pDe Morgan’s law   (q  ~p)  pCommutative law of    q  (~p  p)Associative law of    q  t Negation law   tUniversal bound law

EXERCISE  Suppose that p and q are statements so that p  q is false. Find the truth values of each of the following: 1) ~ p  q 2) p  q 3) q  p  SOLUTION 1) TRUE 2) TRUE 3) FALSE