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

Welcome to Scribd!

  • 388 views

    01 Task Performance 1/prelim Exam - ARG

    Uploaded by

    Jerome Bautista
    The document provides instructions and solutions to three logic problems: 1) It translates an English statement into propositional logic as "g ↔ (r ^ !m ^ !b)". 2) It shows through a truth table that the statements "p ∨ q" and "q → (p ∨ r)" are logically equivalent. 3) It uses a truth table to show that the statement "(p ∨ q) ∨ [(¬p) ∧ (¬q)]" is a contradiction.

    Copyright:

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

    01 Task Performance 1/prelim Exam - ARG

    Uploaded by

    Jerome Bautista
    388 views2 pages
    The document provides instructions and solutions to three logic problems: 1) It translates an English statement into propositional logic as "g ↔ (r ^ !m ^ !b)". 2) It shows through a truth table that the statements "p ∨ q" and "q → (p ∨ r)" are logically equivalent. 3) It uses a truth table to show that the statement "(p ∨ q) ∨ [(¬p) ∧ (¬q)]" is a contradiction.

    Original Description:

    task performance

    Original Title

    01 Task Performance 1/Prelim Exam - ARG

    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 provides instructions and solutions to three logic problems: 1) It translates an English statement into propositional logic as "g ↔ (r ^ !m ^ !b)". 2) It shows through a truth table that the statements "p ∨ q" and "q → (p ∨ r)" are logically equivalent. 3) It uses a truth table to show that the statement "(p ∨ q) ∨ [(¬p) ∧ (¬q)]" is a contradiction.

    Copyright:

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

    01 Task Performance 1/prelim Exam - ARG

    Uploaded by

    Jerome Bautista
    The document provides instructions and solutions to three logic problems: 1) It translates an English statement into propositional logic as "g ↔ (r ^ !m ^ !b)". 2) It shows through a truth table that the statements "p ∨ q" and "q → (p ∨ r)" are logically equivalent. 3) It uses a truth table to show that the statement "(p ∨ q) ∨ [(¬p) ∧ (¬q)]" is a contradiction.

    Copyright:

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

    JOREEN MAY M.

    MARASIGAN

    Perform the following items. Upload photos of your answer sheets showing your name
    and solution. (40 points)
    1. Given the following:
     g: "You can graduate."
     m: "You owe money to the college."
     r: "You have completed the requirements of your major."
     b: "You have an overdue book."
    Translate  "You can graduate only if you have completed the requirements of your
    major, you do not owe money to the college, and you do not have an overdue book."
    into a propositional logic.

    Answer: g ↔ (r ^ !m ^ !b)

    2. Show that   are logically equivalent. (15 points)


    p q r !p q→r !p → (q → r)
    1 1 1 0 1 1
    1 1 0 0 0 1
    1 0 1 0 1 1
    1 0 0 0 1 1
    0 1 1 1 1 1
    0 1 0 1 0 0
    0 0 1 1 1 1
    0 0 0 1 1 1

    p q r pvr q → (p v r)
    1 1 1 1 1
    1 1 0 1 1
    1 0 1 1 1
    1 0 0 1 1
    0 1 1 1 1
    0 1 0 0 0
    0 0 1 1 1
    0 0 0 0 1

    By the table presented above it shows that the last column are identical, so thus
    are logically equivalent.
    3. Show, by the use of the truth table (truth matrix), that the   is a
    contradiction. (15 points)
    p q !p !q (pvq) (!p) ^ (1q) (pvq) v
    [(!p) ^ (!q)]
    1 1 0 0 1 0 0
    1 0 0 1 1 0 0
    0 1 1 0 1 0 0
    0 0 1 1 0 1 0

    It shows from the table above that the compound formula is always false, so thus (pvq) v [(!p) ^ (!q)] is a
    contradiction.

    You might also like