Simplify: (p ∨ q) ∧ (p ∧ (p ∧ q)) <=> (p ∧ q)
Showing the steps and the laws of logic used to simplify. And state why the statement as a whole is true.
2006-10-22
03:52:49
·
13 answers
·
asked by
Anonymous
in
Science & Mathematics
➔ Mathematics
Yes I can do it!!! I wanted to see if I was right!!
Simplify:(p ∨ q) ∧ (p ∧ (p ∧ q)) (p ∧ q)
(p ∧ (p ∧ q)) can become: ((p ∧ p) ∧ q) this is the associate law as brackets can be moved.
This new expression is simplified through the idempotent law making ((p ∧ p) ∧ q) become ((p) ∧ q) the inner brackets are then removed.
Next:(p ∨ q) ∧ (p ∧ q) (p ∧ q)
Using the Associate Law this can become:
(p ∨ (q ∧ p ∧ q)) (p ∧ q)
From this new expression (q ∧ p ∧ q) can be simplified to (p ∧ q) [since q ∧ q q]. Therefore:
(p ∨ (p ∧ q)) (p ∧ q)
Using the Absorption Law this is simplified to:
p (p ∧ q)
Which is true as (p ∧ q) can only be true when p is true and is false when p is false therefore p is equivalent to (p ∧ q).
2006-10-22
04:00:50 ·
update #1
The squares above are <=> it was copied from word to here and Yahoo doesn't support the character which represents <=>
2006-10-22
04:01:49 ·
update #2