Scribd Logo
Upload

Welcome to Scribd!

  • 8 views

    DS Lecture 4

    Uploaded by

    mtalhamalik998
    The document defines and provides examples of biconditionals. A biconditional, denoted pq, means "p if and only if q". The biconditional has a truth table and is logically equivalent to (p→q)∧(q→p). Examples demonstrate how to determine if biconditional statements are true or false. Laws of logic involving biconditionals are also presented.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    DS Lecture 4

    Uploaded by

    mtalhamalik998
    8 views5 pages
    The document defines and provides examples of biconditionals. A biconditional, denoted pq, means "p if and only if q". The biconditional has a truth table and is logically equivalent to (p→q)∧(q→p). Examples demonstrate how to determine if biconditional statements are true or false. Laws of logic involving biconditionals are also presented.

    Original Title

    DS lecture 4

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document defines and provides examples of biconditionals. A biconditional, denoted pq, means "p if and only if q". The biconditional has a truth table and is logically equivalent to (p→q)∧(q→p). Examples demonstrate how to determine if biconditional statements are true or false. Laws of logic involving biconditionals are also presented.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    8 views5 pages

    DS Lecture 4

    Uploaded by

    mtalhamalik998
    The document defines and provides examples of biconditionals. A biconditional, denoted pq, means "p if and only if q". The biconditional has a truth table and is logically equivalent to (p→q)∧(q→p). Examples demonstrate how to determine if biconditional statements are true or false. Laws of logic involving biconditionals are also presented.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 5

    Lecture 4

    Biconditional

    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.
    TRUTH TABLE FOR
    pq.
    p q p q
    T T T
    T F F
    F T F
    F F T
    EXAMPLES:
    True or false?
    1. “1+1 = 3 if and only if earth is flat”
    TRUE
    2. “Sky is blue iff 1 = 0”
    FALSE3. “Milk is white iff birds lay eggs”
    TRUE
    4. “33 is divisible by 4 if and only if horse has four legs”
    FALSE
    5. “x > 5 iff x2 > 25”
    FALSE
    pq  (pq)(qp)
    p q pq pq qp (pq)(qp)

    T T T T T T
    T F F F T F
    F T F T F F
    F F T T T T

    same truth values


    REPHRASING BICONDITIONAL:
    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.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 FOR
    (pq)  (~ q ~ p)

    p q pq ~q ~p ~ q ~ p (pq)  (~ q ~ p)
    T T T F F T T
    T F F T F F T
    F T T F T T T
    F F T T T T T
    TRUTH TABLE FOR
    (pq)(rq)
    p q r pq rq (pq)(rq)
    T T T T T T
    T T F T F F
    T F T F F T
    T F F F T F
    F T T F T F
    F T F F F T
    F F T T F F
    F F F T T T
    TRUTH TABLE FOR

    p  ~r qr

    Here p  ~ r q  r means (p  (~ r)) (q  r)

    p q r ~r p~r qr p  ~r qr


    T T T F F T F
    T T F T T T T
    T F T F F T F
    T F F T T F F
    F T T F F T F
    F T F T F T F
    F F T F F T F
    F F F T F F T

    LOGICAL EQUIVALENCE

    INVOLVING BICONDITIONAL
    Show that ~pq and p~q are logically equivalent
    p q ~p ~q ~pq p~q
    T T F F F F
    T F F T T T
    F T T F T T
    F F T T F F
    same truth values

    EXERCISE:
    Show that ~(pq) and pq are logically equivalent
    p q pq ~(pq) pq
    T T F T T
    T F T F F
    F T T F F
    F F F T T
    same truth values
    LAWS OF LOGIC:
    1. Commutative Law: pqqp
    2. Implication Laws: p q  ~p  q
     ~(p  ~q)
    3. Exportation Law: (p  q)r  p (q r)
    4. Equivalence: p  q  (p q)(q p)
    5. Reductio ad absurdum p q  (p  ~q) c
    APPLICATION:
    Rewrite the statement forms without using the symbols  or 
    1. p~qr 2. (pr)(q r)
    SOLUTION
    1. p~qr  (p~q)r order of operations
    ~(p~q)  r implication law
    2. (pr)(q r)  (~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
    Rewrite the statement form ~p  q  r  ~q to a logically equivalent form that uses
    only ~ and 
    SOLUTION
    STATEMENT REASON
    ~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
    Show that ~(pq)  p is a tautology without using truth tables.

    SOLUTION
    STATEMENT REASON

    ~(pq)  p Given statement form


     ~[~(p  ~q)]  p Implication law pq  ~(p  ~q)
     (p  ~q)  p Double negation law
     ~(p  ~q)  p Implication law pq  ~p  q
     (~p  q)  p De Morgan’s law
     (q  ~p)  p Commutative law of
     q  (~p  p) Associative law of
     q  t Negation law
    t Universal 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

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy