# Boolean Algebra

> CIE A-Level Computer Science · 9618
> Source: https://www.owlsprep.com/study/cie-9618-u3-boolean-algebra/

Boolean algebra is a formal system for describing binary logic operations, used to simplify digital logic circuits and verify logical relationships. This guide covers core laws, simplification techniques, and common exam questions for CIE 9618.

**Prerequisites:** [Basic logic gates and truth tables](https://www.owlsprep.com/study/cie-9618-u3-logic-gates/)

## Learning objectives

- Recall and apply core laws of Boolean algebra
- Use De Morgan's theorems to invert and simplify Boolean expressions
- Simplify complex Boolean expressions step-by-step
- Convert between sum of products and product of sums forms
- Relate Boolean algebra to digital logic circuit design

## Core Definitions and Laws of Boolean Algebra

**Boolean Algebra** — A mathematical system for binary logical operations, used to design and simplify digital logic circuits

*Notation:* Variables: $A, B, X \in \{0,1\}$; Operations: $\cdot$ (AND), $+$ (OR), $'$ (NOT)

*Example:* $A + 0 = A$ (identity law for OR)

- Identity laws: $A + 0 = A$, $A \cdot 1 = A$
- Annulment laws: $A + 1 = 1$, $A \cdot 0 = 0$
- Idempotent laws: $A + A = A$, $A \cdot A = A$
- Complement laws: $A + A' = 1$, $A \cdot A' = 0$, $(A')' = A$
- Commutative laws: $A + B = B + A$, $A \cdot B = B \cdot A$
- Associative laws: $(A + B) + C = A + (B + C)$, $(A \cdot B) \cdot C = A \cdot (B \cdot C)$
- Distributive laws: $A \cdot (B + C) = A \cdot B + A \cdot C$, $A + (B \cdot C) = (A + B) \cdot (A + C)$

**Worked example:** Simplify the expression $X = (A + B) \cdot (A + C)$

1. Start with the original expression:
2. $$(A + B) \cdot (A + C)$$
3. Match to the second distributive rule $A + (B \cdot C) = (A + B)(A + C)$, reverse to simplify:
4. Final simplified expression:
5. $$X = A + (B \cdot C) = A + BC$$

> **Exam tip:** No formula booklet is provided for these laws, so you must memorize all core rules for the exam.

*Calculator:* forbidden

## De Morgan's Theorems

**De Morgan's Theorems** — Two fundamental rules that allow you to invert any Boolean expression by swapping AND/OR operations and inverting every literal

*Notation:* 1. $(A + B)' = A' \cdot B'$; 2. $(A \cdot B)' = A' + B'$

*Example:* $(XY)' = X' + Y'$

> **Extended Rule**
>
> De Morgan's extends to any number of variables: $(A + B + C)' = A'B'C'$ and $(ABC)' = A' + B' + C'$

**Worked example:** Simplify $X = (A' + B')'$ using De Morgan's theorem

1. Apply De Morgan's to the inverted sum:
2. Swap OR to AND, invert each literal:
3. $$(A')' \cdot (B')'$$
4. Cancel double negation: $(A')' = A$, $(B')' = B$:
5. Final result:
6. $$X = A \cdot B$$

*Calculator:* forbidden

## Simplifying Complex Boolean Expressions

Most exam questions require you to simplify a multi-term expression using a combination of core laws and De Morgan's theorems. You must show all working to earn full marks, even if your final answer is correct.

**Worked example:** Simplify the expression $X = AB + A'C + BC$

1. Rewrite the term $BC$ by multiplying by $1 = A + A'$ (complement law):
2. $$BC = BC(A + A') = ABC + A'BC$$
3. Substitute back into the original expression:
4. $$X = AB + A'C + ABC + A'BC$$
5. Group common terms and apply annulment law $1 + C = 1$:
6. $$X = AB(1 + C) + A'C(1 + B) = AB(1) + A'C(1)$$
7. Apply identity law $X \cdot 1 = X$ to get the final simplified expression:
8. $$X = AB + A'C$$

**Check your understanding**

Test your understanding:

1. What is the simplified form of $(A \cdot B')'$?

   - $A + B$
   - $A' + B$
   - $A \cdot B'$
   - $A' + B'$

   *Why:* Correct. Apply De Morgan's: $(A \cdot B')' = A' + (B')' = A' + B$

*Calculator:* forbidden

## Sum of Products and Product of Sums

**Sum of Products (SOP) / Product of Sums (POS)** — Two standard forms for Boolean expressions. SOP is OR of AND terms; POS is AND of OR terms. SOP is most commonly used for implementing logic circuits with standard gates.

*Example:* SOP: $AB + A'C$; POS: $(A + B)(A' + C)$

CIE often asks to convert between POS and SOP forms, which you can do using the distributive law and simplification rules.

**Worked example:** Convert the POS expression $(A + B') \cdot (A' + C)$ to SOP form

1. Expand the product using the distributive law:
2. $$A \cdot A' + A \cdot C + B' \cdot A' + B' \cdot C$$
3. Simplify $A \cdot A' = 0$ (complement law):
4. $$0 + AC + A'B' + B'C$$
5. Apply identity law $0 + X = X$ to get the final SOP:
6. $$AC + A'B' + B'C$$

*Calculator:* forbidden

## Common pitfalls

- **Wrong:** Forgetting to invert all variables when applying De Morgan's, writing $(A + B)' = A' + B'$
  - Why it fails: De Morgan's requires swapping the operation AND inverting every literal in the expression
  - Correct: The correct form is $(A + B)' = A' \cdot B'$: swap OR to AND, invert both literals
- **Wrong:** Misapplying the distributive law, writing $A + (B \cdot C) = (A + B) \cdot C$
  - Why it fails: Boolean algebra follows different rules to ordinary algebra, and factoring does not work the same way
  - Correct: The correct rule is $A + (B \cdot C) = (A + B) \cdot (A + C)$
- **Wrong:** Not showing each step of simplification in the exam
  - Why it fails: CIE awards method marks for each correct application of a law, even if the final answer is wrong
  - Correct: Write every simplification step explicitly, and name the law you use if the question asks for it
- **Wrong:** Mixing up annulment laws, writing $A + 1 = A$
  - Why it fails: Confusing identity laws (where 0 or 1 leave the variable unchanged) with annulment laws
  - Correct: Remember: OR with 1 (true) is always 1, AND with 0 (false) is always 0: $A + 1 = 1$, $A \cdot 0 = 0$
- **Wrong:** Forgetting double negation cancels out, writing $(A')' = A'$
  - Why it fails: Overlooking the complement law for double inversion when simplifying
  - Correct: Inverting a variable twice returns the original value: $(A')' = A$

## Cheatsheet

| Law Name | Rule 1 | Rule 2 |
| --- | --- | --- |
| Identity | $A + 0 = A$ | $A \cdot 1 = A$ |
| Annulment | $A + 1 = 1$ | $A \cdot 0 = 0$ |
| Idempotent | $A + A = A$ | $A \cdot A = A$ |
| Complement | $A + A' = 1$ | $A \cdot A' = 0$ |
| Double Negation | $(A')' = A$ |  |
| Commutative | $A + B = B + A$ | $A \cdot B = B \cdot A$ |
| Associative | $(A+B)+C = A+(B+C)$ | $(AB)C = A(BC)$ |
| Distributive | $A(B + C) = AB + AC$ | $A + BC = (A+B)(A+C)$ |
| De Morgan's | $(A + B)' = A'B'$ | $(AB)' = A' + B'$ |

## What's next

Boolean algebra is the foundational mathematical system for all digital logic design, and the simplification skills you learned here will be applied to all subsequent hardware topics in CIE 9618. You will use these skills to design combinational logic circuits from problem statements, and later to analyze sequential logic circuits that include memory elements. An alternative method for simplifying larger Boolean expressions, Karnaugh maps (K-maps), is also examined by CIE, and builds directly on the concepts covered here. Mastering this sub-topic will make all advanced logic design topics much easier to understand.

- [Karnaugh Maps for Boolean Simplification](https://www.owlsprep.com/study/cie-9618-u3-karnaugh-maps/)
- [Computer Architecture](https://www.owlsprep.com/study/cie-9618-u3-computer-architecture/)
- [Input and Output Devices](https://www.owlsprep.com/study/cie-9618-u3-input-and-output-devices/)

---

From [OwlsPrep](https://www.owlsprep.com) — free study guides for A-Level, IB, AP and IGCSE, written against the official syllabus. Canonical page: https://www.owlsprep.com/study/cie-9618-u3-boolean-algebra/