Harold’s Boolean Algebra

Cheat Sheet
12 September 2021

Boolean Algebra

Boolean Equivalent
Law or Rule Description
Expression Circuit
Annulment
𝐴+1=1 A in parallel with closed = “CLOSED”
(OR)

Annulment
𝐴•0=0 A in series with open = “OPEN”
(AND)

Identity
𝐴+0=𝐴 A in parallel with open = “A”
(OR)

Identity
𝐴•1=𝐴 A in series with closed = “A”
(AND)

Idempotent
𝐴+𝐴=𝐴 A in parallel with A = “A”
(OR)

Idempotent
𝐴𝐴 = 𝐴 A in series with A = “A”
(AND)

̅̅̅̅̅̅̅
( 𝐴̅ ) = 𝐴 Double Negation NOT NOT A (double negative) = “A”

Complement
𝐴+𝐴=1 A in parallel with NOT A = “CLOSED”
(OR)

Complement
𝐴𝐴 = 0 A in series with NOT A = “OPEN”
(AND)

Commutative A in parallel with B = B in parallel

𝐴+𝐵 =𝐵+𝐴
(OR) with A

Commutative
𝐴𝐵 = 𝐵𝐴 A in series with B = B in series with A
(AND)

𝐴(𝐵 + 𝐶) Distributative
= 𝐴𝐵 + 𝐴𝐶 (OR) Permits the multiplying or factoring
𝐴 + 𝐵𝐶 = Distributative out of an expression
(𝐴 + 𝐵)(𝐴 + 𝐶) (AND)

Copyright © 2021 by Harold Toomey, WyzAnt Tutor 1

 𝐴 + (𝐵 + 𝐶)
Associative
= (𝐴 + 𝐵) + 𝐶
(OR) Allows the removal of brackets from
=𝐴+𝐵+𝐶
an expression and regrouping of the
𝐴(𝐵𝐶)
Associative variables
= (𝐴𝐵)𝐶
(AND)
= 𝐴𝐵𝐶
Absorptive
𝐴 + (𝐴𝐵) = 𝐴 Enables a reduction in a complicated
(OR)
expression to a simpler one by
Absorptive absorbing like terms
𝐴(𝐴 + 𝐵) = 𝐴
(AND)
Reduces a complicated expression to
Absorptive
𝐴 + 𝐴𝐵 = 𝐴 + 𝐵 a simpler one by absorbing
(Derived)
compliment term
De Morgan’s Theorem
(𝐴 + 𝐵) = 𝐴 • 𝐵 Invert and replace OR with AND
(NOR)
De Morgan’s Theorem
𝐴𝐵 = 𝐴 + 𝐵 Invert and replace AND with OR
(NAND)

Source: https://www.electronics-tutorials.ws/boolean/bool_6.html

Copyright © 2021 by Harold Toomey, WyzAnt Tutor 2

Boolean Logic Gates

Boolean
Notation Gate Description
Logic
1
On, Tautology, High voltage (typically
IDENTITY T
+5V)
True
0 GND
F Off, Contradiction, Low voltage
NULL
⊥ (typically 0V)
False
Input A, B, C, D Line, Wire, Connects to
Output W, X, Y, Z Line, Wire, Connects from
⋅
A B
AB
A. B AND, BUT, Multiply, Conjunction,
AND
Intersection
A∧B
A∩B
A+B
A∨B
OR Inclusive-OR, Add, Disjunction, Union
A∪B
A|B
A
A^
A′ NOT, Invert, Negation, Change,
NOT
¬A Difference
~A
!A
AB
NAND A⊼B Not AND
A | B*
A+B
NOR A⊽B Not OR
A↓B
A⊕B
Exclusive-OR, Both A and B are
XOR A⊻B
different
AB + AB
A⊙B
Exclusive-NOR, Both A and B are the
XNOR A⊕B
same
AB + AB

Copyright © 2021 by Harold Toomey, WyzAnt Tutor 3

Boolean Logic Truth Tables

Inputs Outputs
AND NAND OR NOR XOR XNOR NOT VCC GND
A B + ⊕ ⊙ 1 0
⋅ 𝐴

0 0 0 1 0 1 0 1 A=1 1 0
0 1 0 1 1 0 1 0 A=1 1 0
1 0 0 1 1 0 1 0 A=0 1 0
1 1 1 0 1 0 0 1 A=0 1 0

Blank Truth Tables

Inputs Output Inputs Output

A B X A B C X Y
0 0 0 0 0
0 1 0 0 1
1 0 0 1 0
1 1 0 1 1
1 0 0
1 0 1
1 1 0
1 1 1

Inputs Output
A B C D X Y Z
0 0 0 0
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 0
0 1 0 1
0 1 1 0
0 1 1 1
1 0 0 0
1 0 0 1
1 0 1 0
1 0 1 1
1 1 0 0
1 1 0 1
1 1 1 0
1 1 1 1

Copyright © 2021 by Harold Toomey, WyzAnt Tutor 4

Karnaugh Mapping (K-Map)
2-Bit A 4-Bit AB
K-Map 0 1 K-Map 00 01 11 10
0 00
B
1 01
CD
11
10
3-Bit AB
K-Map 00 01 11 10
1x4 Group
0 2x2 Group
C
1

K-Map Rules
1) Circle only 1s (ones) and don’t cares for Sum of Products (SOP), 𝑒. 𝑔. 𝐴 𝐵 𝐶 + 𝐴𝐵𝐶 + 𝐴𝐵𝐶.
a. Circle only 0s (zeros) and don’t cares for Product of Sums (POS), 𝑒. 𝑔. (𝐴 + 𝐵)(𝐴 + 𝐵).
b. Don’t cares may be used or ignored.
2) No diagonals, only horizontal or vertical connections.
3) Group only adjacent cells in groups with powers of 2 (1x1, 1x2, 2x1, 2x2, 2x4, 4x2, 1x4, 4x1).
4) Make groups as large as possible.
5) Must group all 1s (ones) for SOP or all 0s (zeros) for POS.
6) Overlapping is allowed.
7) Wrapping around all edges allowed, both top-bottom edges and left-right edges.
8) Fewest groups possible (OPTIMAL).
9) For each circle, determine which inputs do not contribute to the logic (is both 0 and 1).
10) Write down equation as a SOP, 𝑒. 𝑔. 𝐴 𝐵 𝐶 + 𝐴𝐵𝐶 + 𝐴𝐵𝐶

Copyright © 2021 by Harold Toomey, WyzAnt Tutor 5