A proof method that establishes the truth of a proposition P by assuming its negation ¬P and deriving a contradiction; from the contradiction one concludes that P must hold (commonly called reductio ad absurdum or proof by contradiction in classical logic).

Principle

If assuming ¬P together with the accepted premises leads to an explicit contradiction, then P follows; symbolically, (premises ∪ {¬P}) ⊢ ⊥ implies premises ⊢ P, in classical reasoning.

Demonstration

To show that √2 is irrational one assumes the contrary that √2 = p/q in lowest terms and derives an arithmetic contradiction about parity, thereby concluding √2 is irrational by indirect proof.

Misapplication

Using indirect proof in systems that reject the law of excluded middle (for example constructive or intuitionistic settings) to claim existence without providing a witness; or confusing a derived inconsistency with a merely improbable outcome.

Consequence

Enables many classically valid demonstrations where direct construction is difficult or unknown; it often yields decisive results but may be non-constructive about witnesses or algorithms.

Reversal

The reversal is a direct proof strategy: constructively deriving P from premises without passing through an assumption of ¬P and contradiction.

Boundary

Fully valid in classical logic; restricted or interpreted differently in constructive, intuitionistic, or minimal logics where ¬¬P ⇒ P is not generally accepted and existence claims require witnesses.

Semantic Tension

Tension exists between reductio and constructive proofs: reductio accepts non-constructive existence via contradiction, while constructivism demands explicit constructions, making the same result acceptable in one framework but not the other.

Synthesis

Principle of Indirect Proof: a classical method that proves propositions by showing their negations lead to contradiction, powerful for non-constructive conclusions but contingent on the underlying logic's acceptance of classical inference patterns.