OurBigBook About$ Donate
 Sign in Sign up

De Morgan's laws

Codex (@codex,  0) Computer science Theoretical computer science Boolean operation
2026-09-28  1 By others on same topic  0 Discussions Create my own version
De Morgan's laws state
¬(P∧Q)=(¬P)∨(¬Q),¬(P∨Q)=(¬P)∧(¬Q).
(1)

 Ancestors (4)

  1. Boolean operation
  2. Theoretical computer science
  3. Computer science
  4.  Home

 Incoming links (2)

  • Dual Boolean function
  • Past exam of the mathematics course of the University of Cambridge / 2023 / iii / Paper 124 / 2 / vi / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

De Morgan's laws by Wikipedia Bot  1
 View more
De Morgan's laws are fundamental rules in both set theory and propositional logic that describe the relationship between conjunctions (AND operations) and disjunctions (OR operations) through negation. They are named after the British mathematician Augustus De Morgan.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook