Reductio ad Absurdum

From ProofWiki
Jump to: navigation, search

Proof Rule

The reductio ad absurdum is a valid deduction sequent in propositional logic:


Proof Rule

If, by making an assumption $\neg \phi$, we can infer a contradiction as a consequence, then we may infer $\phi$.
The conclusion does not depend upon the assumption $\neg \phi$.


Sequent Form

The Reductio ad Absurdum can be symbolised by the sequent:

$\left({\neg p \vdash \bot}\right) \vdash p$


Explanation

Reductio ad Absurdum can be expressed in natural language as:

If, by making an assumption that a statement is false , a contradiction can be deduced, that statement must in fact be true.


Variants

The following forms can be used as variants of this theorem:

Variant 1

$\neg p \implies \bot \vdash p$

Variant 2

$\neg p \implies \left({q \land \neg q}\right) \vdash p$


Law of the Excluded Middle

This theorem depends on the Law of the Excluded Middle.

This is one of the axioms of logic that was determined by Aristotle, and forms part of the backbone of classical (Aristotelian) logic.

However, the intuitionist school rejects the Law of the Excluded Middle as a valid logical axiom. This in turn invalidates this theorem from an intuitionistic perspective.


Also see

From the point of view of purely classical logic, this is acceptable. However, in the context of intuitionistic logic, it is essential to bear in mind that only the Proof by Contradiction is valid.

This is because Proof by Contradiction starts with a positive assumption $\phi$.

As a result, it does not depend on the Law of Excluded Middle.


Linguistic Note

Reductio ad Absurdum is Latin for reduction to an absurdity.


Sources