This post explains why each Boolean law in Unit 4 is true, and how students see which law an expression needs next. A list of nine law names does not tell students where to start on a long Paper II expression. A law that students can rebuild in a few seconds does.
The post has four parts:
- What the laws stand on: two values, three operations and three ways to prove a law (sections 1 and 2).
- The laws in groups: the one-variable laws, the mirror pairs, the laws that move terms, the laws that remove terms and De Morgan's laws (sections 3 to 7).
- How to use the laws: which law to use next, and how to prove an identity in Paper II (sections 8 and 9).
- How the exam tests it: past paper questions on Boolean laws (section 10).
How to read the expressions. The papers print NOT A as A with a bar over it. This post writes it as A', as both Teachers' Guides also do in their worked examples (Teachers' Guide 4.2, page 102) (ගුරු අත්පොත 4.2, පිටුව 113). AB means A AND B. A + B means A OR B.
1. Two values and three operations
Boolean algebra has only two values, 0 and 1. The syllabus calls this "Two state logic and Boolean Algebra" (Syllabus 4.2, page 12), and the Sinhala syllabus calls it "ද්වී අවස්ථා තර්ක සහ බූලීය වීජගණිතය" (විෂය නිර්දේශය 4.2, පිටුව 12). The Teachers' Guide uses the bar for NOT, the dot for AND and the plus for OR (Teachers' Guide 4.2, page 99) (ගුරු අත්පොත 4.2, පිටුව 110).
A switch picture for each operation
Each operation is a way to connect switches. This picture is outside the syllabus. It comes from Claude Shannon's 1937 master's thesis, which showed that Boolean algebra describes circuits of switches and relays (Shannon, 1938).
- AND is two switches in series. Current flows only when switch A and switch B are both closed.
- OR is two switches in parallel. Current flows when switch A is closed, or switch B is closed, or both.
- NOT is a switch that works the other way. The lamp is on when the switch is not pressed.
Let 1 mean "closed" and 0 mean "open". Then every law in this post is a fact about switches that students can see.
Plus is not addition
The plus sign means OR, so 1 + 1 = 1, because "on OR on" is on. There is no 2 in Boolean algebra. This one fact explains why A + A = A and 1 + A = 1 are true, while they are false in ordinary algebra.
Boolean algebra also has no subtraction and no division. So a term cannot be "cancelled". Section 9 shows the mistake that this causes.
2. Three ways to prove a law
A law is proved in one of three ways: by truth table, in two cases, or from the postulates. The Teachers' Guide uses the first. The other two are faster or deeper.
Proof by truth table
A truth table proves a law by checking every row. This method is in the syllabus. Write every combination of the inputs. Work out the left side and the right side in separate columns. If the two columns are the same in every row, the law is true. The Teachers' Guide proves each law like this and writes "Above highlighted columns are identical" (Teachers' Guide 4.2, pages 99 to 102). The Sinhala Teachers' Guide writes "ඉහත ඉස්මතු කරන ලද තීරයන්හි අගයන් සමාන ව ඇත" (ගුරු අත්පොත 4.2, පිටු 110 ඉඳන් 113).
The method always works, but it is slow. Three variables need 2³ = 8 rows.
Proof in two cases
A variable can only be 0 or 1, so a law is true when it holds for both values of one variable. This method is outside the syllabus, but it uses only syllabus ideas.
Try A + AB = A.
- Put A = 0. The left side is
0 + 0.B = 0. The right side is 0. They agree. - Put A = 1. The left side is
1 + 1.B = 1. The right side is 1. They agree.
Both cases agree, so the law is true for every value of B. This idea has a name: Boole's expansion theorem, also called the Shannon expansion. It says that any Boolean function splits into the case x = 1 and the case x = 0 (Boole's expansion theorem).
Use this method to check a law mentally. In the exam, use the method that the question asks for.
Proof from the postulates
A postulate is a rule that is accepted without proof, and every other law is proved from the postulates, step by step. The syllabus lists "Postulates (Axioms)" before the laws (Syllabus 4.2, page 12). The Sinhala syllabus writes "උපකල්පන (Postulates) සහ ප්රත්යක්ෂ/ ස්වසිද්ධිය (Axioms)" (විෂය නිර්දේශය 4.2, පිටුව 12).
In 1904, Edward Huntington showed how the whole algebra can be built from a small set of postulates (Huntington, 1904). One common set has four pairs. This set is outside the syllabus.
- Identity.
A + 0 = AandA.1 = A. - Commutative.
A + B = B + AandAB = BA. - Distributive.
A(B + C) = AB + ACandA + BC = (A + B)(A + C). - Complement.
A + A' = 1andAA' = 0.
All other laws in this post follow from these eight lines (Boolean algebra). The third panel of the diagram proves A + AB = A with a chain of named laws. One step uses the null law, which is itself proved from the postulates.
3. Laws with one variable
Five laws need only one variable, and each one is a fact about one switch. The Sinhala Teachers' Guide name of each law is given in quotes.
- Idempotent law ("තදේවභාවී න්යායය").
A + A = AandA.A = A. Two copies of the same switch, in series or in parallel, act as one switch (Teachers' Guide 4.2, page 99) (ගුරු අත්පොත 4.2, පිටුව 110). - Identity law ("සර්වසාම්ය න්යායය").
0 + A = Aand1.A = A. An open switch in parallel changes nothing. A closed switch in series changes nothing (Teachers' Guide 4.2, page 100) (ගුරු අත්පොත 4.2, පිටුව 110). - Null law.
1 + A = 1and0.A = 0. A closed switch in parallel keeps the lamp on. An open switch in series keeps it off. Both Teachers' Guides put these two lines under the identity law (Teachers' Guide 4.2, page 100) (ගුරු අත්පොත 4.2, පිටුව 110). - Complement law ("ප්රතිලෝම න්යායය").
A + A' = 1andA.A' = 0. A and A' are never both 0 and never both 1. The Guide calls it the "Inverse/Complement Law" (Teachers' Guide 4.2, page 100) (ගුරු අත්පොත 4.2, පිටුව 110). - Double complement law ("ද්විත්ව ප්රතිලෝම න්යායය").
(A')' = A. Two NOTs give back the start value (Teachers' Guide 4.2, page 100) (ගුරු අත්පොත 4.2, පිටුව 111).
4. Every law has a mirror
The reason most laws come in two forms is the duality principle, which is outside the syllabus. The Teachers' Guide says that "most laws exist in two forms", a multiplicative form and an additive form (Teachers' Guide 4.2, page 99). The Sinhala Guide says "බොහෝ බූලීය න්යායවල ගුණිත සහ ආකලන යනුවෙන් ආකාර දෙකක් ඇත" (ගුරු අත්පොත 4.2, පිටුව 110). Neither Guide says why.
The mirror rule
Any true law gives a second true law when its signs and constants are swapped. Change every + to a dot, and every dot to a +. Change every 0 to 1, and every 1 to 0. Do not change the variables or the bars. The result is also a true law (Boolean algebra).
For example, A + 0 = A becomes A.1 = A. And A + A' = 1 becomes A.A' = 0.
Why the mirror works
The mirror works because the postulates of section 2 come in pairs, and each pair is one mirror swap. So any proof of a law, mirrored line by line, is a proof of the mirror law.
Shannon's thesis shows the mirror in history. In his paper, 1 meant an open circuit, and the plus sign meant a series connection (Shannon, 1937). That is the mirror of the reading in section 1, and his algebra still worked.
5. Laws that move terms
Three laws do not make an expression shorter. They move terms, so that a shorter form can appear.
Commutative and associative laws
The commutative law says that order does not matter: AB = BA and A + B = B + A (Teachers' Guide 4.2, page 101) (ගුරු අත්පොත 4.2, පිටුව 111). Two switches in series work in either order. The Sinhala Guide calls it "න්යාදේශ න්යායය".
The associative law says that grouping does not matter. A(BC) = (AB)C and A + (B + C) = (A + B) + C (Teachers' Guide 4.2, page 101) (ගුරු අත්පොත 4.2, පිටුව 112). So the brackets can be dropped: ABC or A + B + C. The Sinhala Guide calls it "සංඝටණ න්යාය", and the Sinhala syllabus "සංඝටන න්යාය".
Two forms of the distributive law
The Teachers' Guide gives one form: A(B + C) = AB + AC (Teachers' Guide 4.2, page 102) (ගුරු අත්පොත 4.2, පිටුව 112). The Sinhala Guide calls it "විභේදන න්යායය". This is the form students know from school algebra. Used from left to right, it expands. Used from right to left, it takes out a common factor. Taking out a common factor is the step students use most.
The mirror of this law is A + BC = (A + B)(A + C). It is false in ordinary algebra. It is true in Boolean algebra. Check it in two cases.
- Put A = 1. The left side is 1. The right side is
1.1 = 1. - Put A = 0. The left side is BC. The right side is
B.C, which is BC.
6. Laws that remove terms
These are the laws that make an expression shorter. The Teachers' Guide calls two of them the redundancy law (Teachers' Guide 4.2, page 102), and the Sinhala Guide calls it "සමතිරික්තතා න්යායය" (ගුරු අත්පොත 4.2, පිටුව 113). A Venn diagram shows why they are true. In a Venn diagram, AND is the overlap and OR is everything in both circles (Boolean algebra). Venn diagrams are outside this syllabus level.
Redundancy form 1
A + AB = A (Teachers' Guide 4.2, page 102) (ගුරු අත්පොත 4.2, පිටුව 113). In words: if A is already 1, AB adds nothing. If A is 0, then AB is 0 too. So AB is never needed. Other books call this the absorption law (Absorption law). Its mirror is A(A + B) = A.
How to spot it. One term is a part of another term. The shorter term "swallows" the longer one. For example, XY + XYZ = XY.
Redundancy form 2
A + A'B = A + B (Teachers' Guide 4.2, page 102) (ගුරු අත්පොත 4.2, පිටුව 113). In words: the term A'B is only needed when A is 0. But when A is 0, A' is 1 anyway. So the A' inside A'B does no work, and it can be removed.
How to spot it. A term stands next to another term that holds its complement. Remove the complement from the second term.
The combining law
XY + XY' = X. This law is outside the syllabus as a name, but syllabus laws prove it.
XY + XY' = X(Y + Y')by the distributive law.= X.1by the complement law.= Xby the identity law.
How to spot it. Two terms are the same except for one variable. That variable is plain in one term and has a bar in the other. That variable disappears. This is exactly what a loop of two cells does in a Karnaugh map. The map puts such pairs next to each other so that students can see them (Karnaugh map).
The consensus law
AB + A'C + BC = AB + A'C. This law is outside the syllabus (Consensus theorem). In words: BC is needed only when B and C are both 1. But then AB is 1 when A is 1, and A'C is 1 when A is 0. So BC adds nothing.
Do not write "consensus law" as a step in the exam. To prove it with syllabus laws, multiply BC by (A + A'), which is 1. Then expand, and use redundancy form 1 twice. This is a backward step: the expression gets longer for one line, so that it can become shorter. All About Circuits calls this kind of step a move "backward" to reach the best answer (All About Circuits).
7. De Morgan's laws
De Morgan's laws say what to do with a bar over a group. The Teachers' Guide gives both forms and proves them by truth table (Teachers' Guide 4.2, page 100) (ගුරු අත්පොත 4.2, පිටුව 111). The Sinhala syllabus calls them "ඩි මෝර්ගන්ගේ න්යායය".
(AB)' = A' + B'(A + B)' = A'B'
The laws in words
The laws are everyday sense. De Morgan stated them in his 1847 book Formal Logic (De Morgan's laws).
- "It is not true that both lights are on" means "at least one light is off". That is
(AB)' = A' + B'. - "It is not true that either light is on" means "both lights are off". That is
(A + B)' = A'B'.
Break the bar and change the sign
The two laws work as one rule. Cut the long bar into short bars over each part, and change the sign under the cut: AND becomes OR, and OR becomes AND. The rule also works for three or more variables, for example (A + B + C)' = A'B'C'.
Apply the rule to the outer bar first. Then use the double complement law where two bars meet over one letter.
A proof without a table
Each value has exactly one complement, so De Morgan's law can be proved with two facts instead of a table. This proof is outside the syllabus. To show that A'B' is the complement of A + B, show that their OR is 1 and their AND is 0.
(A + B) + A'B' = 1. Use redundancy form 2 onA + A'B'to getA + B'. ThenA + B' + B = 1.(A + B).A'B' = 0. Expand:AA'B' + BA'B'. Each term holds a variable and its complement, so each is 0.
Why De Morgan matters for gates
De Morgan's laws join Boolean algebra (4.2) to logic gates (4.1). They show that a NAND gate is an OR gate with inverted inputs, and a NOR gate is an AND gate with inverted inputs. This is why NAND and NOR are universal gates (Syllabus 4.1, page 12) (විෂය නිර්දේශය 4.1, පිටුව 12). The Sinhala syllabus calls them "සාර්ව ද්වාර".
8. How to see which law to use
The shape of the expression tells students which law to use. Read the expression, find the first pattern in this list, and use its law. Then read again.
- A bar over a group. Use De Morgan's laws, then the double complement law.
- Brackets multiplied together. Expand with the distributive law, or use the second distributive form.
- The same term twice. Remove one copy with the idempotent law.
- A variable and its complement in one product, such as
AA'B. The term is 0 by the complement law and the null law. - Two terms that differ in one variable. Take out the common factor, then use the complement and identity laws.
- One term inside another term. Use redundancy form 1.
- A term next to a term that holds its complement. Use redundancy form 2.
- Stuck. Take a backward step. Copy a term with the idempotent law (
X = X + X), so that it can be used twice. Or multiply a term by(A + A').
One example from start to end
This example is new. It is not from a past paper. Simplify F = AB'C' + AB'C + ABC.
- The first two terms differ only in C (pattern 5).
AB'C' + AB'C = AB'(C' + C) = AB'.1 = AB', by the distributive, complement and identity laws. - Now
F = AB' + ABC. Both terms hold A, so take it out (pattern 5 again).F = A(B' + BC), by the distributive law. - Inside the bracket, B' stands next to BC, which holds its complement (pattern 7).
B' + BC = B' + C, by redundancy form 2. - So
F = A(B' + C) = AB' + AC.
Check the answer. Put A = 1, B = 1, C = 0 in both. The first form gives 0. The last form gives 0. Then try one more row. A quick check like this finds most mistakes.
Count the gates. The Teachers' Guide says that simplification "reduces the number of operations and number of logic gates" (Teachers' Guide 4.2, page 99). The Sinhala Guide says "අවශ්ය කරන පියවර ගණන සහ තාර්කික ද්වාර ගණන, අඩු කර ගත හැකිය" (ගුරු අත්පොත 4.2, පිටුව 110). The first form needs three 3-input AND gates, one 3-input OR gate and NOT gates. A(B' + C) needs one OR gate, one AND gate and one NOT gate.
9. Proving an identity in Paper II
A "show that" question fixes the goal, and a fixed goal makes the work easier, because the shape to reach is known. Many Paper II questions say "show that the left side equals the right side using Boolean algebra".
A method for "show that" questions
- Start from the longer side. Usually the left side. Do not change both sides at once.
- Look at the target. Compare the two sides, and find the variables or terms that must disappear. This tells students which pattern from section 8 to look for.
- Write one law on each line. Write the law's name next to the line, as the Teachers' Guide examples do (Teachers' Guide 4.2, page 102) (ගුරු අත්පොත 4.2, පිටුව 113).
- Check one row. Put values into the start and the end. If they differ, look for the wrong line.
Three common mistakes
- Cancelling.
AB = ACdoes not meanB = C. Try A = 0: both sides are 0 for any B and C. There is no division in Boolean algebra. - Adding like numbers.
A + Ais A, not 2A. Plus means OR. - Breaking a bar without changing the sign.
(A + B)'isA'B', notA' + B'.
10. Past paper questions on Boolean laws
Boolean algebra (4.2) appears in all 8 new-syllabus papers from 2019 to 2026, with 10 MCQs and 57 Paper II marks in total. These counts include the Karnaugh map items. The 2022 and 2024 keys come from third-party schemes, and the 2023 (held 2024) paper has no official scheme, so its marks are estimates.
Try these questions first. The answers are not in this post. Use the sections in brackets to check the thinking.
- 2026 Paper II, B, Q5(a): state and prove De Morgan's laws (sections 2 and 7).
- 2024 Paper I, Q13: double complement and De Morgan's laws on one expression (section 7).
- 2022 (held 2023) Paper I, Q10: a two-term expression with a complement (section 6).
- 2023 (held 2024) Paper I, Q13: a bracket with a complement inside (sections 4 and 6).
- 2026 Paper I, Q11: three terms that share a variable (sections 6 and 8).
- 2020 Paper I, Q9: pick the simplest equal expression from five options (sections 6 and 8).
- 2024 Paper II, B, Q5(b): the simplest form of a product of sums plus a term (sections 5 and 6).
- 2022 (held 2023) Paper II, B, Q5(b)(i): show that four terms equal three shorter terms (sections 8 and 9).
- 2023 (held 2024) Paper II, B, Q5(b): show that four terms equal two terms (sections 6, 8 and 9).
- 2025 Paper II, B, Q5(a): show that six four-variable terms equal three terms (sections 8 and 9).
- 2026 Paper II, B, Q5(b): show that four terms equal a grouped form, by simplifying the left side (sections 5 and 9).
Old syllabus, for extra practice only:
- 2013 Paper I, Q1: a product of two sums (section 5).
- 2018 Paper I, Q21: which expressions equal a complemented group (section 7).
Sources outside the syllabus
The syllabus and Teachers' Guide pages are cited in the text. These are the other sources:
- George Boole, An Investigation of the Laws of Thought, 1854. Project Gutenberg.
- Claude E. Shannon, "A Symbolic Analysis of Relay and Switching Circuits", master's thesis, MIT, 1937, published in Transactions of the AIEE, 1938. DSpace@MIT, PDF copy.
- Edward V. Huntington, "Sets of Independent Postulates for the Algebra of Logic", Transactions of the American Mathematical Society 5(3), 1904, pages 288 to 309. PDF.
- Boolean algebra: laws, duality principle and Venn diagrams. Wikipedia.
- Boole's expansion theorem (Shannon expansion). Wikipedia.
- Absorption law. Wikipedia.
- Consensus theorem. Wikipedia.
- De Morgan's laws, with De Morgan's 1847 Formal Logic. Wikipedia.
- Karnaugh map, from Maurice Karnaugh, "The Map Method for Synthesis of Combinational Logic Circuits", Transactions of the AIEE 72(1), 1953. Wikipedia.
- Tony R. Kuphaldt, "Boolean Rules for Simplification", Lessons in Electric Circuits, Volume IV. All About Circuits.
