Boolean Algebra
Boolean Algebra
1 Operations
1.1 Basic operations
Boolean algebra only has three basic operators: conjunction, disjunction, and
negation, expressed by the corresponding binary operators AND (denoted by the
symbol ∧ or ·), OR (denoted by the symbol ∨ or +), and NOT (denoted by the
symbol ¬ or ′ ). Every operand in boolean algebra always denotes a state of TRUE
(i.e. 1) or FALSE (i.e. 0). The basic operations on Boolean variables x and y are
defined as follows:
x y x∧y x∨y
0 0 0 0 x ¬x
1 0 0 1 0 1
0 1 0 1 1 0
1 1 1 1
Since boolean variables only represent the values 0 and 1, they can be expressed
using ordinary arithmetic operations:
x ∧ y = xy = min(x, y)
x ∨ y = x + y − xy = max(x, y)
¬x = 1 − x
1
1.2 Secondary operations
Conditional: x → y = ¬x ∨ y (or x′ + y)
Biconditional: x ↔ y = (x ∧ y) ∨ (¬x ∧ ¬y) (or xy + x′ y ′ )
Exclusive OR (XOR): x⊕y = ¬(x ↔ y) = (x∧¬y)∨(¬x∧y) (or xy ′ +x′ y)
Note: The XOR operator yields TRUE only when both operands are either
TRUE or FALSE. The XOR operator is also used to add two bianry bits.
2 Laws
2.1 Associative law
x ∨ (y ∨ z) = (x ∨ y) ∨ z x + (y + z) = (x + y) + z
x ∧ (y ∧ z) = (x ∧ y) ∧ z x · (y · z) = (x · y) · z
x ∧ (y ∨ z) = (x ∧ y) ∨ (x ∧ z) x · (y + z) = x · y + x · z
x ∨ (y ∧ z) = (x ∨ y) ∧ (x ∨ z) x + (y · z) = (x + y) · (x + z)
x∨0=x x+0=x
x∧1=x x·1=x
x∧0=0 x·0=0
x∨1=1 x+1=1
2
2.6 Idempotent law
x∨x=x x+x=x
x∧x=x x·x=x
x ∧ (x ∨ y) = x x · (x + y) = x
x ∨ (x ∧ y) = x x + (x · y) = x
x ∧ ¬x = 0 x · x′ = 0
x ∨ ¬x = 1 x + x′ = 1
¬(x ∨ y) = ¬x ∧ ¬y (x + y)′ = x′ · y ′
¬(x ∧ y) = ¬x ∨ ¬y (x · y)′ = x′ + y ′
f (x, y) = x · y ′ + x′ · y + x · y · 0
f D (x, y) = (x + y ′ ) · (x′ + y) · (x + y + 1)
Note: The variable themselves don’t change, for example x doesn’t change to x′ ,
but only the constants and the operators change.