Logic, Reading & Technical Knowledge
CourseLesson 1 of 1
Formal Logic & Technical Fundamentals
100%
Hold ⌘ / Ctrl and scroll to zoom
SubjectLessonDone
Drag to pan · ⌘/Ctrl + scroll or pinch to zoom · tap a node for detail · +/− to expand a branch
Key formulas
De Morgan's Laws
¬(A ∧ B)≡¬A ∨ ¬B¬(A ∨ B)≡¬A ∧ ¬B
Negation of conjunction becomes disjunction of negations.
Part 1 of 1
1. Boolean Logic & De Morgan's Rules
In computer engineering logic:
- AND (∧): true only if both inputs are true.
- OR (∨): true if at least one input is true.
- NOT (¬): flips true to false and vice versa.
De Morgan's Rule 1: NOT(A AND B) = (NOT A) OR (NOT B). De Morgan's Rule 2: NOT(A OR B) = (NOT A) AND (NOT B).
Worked example
Simplify NOT(A AND B) OR (NOT A). By De Morgan: (NOT A OR NOT B) OR (NOT A) = NOT A OR NOT B.
1.NOT(A AND B) is equivalent to NOT A AND NOT B.
Exam strategy
If you can explain why the wrong answers are wrong, you know the topic. Remembering the right one only gets you halfway.
Unlock AI tutoring for this exam →