This post explains where the Boolean laws of Unit 4 came from, why they are in A/L ICT, and how students can learn them without memorizing a list. Each law started as a rule about clear thinking. About 90 years ago, engineers found that the same rules describe switches. Today they decide how many gates a chip needs, and that is the reason the exam asks them.
The post has three parts:
- The history: the laws before Boole, Boole's algebra, the changes after Boole, and the step from logic to switches (sections 1 to 4).
- The reason: why circuits need the laws, and how the papers ask them (sections 5 and 6).
- The method: how to learn each law from its origin, and past paper questions to try (sections 7 and 8).
How to read the expressions. This post writes NOT A as A', AND as AB or A.B, and OR as A + B, as in the Teachers' Guide worked examples.
1. Laws older than Boolean algebra
Two Boolean laws are about 2,300 years older than Boolean algebra. They are the two forms of the complement law, and they come from Aristotle.
Aristotle's two rules
Aristotle wrote two rules for correct reasoning in Greece, in the fourth century BC.
- The principle of contradiction. A thing cannot have a quality and not have it at the same time. A light cannot be on and off at once. In Boolean algebra this is
A.A' = 0. - The law of excluded middle. A thing has the quality or it does not, and there is no third case (Law of excluded middle). A light is on or off. In Boolean algebra this is
A + A' = 1.
These two rules are why a Boolean variable has only two values. The syllabus calls this "Two state logic" (Syllabus 4.2, page 12), and the Sinhala syllabus calls it "ද්වී අවස්ථා තර්ක" (විෂය නිර්දේශය 4.2, පිටුව 12). The Sinhala Teachers' Guide asks teachers to discuss that a variable can only be 0 or 1: "විචල්යයක අගය 0 හෝ 1 හෝ පමණක් විය හැකි බව" (ගුරු අත්පොත 4.2, පිටුව 109). The English Guide does not list this discussion point.
Leibniz and the binary numbers
Gottfried Leibniz published a binary number system in 1703, with only the digits 0 and 1 (Binary number). He also hoped for a "calculus" that could check reasoning like arithmetic. He did not build that algebra. So by 1800 the two pieces existed apart: two-valued reasoning, and numbers written with 0 and 1. Boole joined them.
2. Boole turns reasoning into algebra
George Boole wrote the rules of reasoning as equations, in two books: The Mathematical Analysis of Logic in 1847 and An Investigation of the Laws of Thought in 1854 (Boole). His letters stood for classes of things, not for numbers.
Letters for classes
In Boole's algebra, a letter such as x stands for a class, for example "men". Then:
- xy is the class of things in both classes. If y is "tall things", xy is "tall men". This is AND.
- 1 is the class of everything, and 0 is the empty class.
- 1 − x is everything that is not in x, for example "not men". This is NOT.
The law that is not in school algebra
Boole's key law is xx = x, because "men who are men" are just men. In ordinary algebra x² = x is true only for 0 and 1. That is why Boolean values are only 0 and 1. In The Laws of Thought Boole called x² = x the "law of duality" (Boole, 1854). In 1870 Benjamin Peirce named it the idempotent law, the name that the Teachers' Guide uses (Teachers' Guide 4.2, page 99) (ගුරු අත්පොත 4.2, පිටුව 110).
Aristotle's rule as an equation
Boole rewrote x² = x as x(1 − x) = 0, and he read the result as Aristotle's principle of contradiction. The class of things that are both "men" and "not men" is empty. He wrote that this is the principle "which Aristotle has described as the fundamental axiom of all philosophy" (Boole, 1854, Chapter III, Proposition IV). In today's notation, x(1 − x) = 0 is A.A' = 0, the complement law of section 1.
De Morgan in the same year
Augustus De Morgan published Formal Logic in late 1847, the same year as Boole's first book (Algebra of logic). The laws with his name say what NOT does to AND and OR. The syllabus lists them as "De Morgan's" (Syllabus 4.2, page 12), and the Sinhala syllabus as "ඩි මෝර්ගන්ගේ න්යායය" (විෂය නිර්දේශය 4.2, පිටුව 12).
3. How the laws changed after Boole
Boole's algebra was not yet the algebra in the Teachers' Guide. Over about 60 years, other people changed its plus sign, gave it a small set of starting rules, and gave it its name.
Plus becomes OR
Boole's plus worked only for classes with no common members, so x + x had no meaning for him. In 1863 William Stanley Jevons wrote to Boole that plus should be the "inclusive or". That gives the law X + X = X. Boole did not agree. Jevons used the inclusive plus in his book Pure Logic in 1864, and Charles Sanders Peirce reached the same idea in 1867 (Algebra of logic).
This change is why A + A = A and 1 + A = 1 are true in Boolean algebra. It is also why the plus sign means OR, not addition. Boole's 1 − x for NOT was also dropped. Modern Boolean algebra writes NOT with a bar and has no subtraction. The Sinhala Teachers' Guide says that of the four basic operations, only addition and multiplication are used: "මූලික ගණිත කර්ම හතරෙන් භාවිත කළ හැක්කේ එකතු කිරීම සහ වැඩි කිරීම පමණක් වන බව" (ගුරු අත්පොත 4.2, පිටුව 109).
Pictures and one operation
- Venn diagrams, 1880. John Venn drew classes as overlapping circles. The redundancy laws are easy to see in such a picture.
- One operation is enough, 1880 to 1881. Peirce showed that NOR alone, or NAND alone, can make every other operation. The work stayed unpublished until 1933 (Switching circuit theory). This is the idea behind the universal gates (4.1).
Postulates and a name
In 1904 Edward Huntington gave a small set of postulates from which every law can be proved (Huntington, 1904). This is the "Postulates (Axioms)" line of the syllabus (Syllabus 4.2, page 12). In 1913 Henry Sheffer proved that one operation, "not both", is enough. That operation is NAND. According to Huntington, Sheffer was also the first to suggest the name "Boolean algebra" (Henry M. Sheffer).
4. From logic to switches
The laws reached electronics through switches. In an 1886 letter, Peirce wrote that logical operations could be done with electrical switching circuits (Switching circuit theory). Nobody built a theory on it for almost 50 years.
Three engineers in the 1930s
In the 1930s, three engineers in three countries showed, each on his own, that Boolean algebra describes circuits of relays and switches:
- Akira Nakashima, an NEC engineer in Japan, from 1935.
- Claude Shannon in the United States, in his 1937 master's thesis at MIT, published in 1938 (Shannon, 1938).
- Victor Shestakov in the Soviet Union, with a 1938 thesis that he published in 1941.
Switches in series act as AND. Switches in parallel act as OR. So a Boolean law is also a fact about wires: two circuits with equal expressions do the same job. Shannon used this to make relay circuits smaller with the laws, before building them. In November 1937, George Stibitz built a binary adder from relays on his kitchen table, the "Model K" (George Stibitz).
The same idea in a past paper
The papers still ask Shannon's idea. 2014 Paper I, Q13 shows four push button switches and a bulb. S1 and S4 are in series, with S2 and S3 in parallel between them. The bulb is on only when S1 is pushed, S4 is pushed, and S2 or S3 is pushed. So the expression is S1.S4.(S2 + S3), which is option 4. This is old syllabus. The key comes from a third-party scheme, and our own working gives the same answer.
5. Why circuits need the laws
Boolean laws make a circuit smaller without changing what it does. The Teachers' Guide asks "What is the requirement of Boolean algebra simplification?" and answers that simplification "reduces the number of operations and number of logic gates for the implementation" (Teachers' Guide 4.2, page 99). The Sinhala Guide says "අවශ්ය කරන පියවර ගණන සහ තාර්කික ද්වාර ගණන, අඩු කර ගත හැකිය" (ගුරු අත්පොත 4.2, පිටුව 110).
Fewer gates for the same output
Every gate costs money, space, power and time. A law changes the expression, but never its truth table. So the smaller circuit does exactly the same job. 2022 (held 2023) Paper I, Q10 says this in its first line: simplified Boolean expressions help to get simpler circuits ("සුළු කළ බූලීය ප්රකාශ වඩාත් සරල පරිපථ ලබාගැනීමට ඉවහල් වේ"). It then asks for the simplified form of X + X'Y. The answer is X + Y, option 5, by the redundancy law. The key comes from a third-party scheme.
2026 Paper I, Q11 shows how much a law can save. It asks what AB + AB' + AC equals. Our own worked answer, not official:
AB + AB' = A(B + B')by the distributive law, andB + B' = 1by the complement law. SoAB + AB' = A.A + AC = Aby the redundancy law.- So the expression equals
A, which is option 1.
The long form needs five gates. The short form needs no gate at all, only a wire from input A. Input B and input C do not change the output.
The Sinhala Guide's before and after table
The Sinhala Teachers' Guide has an exercise that the English Guide does not have. Each group simplifies one expression with the laws and with a Karnaugh map, and draws the circuit before and after (ගුරු අත්පොත 4.2, පිටුව 109). The group then compares the two circuits under "සුළු කිරීමට පෙර" (before simplifying) and "සුළු කළ පසු" (after simplifying), in seven rows:
- the total number of gates;
- the number of gate types;
- the number of inputs for each OR and AND gate;
- the complexity;
- the money needed to build the circuit on electronic boards ("ඉලෙක්ට්රොනික පුවරු භාවිතයෙන් තාර්කික පරිපථය ගොඩ නැගීමට වැය වන මුදල");
- the time needed to build it;
- the final output.
The last row is the point. Everything gets smaller, but the final output stays the same.
Methods that grew from the laws
Engineers needed faster ways to apply the laws. Edward Veitch drew a chart in 1952, and Maurice Karnaugh improved it into the Karnaugh map in 1953 (Karnaugh map). The map puts terms that differ in one variable next to each other, so the law XY + XY' = X becomes a loop. Willard Quine (1952) and Edward McCluskey (1956) wrote a step-by-step method that a computer can run (Quine–McCluskey algorithm). Today, chip design software applies the same laws to circuits with billions of transistors (Logic synthesis).
6. Why the exam asks Boolean laws
The exam asks Boolean laws because the syllabus asks students to explain why simplification is needed and to do it. Its first learning outcome for this level is "Describes the need for simplifying Boolean expressions" (Syllabus 4.2, pages 12 and 13). The Sinhala syllabus writes "බූලීය ප්රකාශ සුළු කිරීමේ අවශ්යතාව පැහැදිලි කරයි" (විෂය නිර්දේශය 4.2, පිටුව 12). The last outcome asks students to simplify "using Boolean theorems, axioms, De Morgan's Laws and Karnaugh map" (Teachers' Guide 4.2, page 98) (ගුරු අත්පොත 4.2, පිටුව 108).
How much the level carries
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 2023 (held 2024) paper has no official marking scheme, so its Paper II marks are estimates.
Four question shapes
The Teachers' Guide asks for "simple MCQ, structure and essay type questions on Boolean algebra", and for "logic expressions to simplify using postulates and law/theorems" (Teachers' Guide 4.2, page 99). The Sinhala Guide's assessment asks for both the laws and a Karnaugh map, with the circuits before and after (ගුරු අත්පොත 4.2, පිටුව 109). The papers ask in four shapes:
- Name the laws. 2024 Paper I, Q13 asks what
x' + yzbecomes when the double complement and De Morgan's laws are used. Put two bars over the whole expression, then break the inner bar. The result is the complement ofx(yz)', which is option 4. The key comes from a third-party scheme. - Simplify and pick the option. 2023 (held 2024) Paper I, Q13 asks for the simple form of
X(X' + Y). Expand toXX' + XY, andXX' = 0by the complement law. The answer isXY, option 3. The key comes from a third-party copy of the official key. 2022 (held 2023) Paper I, Q10 and 2026 Paper I, Q11 are in section 5. - State and prove a law. 2026 Paper II, B, Q5(a) asks students to state De Morgan's laws and prove them, for 3 marks. Our own worked answer, not official:
(A.B)' = A' + B'and(A + B)' = A'.B', each proved with a four-row truth table where the two highlighted columns are the same. - Show that one side equals the other. 2026 Paper II, B, Q5(b), 2025 Paper II, B, Q5(a) and 2023 (held 2024) Paper II, B, Q5(b) give a long left side and a short right side. Logic gate questions that join other lessons works the 2026 proof and shows that its left side is the full adder sum.
Each shape tests the same skill: change an expression with a law, and keep its truth table.
7. Master each law through its origin
Each law is easier to keep as the answer to a question than as a line in a list. For each law, learn three things: where it came from, what it means in one sentence, and a two-second check. The English Teachers' Guide asks for "Explanation of the concept of Boolean algebra using day-to-day examples" (Teachers' Guide 4.2, page 98). The Sinhala Guide asks teachers to show, with truth tables, that each law gives the same answer before and after: "සුළු කිරීමට පෙර සහ සුළු කිරීමට පසු ව ලැබෙන පිළිතුර සමාන බව දක්වන්න" (ගුරු අත්පොත 4.2, පිටුව 108).
One sentence for each law
The law names are the names in the Teachers' Guide (Teachers' Guide 4.2, pages 99 to 102) (ගුරු අත්පොත 4.2, පිටු 110 ඉඳන් 113).
- Complement law.
A.A' = 0andA + A' = 1. From Aristotle: a light cannot be on and off at once, and it is always one of the two. - Idempotent law.
A.A = AandA + A = A. From Boole'sxx = xand Jevons'sX + X = X: saying the same thing twice adds nothing. - Identity law and null law.
A + 0 = A,A.1 = A,A + 1 = 1andA.0 = 0. From the switches of section 4: an open switch in parallel changes nothing, and a closed switch in parallel keeps the lamp on. - Commutative law and associative law.
AB = BAandA(BC) = (AB)C. "Tall men" are "men who are tall". The order of two switches in series does not matter. - Distributive law.
A(B + C) = AB + AC. Boole kept it from ordinary algebra. Read from right to left, it takes out what two terms share, as in 2026 Q11. - Redundancy law.
A + AB = AandA + A'B = A + B. With Venn's circles: "men, or tall men" is just "men", because tall men are already inside. - De Morgan's laws.
(AB)' = A' + B'and(A + B)' = A'B'. In words: "not both on" means "at least one is off". - Double complement law.
(A')' = A. "Not not on" is on.
A routine for each law
- Say the origin sentence. Say what the law means in words before writing it.
- Check it in two cases. Put A = 0, then A = 1. Prove a Boolean law in two cases shows how.
- Draw it as switches or circles. If the picture works, the law is right.
- Use it on one past paper line. Name the law next to each step, as the Teachers' Guide examples do.
A law that is rebuilt like this is not lost under exam pressure. Students who forget a law can rebuild it from its meaning in a few seconds. The full proofs, the mirror pairs and the order in which to use the laws are in Boolean algebra laws from the ground up.
8. Past paper questions to try
Try each question before reading any answer. The section in brackets gives the idea that the question tests.
New syllabus:
- 2024 Paper I, Q13: the double complement and De Morgan's laws on one expression (section 6).
- 2022 (held 2023) Paper I, Q10: why simplify, and the redundancy law (section 5).
- 2023 (held 2024) Paper I, Q13: a bracket with a complement inside (section 6).
- 2026 Paper I, Q11: three terms that become one variable (section 5).
- 2026 Paper II, B, Q5(a): state and prove De Morgan's laws (sections 6 and 7).
- 2025 Paper II, B, Q5(a): show that six terms equal three terms (sections 6 and 7).
Old syllabus, for extra practice only:
- 2014 Paper I, Q13: switches in series and parallel (section 4).
- 2014 Paper I, Q12: pick the simplified version of a three-gate circuit (sections 4 and 5).
- 2017 Paper II, B, Q1(b): a user says the switch of an air conditioner is not needed. Use the simplified expression to agree or disagree (section 5).
- 2018 Paper I, Q21: which expressions equal a complemented group (section 7).
- 2011 Paper I, Q27: a simplification with De Morgan's law (section 7).
- 2012 Paper I, Q26: a simplification with the laws (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, Chapter III, Proposition IV. Project Gutenberg.
- Stanley Burris, "George Boole", Stanford Encyclopedia of Philosophy. SEP.
- Stanley Burris and Javier Legris, "The Algebra of Logic Tradition", Stanford Encyclopedia of Philosophy (Boole and De Morgan in 1847, Jevons in 1863 and 1864, Peirce in 1867). SEP.
- Law of excluded middle. Wikipedia.
- Binary number, with Leibniz's 1703 paper. Wikipedia.
- Switching circuit theory (Peirce 1880 to 1881 and 1886, Nakashima, Shannon, Shestakov). Wikipedia.
- 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.
- Henry M. Sheffer and the name "Boolean algebra". Wikipedia.
- 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.
- George Stibitz and the Model K. Wikipedia.
- Karnaugh map, with Veitch's 1952 chart. Wikipedia.
- Quine–McCluskey algorithm. Wikipedia.
- Logic synthesis. Wikipedia.
