Double negative elimination
||It has been suggested that this article be merged into Double negation. (Discuss) Proposed since March 2012.|
In propositional logic, double negative elimination (also called double negation elimination, double negative introduction, double negation introduction, or simply double negation) are two valid rules of replacement. They are the inferences that if A is true, then not not-A is true and its converse, that, if not not-A is true, then A is true. The rule allows one to introduce or eliminate a negation from a logical proof. The rule is based on the equivalence of, for example, It is false that it is not raining. and It is raining.
The double negation introduction rule is:
- P ¬¬P
and the double negation elimination rule is:
- ¬¬P P
The double negation introduction rule may be written in sequent notation:
The double negation elimination rule may be written as:
In rule form:
or as a tautology (plain propositional calculus sentence):
These can be combined together into a single biconditional formula:
Double negative elimination is a theorem of classical logic, but not of weaker logics such as intuitionistic logic and minimal logic. Because of their constructive character, a statement such as It's not the case that it's not raining is weaker than It's raining. The latter requires a proof of rain, whereas the former merely requires a proof that rain would not be contradictory. (This distinction also arises in natural language in the form of litotes.) Double negation introduction is a theorem of both intuitionistic logic and minimal logic, as is .
- Copi and Cohen
- Moore and Parker