In classical logic, intuitionistic logic, and similar logical systems, the principle of explosion[a][b] is the law according to which any statement can be proven from a contradiction.[1][2][3] That is, from a contradiction, any proposition (including its negation) can be inferred; this is known as deductive explosion.[4][5]
The proof of this principle was first given by 12th-century French philosopher William of Soissons.[6] Due to the principle of explosion, the existence of a contradiction (inconsistency) in a formal axiomatic system is disastrous; since any statement can be proven, it trivializes the concepts of truth and falsity.[7] Around the turn of the 20th century, the discovery of contradictions such as Russell's paradox at the foundations of mathematics thus threatened the entire structure of mathematics. Mathematicians such as Gottlob Frege, Ernst Zermelo, Abraham Fraenkel, and Thoralf Skolem put much effort into revising set theory to eliminate these contradictions, resulting in the modern Zermelo–Fraenkel set theory.
As a demonstration of the principle, consider two contradictory statements—"All lemons are yellow" and "Not all lemons are yellow"—and suppose that both are true. If that is the case, anything can be proven, e.g., the assertion that "unicorns exist", by using the following argument:
In a different solution to the problems posed by the principle of explosion, some mathematicians have devised alternative theories of logic called paraconsistent logics, which allow some contradictory statements to be proven without affecting the truth value of (all) other statements.[7]
In symbolic logic, the principle of explosion can be expressed schematically in the following way:[8][9]
Below is the Lewis argument,[10] a formal proof of the principle of explosion using symbolic logic.
Step | Proposition | Derivation |
---|---|---|
1 | Premise[c] | |
2 | Conjunction elimination (1) | |
3 | Conjunction elimination (1) | |
4 | Disjunction introduction (2) | |
5 | Disjunctive syllogism (4,3) |
This proof was published by C. I. Lewis and is named after him, though versions of it were known to medieval logicians. [11] [12] [10]
This is just the symbolic version of the informal argument given in the introduction, with standing for "all lemons are yellow" and standing for "Unicorns exist". We start out by assuming that (1) all lemons are yellow and that (2) not all lemons are yellow. From the proposition that all lemons are yellow, we infer that (3) either all lemons are yellow or unicorns exist. But then from this and the fact that not all lemons are yellow, we infer that (4) unicorns exist by disjunctive syllogism.
An alternate argument for the principle stems from model theory. A sentence is a semantic consequence of a set of sentences only if every model of is a model of . However, there is no model of the contradictory set . A fortiori, there is no model of that is not a model of . Thus, vacuously, every model of is a model of . Thus is a semantic consequence of .
Paraconsistent logics have been developed that allow for subcontrary-forming operators. Model-theoretic paraconsistent logicians often deny the assumption that there can be no model of and devise semantical systems in which there are such models. Alternatively, they reject the idea that propositions can be classified as true or false. Proof-theoretic paraconsistent logics usually deny the validity of one of the steps necessary for deriving an explosion, typically including disjunctive syllogism, disjunction introduction, and reductio ad absurdum.
The metamathematical value of the principle of explosion is that for any logical system where this principle holds, any derived theory which proves ⊥ (or an equivalent form, ) is worthless because all its statements would become theorems, making it impossible to distinguish truth from falsehood. That is to say, the principle of explosion is an argument for the law of non-contradiction in classical logic, because without it all truth statements become meaningless.
Reduction in proof strength of logics without ex falso are discussed in minimal logic.