Skip to content
Worked Examples · Example 5

Q.Using truth tables, prove the logical equivalence p→q≡∼p∨qp \rightarrow q \equiv \sim p \vee q.

Maharashtra MsbshseTextbookSubjectiveImportance★★★★★
28% · 11/40 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 →

Construct a single truth table carrying both patterns.

ppqqp→qp \rightarrow q∼p\sim p∼p∨q\sim p \vee q
TTTFT
TFFFF
FTTTT
FFTTT

Compare the two relevant columns. The column for p→qp \rightarrow q is T,F,T,TT, F, T, T. The column for ∼p∨q\sim p \vee q is: row 1 F∨T=TF \vee T = T; row 2 F∨F=FF \vee F = F; row 3 T∨T=TT \vee T = T; row 4 T∨F=TT \vee F = T, i.e. T,F,T,TT, F, T, T.

The two columns are identical in every row, so by definition the patterns are logically equivalent: p→q≡∼p∨q.p \rightarrow q \equiv \sim p \vee q. …

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.