Scribd Logo
Upload

Welcome to Scribd!

  • Discrete Mathematics and Its Applications - Kenneth Rosen (2012)

    Uploaded by

    butt production
    232 views4 pages
    This document contains the name and enrollment details of a student named Muhammad Ali Butt enrolled in BSCS-2A. It also contains 5 questions related to propositional logic. Question 1 has 4 parts evaluating different logical expressions. Question 2 has 4 parts evaluating more complex logical expressions. Questions 3, 4 and 5 prove the logical equivalence of different expressions through truth tables.

    Original Description:

    Ex 1.4 - Question 10-11-12-21-22-23

    Original Title

    Discrete Mathematics and Its Applications - Kenneth Rosen (2012) -

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains the name and enrollment details of a student named Muhammad Ali Butt enrolled in BSCS-2A. It also contains 5 questions related to propositional logic. Question 1 has 4 parts evaluating different logical expressions. Question 2 has 4 parts evaluating more complex logical expressions. Questions 3, 4 and 5 prove the logical equivalence of different expressions through truth tables.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    232 views4 pages

    Discrete Mathematics and Its Applications - Kenneth Rosen (2012)

    Uploaded by

    butt production
    This document contains the name and enrollment details of a student named Muhammad Ali Butt enrolled in BSCS-2A. It also contains 5 questions related to propositional logic. Question 1 has 4 parts evaluating different logical expressions. Question 2 has 4 parts evaluating more complex logical expressions. Questions 3, 4 and 5 prove the logical equivalence of different expressions through truth tables.

    Copyright:

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

    Name: Muhammad Ali Butt Enroll: 03-134202-040 Class: BSCS-2A

    Question:1

    a) (p ∧ q) → p

    p q p^q (p ^ q)->q
    T T T T
    T F F T
    F T F T
    F F F T

    b) p → (p ∨ q)

    p Q p∨q p → (p ∨ q)
    T T T T
    T F T T
    F T T T
    F F F T

    c) ¬p → (p → q)

    p q ¬p (p- > q) p’- > (p- > q)


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

    d) (p ∧ q) → (p → q)

    p q p^q p→q (p ∧ q) → (p → q)
    T T T T T
    T F F F T
    F T F T T
    F F F T T

    Question:2
    a) [¬p ∧ (p ∨ q)] → q
    p q p ∨ q ¬p ∧ (p ∨ q) [¬p ∧ (p ∨ q)] → q
    ¬p
    T T F T F T
    T F F T F T
    F T T T T T
    F F T F F T
    p q r p→q q → r (p → (p → q) ∧ (q → r) [(p → q) ∧ (q → r)] → (p → r)
    r)
    T T T T T T T T
    T T F T F T F T
    T F T F T T F T
    T F F F T F F T
    F T T T T T T T
    F T F T F F F T
    F F T T T T T T
    F F F T T T T T

    b) b) [(p → q) ∧ (q → r)] → (p → r)

    c) [p ∧ (p → q)] → q

    p q p→ p ∧ (p → q) [p ∧ (p → q)] → q
    q
    T T T T T
    T F F F T
    F T T F T
    F F T F T

    d) d) [(p ∨ q) ∧ (p → r) ∧ (q → r)] → r

    p q r p∨ p→ (q → r) [(p ∨ q) ∧ (p → r) ∧ (q → [(p ∨ q) ∧ (p → r) ∧ (q → r)] → r


    q r r)
    T T T T T T T T
    T T F T T F F T
    T F T T T T T T
    T F F T F T F T
    F T T T T T T T
    F T F T F F F T
    F F T F T T F T
    F F F F T T F T

    Q3: Show that ¬(p ↔ q) and ¬p ↔ q are logically equivalent.

    p q p ↔ q ¬(p ↔ q)
    T T T F
    T F F T
    F T F T
    F F T F

    p q ¬p ¬p ↔ q
    T T F F
    T F F T
    F T T T
    F F T F

    Q4: Show that (p → q) ∧ (p → r) and p → (q ∧ r) are logically equivalent.

    p q r (p → (p → r) (p → q) ∧ (p → r)
    q)
    T T T T T T
    T T F T T T
    T F T F T F
    T F F F F F
    F T T T T T
    F T F T F F
    F F T T T T
    F F F T T T

    p q r (q ∧ r) p → (q ∧ r)
    T T T T T
    T T F F T
    T F T F F
    T F F F F
    F T T T T
    F T F F F
    F F T F T
    F F F F T

    Q5: Show that (p → r) ∨ (q → r) and (p ∧ q) → r are logically equivalent.

    p q r (p → r) (q → r) (p → r) ∨ (q → r)
    T T T T T T
    T T F T F F
    T F T T T T
    T F F F T T
    F T T T T T
    F T F F F T
    F F T T T T
    F F F T T T

    p q r (p ∧ q) (p ∧ q) → r
    T T T T T
    T T F T F
    T F T F T
    T F F F T
    F T T F T
    F T F F T
    F F T F T
    F F F F T

    You might also like