Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
8 views2 pages

Mth202 Assignment

The document contains a series of logical proofs and truth tables demonstrating logical equivalences and the validity of arguments. It includes the proof of De Morgan's Law, the identification of a tautology, the construction of a truth table for a compound expression, and the validity of an argument using truth values. Each question is clearly laid out with corresponding truth tables and conclusions drawn from the results.

Uploaded by

myipad665
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
0% found this document useful (0 votes)
8 views2 pages

Mth202 Assignment

The document contains a series of logical proofs and truth tables demonstrating logical equivalences and the validity of arguments. It includes the proof of De Morgan's Law, the identification of a tautology, the construction of a truth table for a compound expression, and the validity of an argument using truth values. Each question is clearly laid out with corresponding truth tables and conclusions drawn from the results.

Uploaded by

myipad665
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

BC240420833

Question 1

Prove the logical equivalence using a truth table:

¬(p ∨ q) ≡ (¬p ∧ ¬q)

p q ¬(p ∨ q) ¬p ∧ ¬q
T T F F
T F F F
F T F F
F F T T
Hence proved it’s equivalent.

Question 2

Using a truth table, determine whether the following compound statement is a


tautology, contradiction, or contingency:

(p → q) ∨ (¬q → ¬p)

p q (p → q) ∨ (¬q → ¬p)
T T T
T F T
F T T
F F T
All outputs are T, so the statement is a tautology.

Question 3

Construct a truth table for the following expression:

(p ∧ ¬q) → (q ∨ r)

p q r (p ∧ ¬q) → (q ∨ r)
T T T T
T T F T
T F T T
T F F F
F T T T
F T F T
F F T T
F F F T
Question 4

Using a truth table, determine the validity of the argument:

p→q

q→r

¬r

∴ ¬p

p q r p→q q→r ¬r ¬p

T T T T T F F
T T F T F T F
T F T F T F F
T F F F T T F
F T T T T F T
F T F T F T T
F F T T T F T
F F F T T T T
Hence the argument is valid.

You might also like