De Morgan's laws
pair of transformation rules that are both valid rules of inference
In boolean algebra, DeMorgan's laws are the laws of how a NOT gate affects AND and OR statements:[1]
They can be remembered by "break the line, change the sign".
Truth tables
The following truth tables prove DeMorgan's laws.
INPUT | OUTPUT 1 | OUTPUT 2 | |
A | B | NOT (A AND B) | (NOT A) OR (NOT B) |
0 | 0 | 1 | 1 |
0 | 1 | 1 | 1 |
1 | 0 | 1 | 1 |
1 | 1 | 0 | 0 |
INPUT | OUTPUT 1 | OUTPUT 2 | |
A | B | NOT (A OR B) | (NOT A) AND (NOT B) |
0 | 0 | 1 | 1 |
0 | 1 | 0 | 0 |
1 | 0 | 0 | 0 |
1 | 1 | 0 | 0 |
References
🔥 Top keywords: Main PageSpecial:Search0Slash (punctuation)BlackSpecial:RecentChanges4 (number)DavidSOLID (object-oriented design)Wikipedia:AboutFile:Sexual intercourse with internal ejaculation.webmHelp:ContentsHelp:IntroductionLisa Sparxxx2023 UEFA Champions League FinalColour24-hour clockAdolf Hitler UunonaBismillahir Rahmanir Raheem6 (number)T. N. SeshanFile:ASCII-Table-wide.svg20 (number)Poor Things (movie)United StatesCristiano RonaldoList of people who have walked on the MoonAli Malikov50 (number)17 (number)The Valley (2024 TV series)GrassList of mathematical symbolsList of U.S. states and territories by time zone8 (number)List of countries by areaWikipedia:Simple talkList of largest Hindu templesRama