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

Scribd
Upload
17 views4 pages

Assignment 1

The document is an assignment by Muhammad Muneeb Iftikhar for the Discrete Mathematics course, detailing solutions to various logical problems. It includes proofs of logical equivalences, the construction of truth tables to determine logical equivalences and argument validity, and the use of membership tables to prove set identities. The assignment is submitted to Munazza Batool on May 05, 2024.

Uploaded by

MUNEEB IFTIKHAR
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
17 views4 pages

Assignment 1

The document is an assignment by Muhammad Muneeb Iftikhar for the Discrete Mathematics course, detailing solutions to various logical problems. It includes proofs of logical equivalences, the construction of truth tables to determine logical equivalences and argument validity, and the use of membership tables to prove set identities. The assignment is submitted to Munazza Batool on May 05, 2024.

Uploaded by

MUNEEB IFTIKHAR
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/ 4

Assignment #

01
By

Muhammad Muneeb Iftikhar (BC230400129)

Submitted to: Munazza Batool


Subject: Discrete Mathematics (MTH202)
Date: May 05, 2024

Department of Computer Science


Virtual University of Pakistan
Assignment # 01 Solution

Question # 01:
Show that the following statements are logically
equivalent using laws of logic.
( p ∧q ) ∨ ( ∽ p ∧ q ) ∧ ( p ∧∼ q )= p ∧ q

Solving only L.H.S:


¿ ( p ∧q ) ∨ ( ∽ p ∧ q ) ∧ ( p ∧∼ q )

¿ ( p ∧q ) ∨( ( ∽ p ∧q ) ∧ ( p ∧ ∼ q )) (Set precedence to solve the question


properly)
¿ ( p ∧q ) ∨((∽ p ∧ q ∧ p)∧∼ q) (By using Association law.)

¿ ( p ∧q ) ∨((∽ p ∧ p ∧ q)∧∼ q) (By using commutative law.)

¿ ( p ∧q ) ∨((F ∧q )∧∼ q) (By using negation law.)

¿ ( p ∧q ) ∨(F ∧(q ∧ ∼ q)) (By using Association law.)

¿ ( p ∧q ) ∨(F ∧ F ) (By using negation law.)

¿ ( p ∧q ) ∨ F (By using idempotent law.)

¿ ( p ∧q ) (By using identity law.)

Hence L.H.S = R.H.S

Question # 02:
Determine whether the following statements are
logically equivalent using truth table.
p → ( q →r )∧( p ∧ q)→ r

Solution:
p q r q→r ( p ∧q) p → ( q →r ) ( p ∧q) → r
T T T T T T T
T T F F T F F
T F T T F T T
T F F T F T T
F T T T F T T
F T F F F T T
F F T T F T T
F F F T F T T

By using upper truth tables, we can say that p → ( q →r )∧( p ∧ q)→ r


are logically equal.

Question # 03:
Determine the validity of the following argument using the
truth table.
If I get an Eid bonus, I’ll buy a new dress.
If I sell my watch, I’ll buy a new dress.
∴ If I get an Eid bonus or I sell my watch, then I’ll buy a new
dress.

Solution:
Let,
p = I get an Eid bonus.
q = I sell my watch.
r = I’ll buy a new dress.
Premise 1: p →r
Premise 2: q → r
Conclusion: ( p ∨q) → r

p q r p →r q→r ( p ∨q) ( p ∨q)→ r


T T T T T T T
T T F F F T F
T F T T T T T
T F F F T T F
F T T T T T T
F T F T F T F
F F T T T F T
F F F T T F T

Argument is valid in rows 1,3,5,7 and 8 and in invalid in 2,4 and


6.

Question No 4:
Prove the following identities using the membership table.
( A ∩ B ) ∪ ( A ∩B c ) = A

Solution:
A B B
c
( A ∩ B) ( A ∩ Bc ) ( A ∩ B ) ∪ ( A ∩B c )
1 1 0 1 0 1
1 0 1 0 1 1
0 1 0 0 0 0
0 0 1 0 0 0

By using upper membership table, we can say that this

( A ∩ B ) ∪ ( A ∩B c ) = A ” is valid.
equation “

You might also like