Math 2.0

Mathematical logic and foundations Constructive mathematics Theorem

Law of excluded middle

Builds on DisjunctionNegation

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.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Proposition concept
  2. Disjunction definition
  3. Negation definition
  4. Law of excluded middle statement

Where this leads

15 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Law_of_excluded_middle, lead section
About this page
Tag0RYYK8PG4S
URIm2://0RYYK8PG4S
Aliasesexcluded-middle, tertium-non-datur
Kindstatement, theorem
WritingW1 stated
MSC03B05
StatusThis copy of the site has no build data. Run m2 status 0RYYK8PG4S.
UsesDisjunction, Negation
Same as

Markdown · JSON · Edit on GitHub

What this page 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 page is. They do not measure its truth.

What links here

Used by

Results about this