📚 IGCSE Edexcel Computer Science: Boolean Algebra Key Points | IGCSE Edexcel 计算机：布尔代数考点精讲
Boolean algebra is the mathematical backbone of digital logic circuits, forming a vital part of the IGCSE Edexcel Computer Science syllabus. Understanding how to manipulate true/false values using logical operators like AND, OR, and NOT is essential for designing and simplifying logic circuits, interpreting truth tables, and applying De Morgan’s laws. This article provides a focused, exam-oriented walkthrough of every key concept, with clear explanations and practical examples to help you master Boolean algebra confidently.
布尔代数是数字逻辑电路的数学基础，也是 IGCSE Edexcel 计算机科学大纲的核心内容。掌握如何使用 AND、OR、NOT 等逻辑运算符处理真/假值，对于设计并简化逻辑电路、解读真值表以及应用德摩根定律至关重要。本文针对考点，逐一讲解每个关键概念，并配以清晰的解释和实用示例，帮助你自信攻克布尔代数。
1. What is Boolean Algebra? | 什么是布尔代数？
Boolean algebra is a branch of algebra where the variables can only have two possible values: TRUE and FALSE, often represented as 1 and 0. It was developed by George Boole in the 19th century and now serves as the foundation for digital electronics and computer logic. In exams, you will use Boolean algebra to express the behaviour of logic gates and to simplify logic circuits.
布尔代数是代数的一个分支，其中的变量只能取两个值：真（TRUE）和假（FALSE），通常用 1 和 0 表示。它由乔治·布尔在 19 世纪创立，如今已成为数字电子学和计算机逻辑的基础。在考试中，你需要用布尔代数来描述逻辑门的行为，并化简逻辑电路。
2. Boolean Values and Logic Levels | 布尔值与逻辑电平
In digital systems, the two Boolean values are mapped to voltage levels: a high voltage represents logic 1 (TRUE), and a low voltage represents logic 0 (FALSE). This binary system allows electronic devices to process information using switches, transistors, and logic gates. Always remember that in Boolean expressions, 1 means ‘on’ or ‘true’, and 0 means ‘off’ or ‘false’.
在数字系统中，两个布尔值对应不同的电压电平：高电平表示逻辑 1（真），低电平表示逻辑 0（假）。这种二进制体系使得电子设备能够利用开关、晶体管和逻辑门来处理信息。要始终记住，在布尔表达式中，1 代表“开”或“真”，0 代表“关”或“假”。
3. NOT Gate | 非门
The NOT gate (inverter) has a single input and a single output. It outputs the opposite logic level to its input: if input A is 1, output F is 0; if A is 0, F is 1. The Boolean expression for a NOT gate is written as F = ¬A or F = A’. Its truth table contains only two rows, clearly showing this inversion.
非门（反相器）有一个输入端和一个输出端。它输出与输入相反的逻辑电平：若输入 A = 1，则输出 F = 0；若 A = 0，则 F = 1。非门的布尔表达式写作 F = ¬A 或 F = A’。其真值表只有两行，清晰地展示了这种反转关系。
4. AND Gate and OR Gate | 与门和或门
AND Gate: The AND gate produces a high output (1) only when all its inputs are high. For a two-input AND gate with inputs A and B, the Boolean expression is F = A · B. If either input is 0, the output is 0. It corresponds to multiplication in Boolean algebra.
中文：与门仅在所有输入均为高电平时输出高电平（1）。对于两输入与门（输入 A、B），布尔表达式为 F = A · B。只要任一输入为 0，输出即为 0。它在布尔代数中对应乘法运算。
OR Gate: The OR gate outputs 1 if at least one input is 1. The Boolean expression for a two-input OR gate is F = A + B. Notice that in Boolean algebra, the ‘+’ symbol denotes the logical OR operation, not arithmetic addition. An OR gate only gives 0 when all inputs are 0.
中文：或门只要至少有一个输入为 1，输出就为 1。两输入或门的布尔表达式为 F = A + B。注意，在布尔代数中，“+”表示逻辑或运算，而非算术加法。只有当所有输入均为 0 时，或门才输出 0。
5. NAND Gate and NOR Gate | 与非门和或非门
NAND Gate: A NAND gate is an AND gate followed by a NOT gate. It outputs the inverse of the AND operation. The expression is F = ¬(A · B). The NAND gate is very popular in digital circuits because it is considered a universal gate – any logic circuit can be built using only NAND gates.
中文：与非门相当于在与门之后接入一个非门，其输出是与运算的反相。表达式为 F = ¬(A · B)。与非门在数字电路中十分常用，因为它是一种通用门——仅用与非门就可以构建任何逻辑电路。
NOR Gate: The NOR gate performs an OR operation followed by inversion: F = ¬(A + B). Like NAND, a NOR gate is also universal, meaning all other gates can be implemented using NOR gates alone. Understanding NAND and NOR is crucial for circuit simplification questions.
中文：或非门先进行或运算再取反：F = ¬(A + B)。和与非门一样，或非门也是通用门，仅用或非门就能实现所有其他逻辑门。理解与非门和或非门对于解答电路化简题至关重要。
6. XOR Gate | 异或门
The XOR (exclusive OR) gate outputs 1 only when its two inputs are different. If both inputs are the same (both 0 or both 1), the output is 0. The Boolean expression is F = A ⨁ B, which can also be written as F = (¬A · B) + (A · ¬B). XOR gates are widely used in arithmetic circuits, such as half adders, that you might encounter in IGCSE Computer Science.
异或门（XOR）只有当两个输入不同时才输出 1。如果两个输入相同（同为 0 或同为 1），则输出 0。其布尔表达式为 F = A ⨁ B，也可以写成 F = (¬A · B) + (A · ¬B)。异或门广泛用于算术电路，例如 IGCSE 计算机科学中可能出现的半加器。
7. Truth Tables | 真值表
A truth table lists all possible input combinations and the corresponding output for a given logic circuit or Boolean expression. It is a fundamental tool for analysing and proving Boolean identities. For example, the truth table for a two-input AND gate is shown below.
真值表列出了给定逻辑电路或布尔表达式的所有可能输入组合及对应的输出。它是分析和证明布尔恒等式的基本工具。例如，下面展示了两输入与门的真值表。
| A | B | A · B |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
When you build a truth table for any expression, start by listing all binary combinations of the input variables (2ⁿ rows for n inputs). Then evaluate the expression step by step, often using intermediate columns in your working. This method is particularly helpful when simplifying complex expressions or verifying De Morgan’s laws.
为任何表达式构建真值表时，应首先列出所有输入变量的二进制组合（n 个输入对应 2ⁿ 行），然后逐步计算表达式，解题时常用中间列辅助。这一方法在化简复杂表达式或验证德摩根定律时尤为有用。
8. Boolean Expressions and Operator Precedence | 布尔表达式与运算符优先级
Writing correct Boolean expressions is essential for exam success. The standard order of precedence is: parentheses first, then NOT (¬), then AND (·), and finally OR (+). For example, in the expression F = A + B · ¬C, you must first compute ¬C, then B · ¬C, and finally OR with A. If you need to change the order, use parentheses: (A + B) · ¬C gives a completely different function.
写出正确的布尔表达式是考试拿分的关键。标准的优先级顺序为：括号优先，其次是非（¬），然后是与（·），最后是或（+）。例如，在表达式 F = A + B · ¬C 中，必须先计算 ¬C，再算 B · ¬C，最后才与 A 进行或运算。若需改变顺序，就要使用括号：(A + B) · ¬C 所表示的功能完全不同。
Always check whether an expression matches the given logic diagram by applying these precedence rules. Many exam questions ask you to derive the Boolean expression from a circuit or to draw the circuit for a given expression.
务必根据优先级规则检查表达式是否与给定的逻辑图匹配。许多考题会要求你根据电路推导布尔表达式，或根据表达式绘制电路图。
9. Boolean Laws and Simplification | 布尔定律与化简
A set of fundamental laws allows you to simplify Boolean expressions algebraically, which is a key skill for obtaining minimal circuits. The most important laws are summarised in the table below.
利用一组基本定律可以代数化简化布尔表达式，这是获得最简电路的关键技能。下表汇总了最重要的定律。
| Law / 定律 | AND form / 与形式 | OR form / 或形式 |
|---|---|---|
| Commutative / 交换律 | A · B = B · A | A + B = B + A |
| Associative / 结合律 | (A · B) · C = A · (B · C) | (A + B) + C = A + (B + C) |
| Distributive / 分配律 | A · (B + C) = (A · B) + (A · C) | A + (B · C) = (A + B) · (A + C) |
| Identity / 同一律 | A · 1 = A | A + 0 = A |
| Complement / 互补律 | A · ¬A = 0 | A + ¬A = 1 |
| Absorption / 吸收律 | A · (A + B) = A | A + (A · B) = A |
Let’s apply the absorption law to simplify the expression F = A + A·B. Since A + A·B = A, the whole expression reduces to A, eliminating the AND gate. This type of algebraic simplification can dramatically reduce the number of gates required in a circuit, saving cost and power. When simplifying, always aim to produce the smallest possible sum-of-products or product-of-sums form.
我们来运用吸收律化简表达式 F = A + A·B。由于 A + A·B = A，整个表达式化简为 A，省去了与门。这种代数化简可以大幅减少电路中所需逻辑门的数量，从而节约成本与功耗。化简时，始终力求得到最简的与或式或或与式。
10. De Morgan’s Theorems and Circuit Design | 德摩根定理与电路设计
De Morgan’s theorems provide a powerful way to transform expressions and are frequently tested. They state:
德摩根定理提供了表达式转换的有力工具，是常考内容。定理表述为：
¬(A · B) = ¬A + ¬B
¬(A + B) = ¬A · ¬B
These identities allow you to convert AND operations to OR operations, and vice versa, by NEGATING all variables and changing the operator. They are indispensable when you need to implement a circuit using only NAND gates or only NOR gates. For instance, to implement F = A · B using only NAND gates, you can use the fact that a NAND gate is ¬(A·B). A quick application of double negation gives A·B = ¬(¬(A·B)), which means you can connect both inputs of the same NAND gate to the output of a first NAND gate to create an AND function.
这些恒等式通过将所有变量取反并改变运算符，实现了与运算和或运算之间的转换。当你需要用纯与非门或纯或非门实现电路时，德摩根定理必不可少。例如，要仅用与非门实现 F = A · B，可以利用 NAND 就是 ¬(A·B) 这一事实。应用双重否定可得 A·B = ¬(¬(A·B))，这意味着你可以将一个与非门的两个输入端短接到第一个与非门的输出端，从而得到与功能。
A typical exam question might give you the expression F = ¬(A + B) + C and ask you to simplify it using De Morgan’s law before drawing the logic circuit. Applying the theorem to the first term yields F = (¬A · ¬B) + C. Now the circuit requires two NOT gates, one AND gate, and one OR gate, or it can be further transformed into NAND-only form.
常见的考题会给出表达式 F = ¬(A + B) + C，要求先用德摩根定律化简，再绘制逻辑电路。对第一项应用定理得到 F = (¬A · ¬B) + C。此时电路需要两个非门、一个与门和一个或门，也可以进一步转换为纯与非门形式。
When designing a circuit from an expression, always start by identifying the operations that need to be performed last, working backwards to the inputs. Label all intermediate connections clearly, and double-check with a truth table if time permits.
根据表达式设计电路时，始终从最后要执行的运算着手，逆向追溯到输入端。清晰标注所有中间连线，若时间允许，再用真值表进行复核。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导