Skip to content
Exercise 1.4 · Q105

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

Maharashtra MsbshseTextbookSubjectiveImportance★★★★★
46% · 105/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 statement is p→(p∨∼q)p\to(p\vee\sim q). By the negation-of-conditional rule, ∼[p→(p∨∼q)]≡p∧∼(p∨∼q)\sim[p\to(p\vee\sim q)]\equiv p\wedge\sim(p\vee\sim q). Applying De Morgan's to the second factor: ∼(p∨∼q)≡∼p∧q\sim(p\vee\sim q)\equiv \sim p\wedge q. So the negation is p∧(∼p∧q)=p∧∼p∧qp\wedge(\sim p\wedge q)=p\wedge\sim p\wedge q. (Note: since p∧∼pp\wedge\sim p is always false, this …

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.