The negation of ( p ∧ ( - q ) ) ∨ ( - p ) is equivalent to

Step-by-step solution

The given statement is p ∧ ~ q ∨ ~ p Let us take A ∩ B c ∪ A c . Now let us apply distributive law to the above statement. ≡ A ∪ A c ∩ B c ∪ A c ≡ U ∩ B c ∪ A c ≡ B c ∪ A c Now the given statement p ∧ ~ q ∨ ~ p will be equivalent to ~ q ∨ ~ p or ~ p ∨ ~ q . Hence the given statement is equivalent to ~ p ∨ ~ q , Now negation of given statement by demorgan's law will be, ~ ~ p ∨ ~ q ≡ p ∧