HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /Classify each statement as a tautology, a contradiction or a contingency…
HardMathematicsHigh School (11–12)Mathematical ReasoningNumerical

Classify each statement as a tautology, a contradiction or a contingency…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

Classify each statement as a tautology, a contradiction or a contingency. Use the laws of the algebra of statements, and use a truth table where a law does not help.

  1. (p∧q)∨∼p∨∼q(p \wedge q) \vee \sim p \vee \sim q(p∧q)∨∼p∨∼q
  2. (p∨q)∧∼p∧∼q(p \vee q) \wedge \sim p \wedge \sim q(p∨q)∧∼p∧∼q
  3. p∨(q∧∼q)p \vee (q \wedge \sim q)p∨(q∧∼q)
  4. ∼(p∧∼p)\sim(p \wedge \sim p)∼(p∧∼p)

How many tautologies, contradictions and contingencies are there in the list?

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

A tautology is always true and a contradiction always false. De Morgan: ∼(p∧q)≡∼p∨∼q\sim(p \wedge q) \equiv \sim p \vee \sim q∼(p∧q)≡∼p∨∼q and ∼(p∨q)≡∼p∧∼q\sim(p \vee q) \equiv \sim p \wedge \sim q∼(p∨q)≡∼p∧∼q. Distributive, complement, identity and absorption laws simplify a statement. Series is ∧\wedge∧, parallel is ∨\vee∨.

The worked solution

Check an answer or open a hint to unlock the worked solution.

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Plan. Spot a statement or its negation inside each one.

Step 1. Statement 1. By De Morgan, ∼p∨∼q≡∼(p∧q)\sim p \vee \sim q \equiv \sim(p \wedge q)∼p∨∼q≡∼(p∧q). So it is (p∧q)∨∼(p∧q)(p \wedge q) \vee \sim(p \wedge q)(p∧q)∨∼(p∧q), of the form A∨∼AA \vee \sim AA∨∼A. It is a tautology.

Step 2. Statement 2. ∼p∧∼q≡∼(p∨q)\sim p \wedge \sim q \equiv \sim(p \vee q)∼p∧∼q≡∼(p∨q). So it is (p∨q)∧∼(p∨q)(p \vee q) \wedge \sim(p \vee q)(p∨q)∧∼(p∨q), of the form A∧∼AA \wedge \sim AA∧∼A. It is a contradiction.

Step 3. Statement 3. q∧∼q≡Fq \wedge \sim q \equiv \mathrm{F}q∧∼q≡F, so it is p∨F≡pp \vee \mathrm{F} \equiv pp∨F≡p. True in some rows and false in others: a contingency.

Step 4. Statement 4. p∧∼pp \wedge \sim pp∧∼p is a contradiction, so its negation is a tautology.

Check. Row (T, T) of statement 2: ∼p\sim p∼p is F, so the whole "and" is F. Every row has a false part, as a contradiction must.

Answer: 222 tautologies, 111 contradiction and 111 contingency.

Log in to save this for later
← All Problems
← Simplify the statement S: ∼(∼ p wedge q) wedge (p vee q) step by step, naming the law you use at…An electrician finds a lamp wired through three branches in parallel… →
More onMathematical Reasoning

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Tautologies, equivalence and switching circuitsStatements, Connectives and Truth Tables

More on this topic

  1. Prove by cases that for every integer n, n² leaves remainder 0 or 1 when divided by 3…Advanced
  2. Prove by contradiction that there are no integers a and b with 6a + 9b = 100…Advanced
  3. Prove by contradiction that √3 is irrational…Hard
Prove by exhaustion that no perfect square ends in the digit 2, 3, 7 or 8…Advanced
  • The formula f(n) = n² + n + 41 gives a prime for n = 0, 1, 2, … for a long time…Advanced
  • All problems on this topic →