Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 55 views

    Mth202 Lecher#2

    Uploaded by

    Muhammad Zeeshan
    The document discusses truth tables and logical concepts such as exclusive OR, logical equivalence, De Morgan's laws, tautologies, contradictions, and laws of logic. It provides examples and truth tables to illustrate these concepts. Specifically, it gives the truth tables for the statements "~p ∧ q", "~p ∧ (q ∨ ~r)", and "(p∨q) ∧ ~(p∧q)" and explains what exclusive OR means. It also defines logical equivalence, De Morgan's laws, tautologies, contradictions, and lists several common laws of logic.

    Copyright:

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

    Mth202 Lecher#2

    Uploaded by

    Muhammad Zeeshan
    55 views4 pages
    The document discusses truth tables and logical concepts such as exclusive OR, logical equivalence, De Morgan's laws, tautologies, contradictions, and laws of logic. It provides examples and truth tables to illustrate these concepts. Specifically, it gives the truth tables for the statements "~p ∧ q", "~p ∧ (q ∨ ~r)", and "(p∨q) ∧ ~(p∧q)" and explains what exclusive OR means. It also defines logical equivalence, De Morgan's laws, tautologies, contradictions, and lists several common laws of logic.

    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 discusses truth tables and logical concepts such as exclusive OR, logical equivalence, De Morgan's laws, tautologies, contradictions, and laws of logic. It provides examples and truth tables to illustrate these concepts. Specifically, it gives the truth tables for the statements "~p ∧ q", "~p ∧ (q ∨ ~r)", and "(p∨q) ∧ ~(p∧q)" and explains what exclusive OR means. It also defines logical equivalence, De Morgan's laws, tautologies, contradictions, and lists several common laws of logic.

    Copyright:

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

    Mth202 Lecher#2

    Uploaded by

    Muhammad Zeeshan
    The document discusses truth tables and logical concepts such as exclusive OR, logical equivalence, De Morgan's laws, tautologies, contradictions, and laws of logic. It provides examples and truth tables to illustrate these concepts. Specifically, it gives the truth tables for the statements "~p ∧ q", "~p ∧ (q ∨ ~r)", and "(p∨q) ∧ ~(p∧q)" and explains what exclusive OR means. It also defines logical equivalence, De Morgan's laws, tautologies, contradictions, and lists several common laws of logic.

    Copyright:

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

    BY ALONE WOLF GROUP

    Lecture No.2 Truth Tables

    1. ~ p ∧ q

    2. ~ p ∧ (q ∨ ~ r)

    3. (p∨q) ∧ ~ (p∧q)

    Truth table for the statement form ~ p ∧ q

    P Q ~p ~ p∧ q
    T T F F
    T F F F
    F T T T
    F F T F

    Truth table for ~ p ∧ (q ∨ ~ r)

    p q r ~r q∨~r ~p ~ p ∧ (q ∨~r)
    T T T F T F F
    T T F T T F F
    T F T F F F F
    T F F T T F F
    F T T F T T T
    F T F T T T T
    F F T F F T F
    F F F T T T T

    Truth table for (p∨q) ∧ ~ (p∧q)

    P q P∨q P∧q ~ ( p ∧ q) (p ∨ q) ∧ ~ (p ∧
    q)
    T T T T F F
    T F T F T F
    F T T F T F
    F F F F T F

    WHAT IS EXCLUSIVE OR?


    When OR is used in its exclusive sense, the statement “p or q” means “p or q but not both” or “p or q
    BY ALONE WOLF GROUP
    and not p and q” which translates into symbols as (p ∨ q) ∧ ~ (p ∧ q) It is abbreviated as p ⊕ q or p XOR
    q

    p q p⊕q
    T T F
    T F T
    F T T
    F F F

    WHAT IS LOGICAL EQUIVALENCE?

    If two logical expressions have the same logical values in the truth table, then we say that the two
    logical expressions are logically equivalent. I

    DE MORGAN’S LAWS

    1) The negation of an AND statement is logically equivalent to the OR statement in which each
    component is negated. Symbolically ~ (p ∧ q) ≡ ~ p ∨ ~ q

    2) The negation of an OR statement is logically equivalent to the AND statement in which each
    component is negated. Symbolically ~ (p ∨ q) ≡ ~ p ∧ ~ q

    Truth Table of ~ (p ∨ q) ≡ ~ p ∧ ~ q

    p q ~p ~q p∨q ~(p ∨ q) ~p ∧ ~q
    T T F F T F F
    T F F T T F F
    F T T F T F F
    F F T T F T T

    What is Tautology?
    A tautology is a statement form that is always true regardless of the truth values of the statement
    variables. A tautology is represented by the symbol “t”.

    EXAMPLE:
    The statement form p ∨ ~ p is tautology.

    Truth table:

    p ~p p∨~p
    BY ALONE WOLF GROUP
    T F T
    F T T
    p∨~p≡t

    What is CONTRADICTION?

    A contradiction is a statement form that is always false regardless of the truth values of the statement
    variables. A contradiction is represented by the symbol “c”.

    EXAMPLE:

    The statement form p ∧ ~ p is a contradiction.

    p ~p p∧~p
    T F F
    F T F

    LAWS OF LOGIC

    1) Commutative Laws
    p∧q≡q∧p
    p∨q≡q∨p
    2) Associative Laws
    (P ∧ q) ∧ r ≡ p ∧ ( q ∧ r )
    (P ∨ q) ∨ r ≡ p ∨ ( q ∨ r )
    3) Distributive Laws
    P ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r)
    P ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r)

    4) Identity Laws

    P∧t≡p

    P∨c≡p
    5) Negation Laws

    P ∨ ∼p ≡ t

    P ∧ ∼p ≡ c

    6) Double Negation Law

    ∼ (∼p) ≡ p

    7) Idempotent Laws

    P∧p≡p
    BY ALONE WOLF GROUP
    P∨p≡p

    8) DE Morgan’s Laws

    ~ (p ∧ q) ≡ ~p ∨ ∼q

    ~ (p ∨ q) ≡ ~p ∧ ∼q

    9) Universal Bound Laws

    P∨t≡t

    P∧c≡c

    10) Absorption Laws

    p∨(p∧q)≡p

    P ∧ (p ∨ q) ≡ p

    11) Negation of t and c

    ~T≡c

    ~C≡t

    You might also like