Scribd
Upload
231 views1 page

DC Act 2

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.

Uploaded by

Kristel Boral
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
231 views1 page

DC Act 2

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.

Uploaded by

Kristel Boral
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/ 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