Karteikarten
Boolean Simplification Rules
Karten in diesem Stapel (4)
- 1General IdentitiesX ∧ 0 = 0
X ∧ 1 = X
X ∧ X = X
X ∧ ¬X = 0
X ∨ 0 = X
X ∨ 1 = 1
X ∨ X = X
X ∨ ¬X = 1 - 2de Morgan's Laws¬(A ∨ B) = ¬A ∧ ¬B
¬(A ∧ B) = ¬A ∨ ¬B - 3Distributive RulesA.(B + C) ≡ (A.B) + (A.C)
A + (B.C) ≡ (A + B).(A + C) - 4—
Informationen
- Beschreibung
- A level Computing Karteikarten am Boolean Simplification Rules, erstellt von Oliver H am 08/01/2019.
- Erstellt von
- Oliver H
- Aufrufe
- 0
- Bewertung