Scribd
Upload
181 views1 page

Show, by The Use of The Truth Table/matrix, That The Statement Is A Tautology

The document shows the truth tables for two logical statements: 1) (pvq) v [(¬p) ^ (¬q)] is a tautology as it is true for all possible combinations of p and q. 2) p ↔ q and (p ^ q) v (¬p) ^ (¬q) are logically equivalent since they produce the same truth values for each row of the truth table.

Uploaded by

Russelle jude
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
181 views1 page

Show, by The Use of The Truth Table/matrix, That The Statement Is A Tautology

The document shows the truth tables for two logical statements: 1) (pvq) v [(¬p) ^ (¬q)] is a tautology as it is true for all possible combinations of p and q. 2) p ↔ q and (p ^ q) v (¬p) ^ (¬q) are logically equivalent since they produce the same truth values for each row of the truth table.

Uploaded by

Russelle jude
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

RUSSELLE JUDE ANICETO – BSIT207

03-14-22
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 pvq ¬p ¬q ¬p ^ ¬q (pvq) v [(¬p) ^ (¬q)]
T T T F F T T
F F F T T T T
T F T F T F T
F T T T F F T

Tautology is defined as a compound proposition that is always true for all possible truth
value of the constituent proposition. AS shown in the table above, (pvq) v [(¬p) ^ (¬q)] is
true. Hence, it is a tautology.

2. Show that  are logically equivalent.

p q p^q ¬p ¬q ¬p ^ ¬q (p ^ q) v (¬p) ^ (¬q)


T T T F F T T
F F T T T T T
T F F F T F F
F T T T F F F
p q p↔q
T T T
F F T
T F F
F T F

As Shown in the table above, both propositions produced same result, which is true,
false, Therefore p ↔ q and (pvq) v [(¬p) ^ (¬q)] is logically equivalent.

You might also like