Scribd
Upload
95 views2 pages

01 Task Performance 1 Prelim Exam - ARG

1. The document provides instructions to translate a statement about graduation requirements into propositional logic. The translation is given as g → (r ∧ ¬m ∧ ¬b). 2. Students are asked to show that two logical statements are logically equivalent using a truth table. 3. Another task is to show that a logical statement is a contradiction using a truth table. The truth table demonstrates that (p ∨ q) ∧ [(¬p) ∧ (¬q)] produces only false values, proving it is a contradiction.

Uploaded by

stapa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
95 views2 pages

01 Task Performance 1 Prelim Exam - ARG

1. The document provides instructions to translate a statement about graduation requirements into propositional logic. The translation is given as g → (r ∧ ¬m ∧ ¬b). 2. Students are asked to show that two logical statements are logically equivalent using a truth table. 3. Another task is to show that a logical statement is a contradiction using a truth table. The truth table demonstrates that (p ∨ q) ∧ [(¬p) ∧ (¬q)] produces only false values, proving it is a contradiction.

Uploaded by

stapa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

CPE 201

Discrete Math March 18,


2022

Perform the following items. Upload photos of your answer sheets showing your name and
solution.

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.
 Translating it into propositional logic will be = g → (r ∧ ¬ m ∧ ¬b)

2. Show that   are logically equivalent.

p q r ¬p q→r ¬ p → (q → r) p∨r q → (p ∨ r)
1 0 1 0 1 1 1 1
1 1 1 0 1 1 1 1
1 0 0 0 1 1 1 1
1 1 0 0 0 1 1 1
0 0 1 1 1 1 1 1
0 1 1 1 1 1 1 1
0 0 0 1 1 1 0 1
0 1 0 1 0 0 0 0
3. Show, by the use of the truth table (truth matrix), that the   
Is a contradiction. 

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


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

 Based from the truth table (p ∨ q) ∨ [(¬p) ∧ (¬q)] is a tautology.

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


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

 But if we use this truth table above. (p ∨ q) ∧ [(¬p) ∧ (¬q)] is a contradiction.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy