📚 Boolean Algebra Masterclass: Exam Essentials | IB Edexcel 计算机 布尔代数考点精讲
Boolean algebra is the backbone of digital logic and forms a crucial topic in the Edexcel AS/A Level Computer Science syllabus. Understanding how to manipulate logical expressions, simplify circuits, and apply laws like De Morgan’s laws is essential for top marks. This guide breaks down every key concept you need to master.
布尔代数是数字逻辑的基石，也是 Edexcel 计算机科学 AS/A Level 课程中的核心主题。掌握逻辑表达式的变换、电路化简以及德摩根定律等应用，是取得高分的关键。本指南将详细拆解你必需掌握的每一个核心概念。
1. Boolean Values and Basic Operations | 布尔值与基本运算
Boolean variables can hold only two possible values: true (represented as 1) or false (represented as 0). This binary nature underpins all digital electronics and programming conditions. The three fundamental operations are:
布尔变量只能取两个值：真 (用 1 表示) 或 假 (用 0 表示)。这种二元特性是所有数字电子设备和编程条件判断的基础。三种基本运算为：
AND (Conjunction): Denoted as A · B or A ∧ B. The output is 1 only if both A and B are 1. OR (Disjunction): Denoted as A + B or A ∨ B. The output is 1 if at least one input is 1. NOT (Negation): Denoted as ¬A or A'. The output is the logical complement of A.
与 (AND): 写作 A · B 或 A ∧ B。仅当 A 和 B 同时为 1 时，输出才为 1。或 (OR): 写作 A + B 或 A ∨ B。只要至少一个输入为 1，输出就为 1。非 (NOT): 写作 ¬A 或 A'。输出与 A 的逻辑值相反。
A ∧ B , A ∨ B , ¬A
2. Logic Gate Symbols | 逻辑门符号
In Edexcel examinations, you must recognise standard ANSI/IEEE logic symbols. The table below summarises the most common gates and their expressions.
在 Edexcel 考试中，你必须能识别标准的 ANSI/IEEE 逻辑门符号。下表总结了最常见的门电路及其表达式。
| Gate | Symbol Description | Expression |
|---|---|---|
| AND | Flat back, D-shaped | F = A ∧ B |
| OR | Curved back, pointed front | F = A ∨ B |
| NOT | Triangle with small circle (bubble) | F = ¬A |
| NAND | AND followed by a bubble | F = ¬(A ∧ B) |
| NOR | OR followed by a bubble | F = ¬(A ∨ B) |
| XOR | OR with an extra curved line at inputs | F = A ⊕ B |
相应地：
| 门电路 | 符号描述 | 表达式 |
|---|---|---|
| AND | 平背，D 型 | F = A ∧ B |
| OR | 弧形背，尖头 | F = A ∨ B |
| NOT | 三角形加小圆圈 | F = ¬A |
| NAND | AND 后加小圆圈 | F = ¬(A ∧ B) |
| NOR | OR 后加小圆圈 | F = ¬(A ∨ B) |
| XOR | OR 输入侧多一弯线 | F = A ⊕ B |
3. Truth Tables | 真值表
A truth table lists all possible input combinations and the corresponding output. Below are the fundamental tables for AND, OR, and NOT.
真值表列出所有可能的输入组合及其对应的输出。下面是基本门 AND、OR 和 NOT 的真值表。
AND gate truth table:
与门真值表：
| A | B | A ∧ B |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
OR gate truth table:
或门真值表：
| A | B | A ∨ B |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 1 |
NOT gate truth table:
非门真值表：
| A | ¬A |
|---|---|
| 0 | 1 |
| 1 | 0 |
Always build truth tables column by column, starting from all zeroes to all ones for the input variables. This systematic approach prevents missing any combination.
构建真值表时，始终按列逐步列出所有输入组合，从全 0 到全 1。这种系统化方法可以避免遗漏任何情况。
4. Boolean Expressions and Circuits | 布尔表达式与电路
A Boolean expression combines variables using operations. For example, F = (A ∧ B) ∨ ¬ es a circuit where an AND gate feeds into an OR gate together with a NOT gate acting on C.
布尔表达式通过运算将变量组合在一起。例如，F = (A ∧ B) ∨ ¬C 描述了一个电路：一个与门的输出同一个非门作用在 C 上的输出一起送入一个或门。
F = (A ∧ B) ∨ ¬C
When converting an expression to a circuit diagram, handle brackets first: create the AND inside the brackets, then the NOT, and finally the OR. Drawing lines between gates represents signal flow.
在将表达式转换成电路图时，先处理括号：实现括号内的与运算，然后处理非运算，最后实现或运算。用连线表示信号流向。
Conversely, from a circuit diagram you can write the expression by labelling intermediate outputs and composing the final Boolean function.
反之，你可以通过标注中间输出并组合来从电路图写出最终布尔函数。
5. Laws of Boolean Algebra | 布尔代数基本定律
These laws allow you to simplify and manipulate expressions. They must be memorised and applied fluently.
以下定律可用于化简和变换表达式，必须熟练记忆并运用。
Identity Law: A + 0 = A, A · 1 = A
恒等律：A + 0 = A，A · 1 = A
Null Law: A + 1 = 1, A · 0 = 0
零一律：A + 1 = 1，A · 0 = 0
Idempotent Law: A + A = A, A · A = A
幂等律：A + A = A，A · A = A
Complement Law: A + ¬A = 1, A · ¬A = 0
互补律：A + ¬A = 1，A · ¬A = 0
Double Negation: ¬(¬A) = A
双重否定律：¬(¬A) = A
Commutative Law: A + B = B + A, A · B = B · A
交换律：A + B = B + A，A · B = B · A
Associative Law: (A + B) + C = A + (B + C), (A · B) · C = A · (B · C)
结合律：(A + B) + C = A + (B + C)，(A · B) · C = A · (B · C)
Distributive Law: A · (B + C) = (A · B) + (A · C), A + (B · C) = (A + B) · (A + C)
分配律：A · (B + C) = (A · B) + (A · C)，A + (B · C) = (A + B) · (A + C)
Absorption Law: A + (A · B) = A, A · (A + B) = A
吸收律：A + (A · B) = A，A · (A + B) = A
6. Simplification Techniques | 表达式化简技巧
Exam questions frequently ask you to reduce a Boolean expression to its simplest form using the laws above. Always state which law you are applying at each step.
考试经常要求你利用上述定律将布尔表达式化为最简形式。每一步都要注明你使用了哪条定律。
Example: Simplify F = A · B + A · ¬B.
例：化简 F = A · B + A · ¬B。
Step 1: Factor out A using the Distributive Law: F = A · (B + ¬B).
步骤 1：用分配律提取公因子 A：F = A · (B + ¬B)。
Step 2: Apply the Complement Law: B + ¬B = 1, so F = A · 1.
步骤 2：应用互补律：B + ¬B = 1，于是 F = A · 1。
Step 3: Use the Identity Law: A · 1 = A. Hence, F = A.
步骤 3：利用恒等律：A · 1 = A。因此，F = A。
The circuit that once required two AND gates and one OR gate now reduces to a single wire directly outputting A.
原先需要两个与门和一个或门的电路现在简化为一条直接输出 A 的导线。
When simplifying larger expressions, always look for opportunities to group terms, eliminate complements, and apply absorption and redundancy laws.
化简更复杂的表达式时，要时刻留意能否合并项、消去互补项，并应用吸收律和冗余律。
7. De Morgan’s Laws | 德摩根定理
De Morgan’s laws are among the most frequently tested rules. They show how to break a negation line over an AND or an OR.
德摩根定理是考试中出现频率最高的规则之一，它说明了如何将非号穿过与门或或门。
Published by TutorHao | IB Computer Science Revision Series | aleveler.com更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图