Skip to content
Exercises · Q11

Q.Construct the truth table for (p∨q)∧∼p(p \vee q) \wedge \sim p and classify it as a tautology, contradiction or contingency.

Maharashtra MsbshseTextbookSubjectiveImportance★★★★★
3% · 1/40 Questions
✓ Free question

There are 44 rows. Build p∨qp \vee q, then ∼p\sim p, then their conjunction.

ppqqp∨qp \vee q∼p\sim p(p∨q)∧∼p(p \vee q) \wedge \sim p
TTTFF
TFTFF
FTTTT
FFFTF

Reading the rows. The conjunction is true only when both p∨qp \vee q and ∼p\sim p are true. That needs ∼p=T\sim p = T (so p=Fp = F) together with p∨q=Tp \vee q = T (so q=Tq = T) — only row 3. The final column is F,F,T,FF, F, T, F.

Since it contains both TT and FF, the pattern is a contingency.

Verification. The lone true row is p=F,q=Tp = F, q = T: there p∨q=Tp \vee q = T and ∼p=T\sim p = T, so the conjunction is TT; every other row has either p∨q=Fp \vee q = F or ∼p=F\sim p = F, forcing FF — consistent with the column above.

✓Final answer

The truth-table column is F,F,T,FF, F, T, F, so (p∨q)∧∼p(p \vee q) \wedge \sim p is a contingency.

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.