Assignment No# 01

Submitted by: Tamoor Hussain

Roll Number: 18661556-074

Submitted to: Ms Sana Afzal

Course: DS

Class: BS IT-18

Department: Information Technology

Section B
Question 11. A: (p ˄ q) →p
Sol:

¬ (p ˄ q) ˅p (Using logical equivalence 2)

(¬p˅¬q) ˅p (Using De Morgan’s law)

(¬q˅¬p) ˅p (Using Commutative Law)

¬q ˅ (¬p ˅ p) (Using Associative Law)

¬q ˅ T (Using Negation Law)

ΞT (Using Domination Law)

Hence proved
Question 11.F: ¬ (p → q) →¬q
Sol:
¬ (¬ p ˅q) →¬q (Using logical equivalence 2)

(¬ (¬p)˄ ¬q) →¬q (Using De Morgan’s law)

(p ˄¬q) →¬q (Using Double Negation)

¬ (p ˄¬q)˅¬q (Again Using logical equivalence 2)

(¬p v¬ (¬q)) ¬q (Again Using De Morgan’s law)

¬p v (q˅¬q) (Using Associative Law)

¬p v T (Using Negation Law)

≡T (Using Domination Law)
Hence proved