Scribd
Upload
8 views

Distrect assignnment 41

D's

Uploaded by

Pashal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

Distrect assignnment 41

D's

Uploaded by

Pashal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

19.

below, a logical equivalence is derived from Theorem TABLE 6 Logical Equivalences,


Supply a reason for each step.

a) (p ∧ ∼q) ∨ (p ∧ q) ≡ p ∧ (∼q ∨ q) by (a)

≡ p ∧ (q ∨ ∼q) by (b)

≡ p ∧ t by (c)

≡ p by (d)

Therefore, (p ∧ ∼q) ∨ (p ∧ q) ≡ p.

b) (p ∨ ∼q) ∧ (∼p ∨ ∼q) ≡ ∼q

≡ (∼q ∨ p) ∧ (∼q ∨ ∼p) by (a)

≡ ∼q ∨ (p ∧ ∼p) by (b)

≡ ∼q ∨ c by (c)

≡ ∼q by (d)

Therefore, (p ∨ ∼q) ∧ (∼p ∨ ∼q) ≡ ∼q.

PART (A):

(p ∧ ∼q) ∨ (p ∧ q) ≡ p ∧ (∼q ∨ q)

Step (a):

(p ∧ ∼q) ∨ (p ∧ q) ≡ p ∧ (∼q ∨ q)

Reason: Factorization. We can factor out the common term (p) from both parts of the disjunction.

(p ∧ ∼q) ∨ (p ∧ q) = p ∧ (∼q ∨ q)

This use the distributive law of conjunction over disjunction:


1
Step (b)

p ∧ (∼q ∨ q) ≡ p ∧ (q ∨ ∼q)

Reason: Commutative law. Because the order of terms in a disjunction does not affect its truth
value, so we can change (∼q) and (q) in the disjunction.

Step (c)

( p ∧ (q ∨ ∼q) ≡ p ∧ t )

Reason: Tautology law . Because the expression (q ∨ ∼q) is always true so we can replace (q ∨
∼q) with t (which stands for "true").

Step (d)

(p∧t≡p)

Reason: Identity law. Because Conjunction with true leaves the original term unchanged (p ∧ t ≡
p).

Therefore, (p ∧ ∼q) ∨ (p ∧ q) ≡ p

PART (B):

(p ∨ ∼q) ∧ (∼p ∨ ∼q) ≡ ∼q

Step (a)

(p ∨ ∼q) ∧ (∼p ∨ ∼q) ≡ (∼q ∨ p) ∧ (∼q ∨ ∼p)

Reason: Commutative law because the order of terms in a disjunction doesn't matter, so we can
change the terms in the first disjunction to get (∼q ∨ p) and change the terms in the second
disjunction to get (∼q ∨ ∼p).

2
Step (b)

(∼q ∨ p) ∧ (∼q ∨ ∼p) ≡ ∼q ∨ (p ∧ ∼p)

Reason: Distribution law of disjunction over conjunction. because We can factor out the
common term (-q) from both parts of the disjunction.

Step (c)

∼q ∨ (p ∧ ∼p) ≡ ∼q ∨ c

Reason: Contradiction law because the expression (p ∧ ∼p) is always false so (p ∧ ∼p ≡ c)


which c is stand for false

Step (d)

( ∼q ∨ c) ≡ ∼q

Reason: Identity law. because the disjunction of any statement with false leaves the original
statement unchanged ( ∼q ∨ c ≡ ∼q ).

Therefore, (p ∨ ∼q) ∧ (∼p ∨ ∼q) ≡ ∼q

3
REFERENCES
Logical Equivalence. (2024, December). Retrieved from http/://www.GeeksforGeeks

Epp, S. S. (2011). Discrete and Combinatorial Mathematics.

Gill, K. (2009). Introduction to Distrecte.

You might also like