Scribd Logo
Upload

Welcome to Scribd!

  • 01 Activity 2 - ARG

    Uploaded by

    stapa
    23 views1 page
    The document provides the solutions to two discrete math problems using truth tables. [1] The first problem shows that the statement (p v q) v [(¬ p ^ ¬ q)] is a tautology by constructing a truth table that evaluates to true in all cases. [2] The second problem shows that the statements (p ^ q) and (p ^ q) v (¬ p ^ ¬ q) are logically equivalent by constructing a truth table where the statements evaluate to the same truth values in all cases.

    Original Description:

    Discrete math

    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
    The document provides the solutions to two discrete math problems using truth tables. [1] The first problem shows that the statement (p v q) v [(¬ p ^ ¬ q)] is a tautology by constructing a truth table that evaluates to true in all cases. [2] The second problem shows that the statements (p ^ q) and (p ^ q) v (¬ p ^ ¬ q) are logically equivalent by constructing a truth table where the statements evaluate to the same truth values in all cases.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    23 views1 page

    01 Activity 2 - ARG

    Uploaded by

    stapa
    The document provides the solutions to two discrete math problems using truth tables. [1] The first problem shows that the statement (p v q) v [(¬ p ^ ¬ q)] is a tautology by constructing a truth table that evaluates to true in all cases. [2] The second problem shows that the statements (p ^ q) and (p ^ q) v (¬ p ^ ¬ q) are logically equivalent by constructing a truth table where the statements evaluate to the same truth values in all cases.

    Copyright:

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

    CPE 201

    Discrete Math March 10,


    2022

    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.

    p q ¬p ¬q ¬p^¬q pvq (p v q) v [(¬ p ^ ¬ q)]


    0 0 1 1 1 0 1
    0 1 1 0 0 1 1
    1 0 0 1 0 1 1
    1 1 0 0 0 1 1

     Based from the output of the truth table, all are true. For that reason, it is a tautology.

    2. Show that  are logically equivalent.

    p q p↔q (p ^ q) ¬p ¬q (¬ p ^ ¬ q) (p ^ q) v ( ¬ p ^ ¬ q)
    1 1 1 1 0 0 0 1
    1 0 0 0 0 1 0 0
    0 1 0 0 1 0 0 0
    0 0 1 0 1 1 1 1

     Based from the result of the truth table, the result are the same, therefore we can tell
    that they are logically equivalent.

    You might also like