Math 2.0

Mathematical logic and foundations Proposition

Law of the weak excluded middle

Statement

A particularly well-studied intermediate logic is given by De Morgan logic, which adds the axiom ¬P∨¬¬P\neg P \lor \neg\neg P to intuitionistic logic, which is sometimes called the law of the weak excluded middle.

This is equivalent to a few other statements:

  • Satisfying all of De Morgan's laws including ¬(P∧Q) ↔ ¬P∨¬Q\neg(P\land Q) \,\leftrightarrow\, \neg P \lor \neg Q
  • (P→Q)∨(¬P→¬Q)(P \to Q) \lor (\neg P \to \neg Q)
  • (P→(Q∨¬R))→((P→Q)∨(P→¬R))(P \to (Q \lor \neg R)) \to ((P \to Q) \lor (P \to \neg R))

Further reading

  1. Wikipedia, page 17637, revision 1370685960, Law of excluded middle, section Analogous laws > Law of the weak excluded middle. adopted
About this page
TagCX032ACTMZ
URIm2://CX032ACTMZ
Aliasesweak-excluded-middle, weak-law-of-the-excluded-middle
Kindstatement, proposition
WritingW0 stub
MSC03B05
StatusThis copy of the site has no build data. Run m2 status CX032ACTMZ.
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • edge uses out: each definition that the statement needs (0 of 1)

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

What links here

No page links to this page yet.