To validate a statement is to show when it is true. An 'and' needs both parts, and an 'or' needs one part once the other is assumed false. An if-then can be shown directly, through the contrapositive or by contradiction, and an if-and-only-if needs both directions. An argument is valid when its conclusion is true in every row where all its premises are true; modus ponens and modus tollens are valid, while affirming the consequent is a fallacy.
about 25 min1 simulation1 practice question
Lesson 1 of 3Show all lessonsHide
Try the code and the simulations beside the lesson.
What you will be able to do
validate a statement built with "and", "or", "if ... then" and "if and only if";
decide whether an argument is valid, with a truth table or a known form;
spot the two common fallacies.
What it takes to show a statement is true
A statement is valid (true) when we can show it with reasons. The connective tells us what to show.
p and q: show that p is true, and show that q is true.
p or q: assume p is false and show q is true. Or assume q is false and show p is true. This works because p∨q≡∼p⇒q.
If p then q: there are three ways. Assume p and show q (the direct method). Assume ∼q and show ∼p (the contrapositive method). Assume p and ∼q together and reach something impossible (the method of contradiction).
p if and only if q: show "if p then q" and "if q then p".
The picture sums up the ways to deal with an if-then statement. The last row is for a claim about every case: one case with p true and q false is enough to make it false.
A flow chart of four methods of proof for a statement 'if p then q'. Direct: start from p, a chain of steps, end at q. Contrapositive: start from not q, a chain of steps, end at not p. Contradiction: start from p and not q together, a chain of steps, end at an impossible statement, then conclude that the statement is true. Counterexample: one case with p true and q false shows that a for-all claim is false.
Example. Validate "if x and y are odd integers, then xy is odd". Directly: write x=2m+1 and y=2n+1. Then
xy=4mn+2m+2n+1,
xy=2(2mn+m+n)+1,
which is odd. So the statement is true.
Arguments
An argument is a list of statements, the premises, followed by a conclusion.
Premise 1: if it rains, the match is cancelled.
Premise 2: it rains.
Conclusion: the match is cancelled.
An argument is valid when the conclusion is true in every case in which all the premises are true. In symbols, the argument with premises P1,…,Pk and conclusion C is valid when
(P1∧⋯∧Pk)⇒C
is a tautology.
Valid does not mean true. "All fish can fly. A shark is a fish. So a shark can fly" is valid, but the first premise is false. A valid argument only promises a true conclusion when the premises are true.
Four valid forms
Modus ponens:p⇒q and p; so q.
Modus tollens:p⇒q and ∼q; so ∼p.
Chain rule (hypothetical syllogism): p⇒q and q⇒r; so p⇒r.
Disjunctive syllogism:p∨q and ∼p; so q.
Two fallacies
A fallacy is an argument that looks valid but is not.
Affirming the consequent:p⇒q and q; so p. If it rains, the ground is wet. The ground is wet. So it rained? No. A water tank may have leaked.
Denying the antecedent:p⇒q and ∼p; so ∼q. It did not rain. So the ground is dry? No, for the same reason.
To show an argument is a fallacy, give one row in which every premise is true and the conclusion is false. For affirming the consequent, that row is p false and q true.
Checking an argument with a truth table
Is this argument valid? Premises: p∨q, ∼p. Conclusion: q.
Go through the four rows of p, q and keep only the rows where both premises are true.
T, T: ∼p is F. Skip.
T, F: ∼p is F. Skip.
F, T: both premises are T. The conclusion q is T.
F, F: p∨q is F. Skip.
The only row with true premises has a true conclusion, so the argument is valid.
Practise with new numbers
Try it in Python
The program checks an argument by going through every row. It prints any row in which all the premises are true and the conclusion is false. If there is none, the argument is valid.
Common mistakes
Calling an argument invalid because its conclusion is false. Validity is about the form, not about the facts.
Affirming the consequent. From p⇒q and q nothing follows about p.
Validating an "or" by checking only the easy part. You must cover the case where that part fails.
Proving only one direction of an if-and-only-if.
Remember these
And: both parts. Or: assume one false, show the other. If-then: direct, contrapositive or contradiction. Iff: both directions.
An argument is valid when (premises) ⇒ (conclusion) is a tautology.
Modus ponens, modus tollens, the chain rule and disjunctive syllogism are valid.
Check yourself
Try each one on your own first. If you are stuck, open a hint. Then check with Show the answer.
Premises: "If a shape is a square, it has four sides." "This shape has four sides." Conclusion: "This shape is a square." Is the argument valid?
Which valid form gives "Ali did not pass" from "If Ali passed, Ali got a certificate" and "Ali did not get a certificate"?
How do you validate "x≥0 or x2>0" for a real number x?
Is ((p⇒q)∧(q⇒r))⇒(p⇒r) a tautology?
A valid argument has a false conclusion. What must be true of its premises?
References
NCERT, Mathematics Textbook for Class XI (edition before 2023), Chapter 14, section 14.6, Validating statements.
OpenStax, Contemporary Mathematics, Chapter 2, section on logical arguments.
Enroll free in Valid Arguments and Methods of Proof
Every lesson is open to read. Enrolling also lets you:
Mark lessons done and carry on where you stopped.
Take the tests of this lesson and its course.
Count the course towards the certificate for its chapter.