Skip to content
Exercise 1.4 · Q108

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

Maharashtra MsbshseTextbookSubjectiveImportance★★★★★
48% · 108/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\vee\sim q)\vee(p\wedge\sim q)]\equiv \sim(\sim p\vee\sim q)\wedge\sim(p\wedge\sim q). Applying De Morgan's to the first factor: ∼(∼p∨∼q)≡p∧q\sim(\sim p\vee\sim q)\equiv p\wedge q. Applying it to the second: $\sim(p\w …

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.