Computer Science, asked by kammaroo11, 17 days ago

Prove that (¬p ∧ q) ∨ ¬ (p ∨ q) ≡ ¬ p

Answers

Answered by Omprakash223
1

Answer:L.H.S. =p↔q

=(p→q)∧(q→p)

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

= R.H.S.

Hence proved.

i am not sure buddy

Similar questions