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. /Use truth tables to test two arguments in p, q and r…
AdvancedMathematicsHigh School (11–12)Mathematical ReasoningNumericalproof

Use truth tables to test two arguments in p, q and r…

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.

Use truth tables to test two arguments in ppp, qqq and rrr.

  • Argument A: premises p⇒qp \Rightarrow qp⇒q, q⇒rq \Rightarrow rq⇒r and ∼r\sim r∼r; conclusion ∼p\sim p∼p.
  • Argument B: premises p∨qp \vee qp∨q, p⇒rp \Rightarrow rp⇒r and q⇒rq \Rightarrow rq⇒r; conclusion rrr.

For each argument, count the rows of the eight in which all its premises are true, and check the conclusion in those rows. Are both arguments valid? Argument B is the pattern behind every proof by cases. Explain why.

Check your answer

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

Need a reminder? The key ideaShowHide

An argument is valid when its conclusion is true in every row where all premises are true. Valid forms: modus ponens, modus tollens, the chain rule, disjunctive syllogism. Fallacies: affirming the consequent and denying the antecedent.

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.

Step 1. Argument A. ∼r\sim r∼r makes rrr false. Then q⇒rq \Rightarrow rq⇒r is true only if qqq is false. Then p⇒qp \Rightarrow qp⇒q is true only if ppp is false. So exactly 111 row, (F, F, F), has all premises true. There ∼p\sim p∼p is true. Valid.

Step 2. Argument B. If rrr were false, both p⇒rp \Rightarrow rp⇒r and q⇒rq \Rightarrow rq⇒r would force ppp and qqq false, and then p∨qp \vee qp∨q would be false. So every row with all premises true has rrr true. Those rows are rrr T with p∨qp \vee qp∨q T: (T, T, T), (T, F, T) and (F, T, T). That is 333 rows, and the conclusion is true in each. Valid.

Step 3. Proof by cases. To prove rrr, show that one of the cases ppp, qqq always holds (p∨qp \vee qp∨q), and that each case leads to rrr. Argument B says this is enough.

Answer: both are valid; A has 111 row with true premises and B has 333.

Log in to save this for later
← All Problems
← Write each argument in symbols and decide whether it is valid…Validate the statement "for a real number x, x² - 5x + 6 = 0 if and only if x = 2 or x = 3"… →
More onMathematical Reasoning

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Validating statements and argumentsValid Arguments and Methods of Proof

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
  4. 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 →