Math 2.0

statement theorem

Law of excluded middle

Statement

In classical logic, for each proposition pp, the proposition p∨¬pp \lor \neg p is true.

Remarks

The formula p∨¬pp \lor \neg p is a tautology. Some systems take the law as an axiom. Intuitionistic logic does not accept the law in general. The law is the basis of proof by cases on pp and ¬p\neg p.

Explanations

L1 human

The law says that there is no third option: a statement is true, or its negation is true. For example, each natural number nn is even or not even.

What this node needs for W2
  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (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 4 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. Disjunction definition
  3. Negation definition
  4. Law of excluded middle statement

Sources

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