Skip to content
Exercise 1.4 · Q106

Q.Using the rules of negation, write the negation of the following, with justification: ∼(p∧q)∨(p∨∼q)\sim (p \wedge q) \vee (p \vee \sim q)

Maharashtra MsbshseTextbookSubjectiveImportance★★★★★
47% · 106/227 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

The main connective is ∨\vee. By De Morgan's law, ∼[∼(p∧q)∨(p∨∼q)]≡∼[∼(p∧q)]∧∼(p∨∼q)\sim[\sim(p\wedge q)\vee(p\vee\sim q)]\equiv \sim[\sim(p\wedge q)]\wedge\sim(p\vee\sim q). Double negation gives ∼[∼(p∧q)]=p∧q\sim[\sim(p\wedge q)]=p\wedge q, and applying De Morgan's to the second factor gives $\sim(p\v …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.