Math 2.0

statement theorem

Double negation law

Statement

In classical logic, for each proposition pp, the proposition ¬¬p\neg \neg p is logically equivalent to pp. ¬¬p≡p\neg \neg p \equiv p

Remarks

The implication p→¬¬pp \to \neg \neg p is also valid in intuitionistic logic. The other direction, ¬¬p→p\neg \neg p \to p, needs classical logic. This direction is the basis of proof by contradiction.

Explanations

L1 human

"It is not true that 55 is not prime" says the same as "55 is prime". Two negations cancel each other.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 11 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Proposition concept
  2. Conjunction definition
  3. Disjunction definition
  4. Implication definition
  5. Negation definition
  6. Biconditional definition
  7. Truth table concept
  8. Propositional logic concept
  9. Tautology definition
  10. Logical equivalence definition
  11. Double negation law statement

What depends on this

2 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Double_negation, lead section