Discrete mathematicsLesson 5 of 5 in the course Mathematical logic and proof

Reductio ad Absurdum: Proofs, Logic, and Historical Uses

5 flashcards · 5 quiz questions · 5 match pairs · 4 fill-in sentences · English

Lesson progress
0 / 5

Your progress is kept in this browser only.Sign up to save it

Summary

This lesson introduces reductio ad absurdum, a way of establishing a claim by showing that its opposite leads to an unacceptable result.

Reductio ad absurdum is Latin for “reduction to absurdity.” It is also called an argumentum ad absurdum, an apagogical argument, or, in mathematics, a proof by contradiction. The strategy is to test a contrary proposition: if assuming it leads to absurdity or contradiction, the original claim is supported.

All flashcards

Reductio ad absurdum
A strategy for supporting a claim by showing that its contrary leads to an unacceptable consequence or contradiction.
Principle of non-contradiction
A proposition and its negation cannot both be true.
Empirical absurdity versus formal contradiction
An empirical absurdity conflicts with observation; a formal contradiction derives incompatible claims from assumptions.
Double-negation stability
A proposition is stable when its double negation implies the proposition: ¬¬P⇒P\neg\neg P \Rightarrow P.
Existence proof by contradiction
Assume no object has the required property, then derive a contradiction to establish that such an object exists.

Quiz questions

  1. To establish ¬P\neg P by refutation, which proof pattern is appropriate?Answer: Assume PP, derive falsehood, and conclude ¬P\neg P.
  2. Which rule expresses classical double-negation elimination?Answer: ¬¬P⇒P\neg\neg P \Rightarrow P
  3. Which statement describes intuitionistic logic's treatment of reductio?Answer: It permits proving ¬P\neg P by deriving falsehood from PP, but not unrestricted double-negation elimination.
  4. In the standard proof that 2\sqrt{2} is irrational, what contradicts the assumption that a/ba/b is in lowest terms?Answer: Both aa and bb must be even.
  5. How does resolution-based automated theorem proving test whether a conclusion follows from hypotheses?Answer: It adds the negated conclusion to the hypotheses and searches for a contradiction.

Based on the Wikipedia article Reductio ad absurdum, licensed CC BY-SA 4.0. Adapted into a summary, flashcards and quizzes.

All Discrete mathematics lessons