DEMORGAN'S THEOREM

Domain	Definition
Computing	DeMorgan's theorem A logical theorem which states that the complement of a conjunction is the disjunction of the complements or vice versa. In symbols: not (x and y) = (not x) or (not y) not (x or y) = (not x) and (not y) E.g. if it is not the case that I am tall and thin then I am either short or fat (or both). The theorem can be extended to combinations of more than two terms in the obvious way. The same laws also apply to sets, replacing logical complement with set complement, conjunction ("and") with set intersection, and disjunction ("or") with set union. A (C) programmer might use this to re-write if (!foo && !bar) ... as if (!(foo \|\| bar)) ... thus saving one operator application (though an optimising compiler should do the same, leaving the programmer free to use whichever form seemed clearest). (1995-12-14). Source: The Free On-line Dictionary of Computing.
Source: compiled by the editor from various references; see credits.

Anagrams: DEMORGAN'S THEOREM

Scrabble® Enable2K-Verified Anagrams
	Words within the letters "'-a-d-e-e-e-g-h-m-m-n-o-o-r-r-s-t"
	-5 letters: grandmothers.
Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro.

Alternative Orthography: DEMORGAN'S THEOREM

Hexadecimal (or equivalents, 770AD-1900s) (references)

Leonardo da Vinci (1452-1519; backwards) (references)

Binary Code (1918-1938, probably earlier) (references)

HTML Code (1990) (references)

ISO 10646 (1991-1993) (references)

Encryption (beginner's substitution cypher): (references)

Specialty Definition: DEMORGAN'S THEOREM