Scribd Logo
Upload

Welcome to Scribd!

  • 3 views

    Assignment No1 MTH

    Uploaded by

    bc240217786mpa
    This assignment based on true solution

    Copyright:

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

    Assignment No1 MTH

    Uploaded by

    bc240217786mpa
    3 views2 pages
    This assignment based on true solution

    Original Title

    Assignment No1 mth

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This assignment based on true solution

    Copyright:

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

    Assignment No1 MTH

    Uploaded by

    bc240217786mpa
    This assignment based on true solution

    Copyright:

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

    Assignment No.

    01

    MTH202 (Fall 2024)

    Section in-charge Shahzad khan

    Bc240217786 (Maha Parveen)

    Question #1 10 Marks

    Prove the following logical equivalence using a truth table:

    𝒑˄𝒒 ≡∼ (𝒑 →∼ 𝒒)

    Answer:

    ∼𝒒 𝒑 →∼ 𝒒 ∼ (𝒑 →∼
    𝒒)
    p q p˄𝒒

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

    From the truth table, the column for p˄𝒒 matches with ∼ (𝒑 →∼ 𝒒), confirming
    F F F T T F

    that 𝒑˄𝒒 ≡∼ (𝒑 →∼ 𝒒).

    Question No: 2 10 Mark

    Show that (p → q) ∧ (q → p) is logically equivalent to

    P ↔ q.

    Answer:

    p q p→q q→p (p → q) ∧ (q → P ↔ q.
    p)
    T T T T T T
    T F F T F F
    F T T F F F

    The column for (p → q) ∧ (q → p) and P ↔ q match, verifying the equlvance.


    F F T T T T
    Question No:3 10 Marks

    Use the logical equivalences above to show that ∼ (p ∨ ∼ (p ∧ q)) is a

    Contradiction.

    Answer:

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

    The column for ∼ (p ∨ ∼ (p ∧ q)) is false in all cases, proving that it is a


    F F F T T F

    contradiction.

    Question No: 4 10 Marks

    Show that (P → Q) ∨ (Q → P) is a tautology.

    Answer:

    P Q P→Q Q→P (P → Q) ∨ (Q →
    P)
    T T T T T
    T F F T T
    F T T F T
    F F T T T

    The column for (P → Q) ∨ (Q → P) is the true in all cases, confirming that it is a


    tautology.

    You might also like