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

Welcome to Scribd!

  • 223 views

    DC Act 2

    Uploaded by

    Kristel Boral
    The document contains two logic problems to solve using truth tables. The first problem shows that the statement (p ∨ q) ∨ [(¬p) ∧ (¬q)] is a tautology by constructing a truth table with all entries in the last column being true. The second problem shows that the statements p ↔ q and (p ∧ q) ∨ (¬p ∧ ¬q) are logically equivalent by constructing a truth table where the last two columns are identical.

    Copyright:

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

    DC Act 2

    Uploaded by

    Kristel Boral
    223 views1 page
    The document contains two logic problems to solve using truth tables. The first problem shows that the statement (p ∨ q) ∨ [(¬p) ∧ (¬q)] is a tautology by constructing a truth table with all entries in the last column being true. The second problem shows that the statements p ↔ q and (p ∧ q) ∨ (¬p ∧ ¬q) are logically equivalent by constructing a truth table where the last two columns are identical.

    Original Title

    dc act 2

    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 contains two logic problems to solve using truth tables. The first problem shows that the statement (p ∨ q) ∨ [(¬p) ∧ (¬q)] is a tautology by constructing a truth table with all entries in the last column being true. The second problem shows that the statements p ↔ q and (p ∧ q) ∨ (¬p ∧ ¬q) are logically equivalent by constructing a truth table where the last two columns are identical.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    223 views1 page

    DC Act 2

    Uploaded by

    Kristel Boral
    The document contains two logic problems to solve using truth tables. The first problem shows that the statement (p ∨ q) ∨ [(¬p) ∧ (¬q)] is a tautology by constructing a truth table with all entries in the last column being true. The second problem shows that the statements p ↔ q and (p ∧ q) ∨ (¬p ∧ ¬q) are logically equivalent by constructing a truth table where the last two columns are identical.

    Copyright:

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

    Perform the following items. Upload a photo of your answer sheet showing your solution.

     (2 items x 10
    points)

    1. Show, by the use of the truth table/matrix, that the

    statement   is a tautology.

    Answer:

    (p ∨ q) ∨ [(¬p) ∧ (¬q)]

    p q p∨q ¬p ¬q ¬p ∧ ¬q (p ∨ q) ∨ (¬p ∧ ¬q)

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

    all entries in the last column are True 

    Hence, (p ∨ q) ∨ [(¬p) ∧ (¬q)] is a Tautology 

    2. Show that  are logically equivalent.

    Answer:

    p ↔ q and (p ∧ q) ∨ (¬p ∧ ¬q)

    p q p∧q ¬p ¬q ¬p ∧ ¬q (p ∧ q) ∨ (¬p ∧ ¬q) p↔q


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

    The last two columns of table are identical that is same 

    Hence, p ↔ q and (p ∧ q) ∨ (¬p ∧ ¬q) are logically equivalent.

    You might also like