Boolean Algebra Key Concepts for A-Level Computer Science | A-Level 计算机：布尔代数考点精讲

📚 Boolean Algebra Key Concepts for A-Level Computer Science | A-Level 计算机：布尔代数考点精讲

Boolean Algebra is a branch of mathematics that deals with binary variables and logical operations. It forms the foundation for designing and analysing digital circuits, from simple logic gates to complex processors. In A-Level Computer Science, you will be expected to apply Boolean laws, simplify logic expressions using algebraic methods and Karnaugh maps, and interpret truth tables. This article provides a concise yet comprehensive revision of the key concepts and exam techniques you need to master.

布尔代数是处理二进制变量与逻辑运算的数学分支，它为数字电路的设计与分析（从简单的逻辑门到复杂的处理器）奠定了基础。在 A-Level 计算机课程中，你需要熟练应用布尔定律，使用代数方法和卡诺图简化逻辑表达式，并能解读真值表。本文提供了一份简明而全面的考点精讲，帮助你掌握核心概念与应试技巧。

1. Binary Logic and the Three Fundamental Operations | 二进制逻辑与三种基本运算

Boolean algebra operates on variables that can only be 0 (FALSE) or 1 (TRUE). The three fundamental operations are AND, OR, and NOT. AND is often represented by a dot (·) or simply by concatenation; OR is represented by a plus sign (+); and NOT is denoted by an overbar, a prime (′), or the symbol ¬. Every digital circuit can be built using combinations of these basic operations.

布尔代数中的变量只能取值 0 (假) 或 1 (真)。三种基本运算为：与（AND）、或（OR）、非（NOT）。AND 常用点号 (·) 或直接连接表示，OR 用加号 (+) 表示，NOT 常以上划线、撇号 (′) 或符号 ¬ 表示。任何数字电路都可以由这些基本运算组合而成。

For two inputs A and B, the AND operation A · B is true only when both A and B are true. The OR operation A + B is true if at least one input is true. The NOT operation ¬A inverts the value: if A is 1, ¬A is 0, and vice versa.

对于两个输入 A 和 B，与运算 A · B 只有当 A 和 B 同时为真时才为真。或运算 A + B 只要至少一个输入为真即为真。非运算 ¬A 则将值取反：若 A 为 1，则 ¬A 为 0，反之亦然。

2. Logic Gates and Truth Tables | 逻辑门与真值表

A truth table lists all possible input combinations and the corresponding output for a logic function. For two inputs, there are 2² = 4 rows; for three inputs, 2³ = 8 rows. You must be able to construct a truth table for a given Boolean expression and vice versa.

真值表列出了逻辑函数所有可能的输入组合及其对应输出。两个输入时有 2² = 4 行，三个输入时有 2³ = 8 行。你必须能够根据给定的布尔表达式画出真值表，或者从真值表写出表达式。

Standard logic gates include AND, OR, NOT, NAND, NOR, XOR, and XNOR. NAND and NOR are particularly important because they are functionally complete: any Boolean function can be implemented using only NAND gates or only NOR gates.

标准逻辑门包括与门、或门、非门、与非门、或非门、异或门和同或门。与非门和或非门尤其重要，因为它们具有功能完备性：任何布尔函数都可以仅用与非门或仅用或非门来实现。

Gate	Symbol (A,B inputs)	Output
AND	A · B	1 only if A=1 and B=1
OR	A + B	1 if any input is 1
NOT	¬A	inverts A
NAND	¬(A · B)	0 only if both 1
NOR	¬(A + B)	1 only if both 0
XOR	A ⊕ B	1 when inputs differ
XNOR	A ⊙ B	1 when inputs are identical

对于给定的布尔表达式，你需要能够为其构建真值表，反之亦然。

3. Boolean Expressions and Notation | 布尔表达式与记法

Boolean expressions combine variables and operators according to the rules of Boolean algebra. The order of precedence is crucial: NOT operations are evaluated first, then AND, then OR. Use parentheses to override the default precedence. For example, in A + B · C, the AND is performed before the OR.

布尔表达式根据布尔代数规则组合变量与运算符。运算优先级至关重要：先进行非运算，然后是与运算，最后是或运算。可以使用括号改变默认优先级。例如，在 A + B · C 中，与运算先于或运算执行。

A common notation in A-Level exams uses the prime symbol: A′ for NOT A, and the dot and plus as described. You may also see the overbar, e.g., A̅. Regardless of the notation, always convert expressions carefully when simplifying.

A-Level 考试中常用撇号表示非运算，如 A′ 表示 NOT A，并用点号与加号表示与和或。你也可能遇到上划线的记法，如 A̅。无论采用何种记法，在化简时务必小心转换。

4. Laws of Boolean Algebra | 布尔代数的基本定律

Boolean algebra obeys a set of laws that allow manipulation and simplification of logic expressions. The principal laws are:

布尔代数遵循一系列定律，可用于操作和简化逻辑表达式。主要定律如下：

Identity: A + 0 = A, A · 1 = A
Null (Annulment): A + 1 = 1, A · 0 = 0
Idempotent: A + A = A, A · A = A
Complement: A + ¬A = 1, A · ¬A = 0
Double Negation: ¬(¬A) = A
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)
Absorption: A + A · B = A, A · (A + B) = A

同一律：A + 0 = A，A · 1 = A
零律（湮灭律）：A + 1 = 1，A · 0 = 0
幂等律：A + A = A，A · A = A
互补律：A + ¬A = 1，A · ¬A = 0
双重否定律：¬(¬A) = A
交换律：A + B = B + A，A · B = B · A
结合律：(A + B) + C = A + (B + C)，(A · B) · C = A · (B · C)
分配律：A · (B + C) = A · B + A · C，A + (B · C) = (A + B) · (A + C)
吸收律：A + A · B = A，A · (A + B) = A

You must memorise these laws and be able to apply them in algebraic simplification. Pay special attention to the second distributive law, as it has no counterpart in ordinary algebra.

你必须熟记这些定律，并能在代数化简中加以应用。特别要注意第二个分配律，因为它在普通代数中没有对应法则。

5. De Morgan’s Theorems | 德摩根定理

De Morgan’s theorems are essential for transforming expressions, particularly when moving between AND/OR logic and NAND/NOR implementations. They state:

德摩根定理对于表达式的变换至关重要，尤其是在与/或逻辑和与非/或非实现之间转换时。定理表述如下：

¬(A · B) = ¬A + ¬B

¬(A + B) = ¬A · ¬B

In words: the complement of a product is the sum of the complements, and the complement of a sum is the product of the complements. These theorems can be extended to any number of variables.

用语言表述：积的补等于补的和；和的补等于补的积。这些定理可推广至任意多个变量。

Exam questions frequently ask you to use De Morgan’s laws to convert a circuit made of AND and OR gates into one using only NAND gates, or to simplify a negated expression. Always break the negation line step by step and change the operator.

考试中常要求利用德摩根定律，将由与门和或门构成的电路转换为仅使用与非门的电路，或者简化带有否定号的表达式。务必逐步拆分非号，并随之改变运算符。

6. Algebraic Simplification of Boolean Expressions | 布尔表达式的代数化简

Simplifying a Boolean expression reduces the number of gates and inputs needed in a logic circuit. Use the laws of Boolean algebra systematically. A typical approach is to expand terms, apply absorption and complement laws, and then look for common factors.

化简布尔表达式能够减少逻辑电路中所需门电路的数量与输入端数目。你需要系统地运用布尔代数定律。典型方法是先展开各项，应用吸收律和互补律，再提取公因子。

Example: Simplify F = A · B + A · ¬B. Factor out A: A · (B + ¬B) = A · 1 = A. Thus, the expression reduces to A, removing one AND gate and one NOT gate.

示例：化简 F = A · B + A · ¬B。提取公因子 A：A · (B + ¬B) = A · 1 = A。因此该表达式化简为 A，省去一个与门和一个非门。

Always check your simplified expression against the original truth table to ensure equivalence. This is a common verification technique in exams.

务必用原表达式对应的真值表验证化简结果是否等价。这是考试中常用的检查方法。

7. Introduction to Karnaugh Maps (K-maps) | 卡诺图简介

Karnaugh maps provide a visual method for simplifying Boolean expressions of up to four variables (in A-Level). A K-map is a grid where each cell represents a minterm and cells are arranged so that adjacent cells differ by only one variable.

卡诺图提供了一种用于化简最多四个变量（A-Level 范围）的布尔表达式的图形化方法。K-图是一个网格，每个单元格代表一个最小项，单元格的排列使得相邻单元格之间仅有一个变量不同。

A 2-variable K-map has 4 cells; a 3-variable K-map has 8 cells arranged in a 2×4 grid; a 4-variable K-map has 16 cells in a 4×4 grid. The row and column headers follow a Gray code sequence (00, 01, 11, 10) so that adjacency wraps around the edges.

二变量卡诺图有 4 个单元格；三变量卡诺图有 8 个单元格，布置为 2×4 网格；四变量卡诺图有 16 个单元格，为 4×4 网格。行列标头按格雷码顺序（00, 01, 11, 10）排列，因此相邻性包含边界环绕。

8. Simplifying SOP Expressions Using K-maps | 用卡诺图化简与或表达式

To simplify a sum-of-products (SOP) expression, fill the K-map with 1s corresponding to each minterm in the expression. Group the 1s into the largest possible rectangles of size 1, 2, 4, 8, etc. (powers of 2). Each group must be rectangular, and groups can overlap. Every 1 must be covered by at least one group.

要化简与或表达式 (SOP)，需将与表达式中每个最小项对应的卡诺图单元格填入 1。将 1 聚合成尽可能大的矩形（大小须为 1, 2, 4, 8 等 2 的幂）。每个组必须呈矩形，组之间可以重叠。每一个 1 至少要被一个组覆盖。

For each group, write a product term that includes only the variables that remain constant within the group. The simplified expression is the OR of all such product terms. Don’t forget to include don’t-care conditions (usually marked with X) if they help form larger groups.

对每一个组，写出一个乘积项，该乘积项仅包含在此组内保持不变的变量。简化后的表达式即为所有这些乘积项的逻辑或。若有无关项（常用 X 标记），若有助于组成更大的组，也应加以利用。

9. XOR and XNOR Functions | 异或与同或函数

The Exclusive OR (XOR) function is true when an odd number of inputs are true. For two inputs, A ⊕ B = A · ¬B + ¬A · B. The Exclusive NOR (XNOR) is the complement of XOR: A ⊙ B = ¬(A ⊕ B) = A · B + ¬A · ¬B.

异或（XOR）函数在输入中真值个数为奇数时输出真。对于两个输入，A ⊕ B = A · ¬B + ¬A · B。同或（XNOR）为异或的补：A ⊙ B = ¬(A ⊕ B) = A · B + ¬A · ¬B。

XOR gates are widely used in parity generation and checking, arithmetic circuits (half adder: Sum = A ⊕ B, Carry = A · B), and comparators. You should be able to recognise the XOR pattern in K-maps as a checkerboard configuration.

异或门广泛用于奇偶校验生成与检查、算术电路（半加器：和 S = A ⊕ B，进位 C = A · B）以及比较器中。你应能识别卡诺图中异或呈现出的棋盘状模式。

10. From Truth Table to Boolean Expression | 由真值表得出布尔表达式

Given a truth table, you can derive the SOP expression by summing the minterms where the output is 1. Each minterm is a product term containing all input variables in true or complemented form. For example, if F = 1 when A=0, B=1, C=1, the corresponding minterm is ¬A · B · C.

给定真值表，可通过将输出为 1 的那些最小项相加（或运算）来得到 SOP 表达式。每个最小项都是一个包含所有输入变量原值或补码形式的乘积项。例如，若当 A=0, B=1, C=1 时 F = 1，对应的最小项为 ¬A · B · C。

Alternatively, you can produce a Product-of-Sums (POS) expression by considering the rows where output is 0. In A-Level exam questions, SOP is more common and is the natural input for K-map simplification.

另一种方法是考虑输出为 0 的行，从而得到或与表达式 (POS)。在 A-Level 考题中，SOP 形式更常见，同时也是卡诺图化简的自然输入形式。

11. Implementing Logic Circuits | 逻辑电路实现

After simplifying a Boolean expression, you will often need to draw the corresponding logic circuit diagram using standard gate symbols. Start from the output and work backwards, inserting the appropriate gates for each operation. Use systematic labelling to avoid mistakes.

在简化布尔表达式后，你通常需要画出相应的逻辑电路图，使用标准门符号。可从输出端开始，逆向插入对应于每个运算的门电路。系统性地标注有助于避免错误。

If the question restricts you to NAND-only or NOR-only implementations, apply De Morgan’s theorem to convert AND-OR circuits into the required form. For NAND-only, replace each gate with its NAND equivalent and add inverters where needed, then simplify by cancelling double inversions.

若题目限制只能使用与非门或或非门，则应用德摩根定理将与或电路转换为所需形式。对于仅用与非门的情况，可把每个门替换为与非等价的组合，并在需要之处添加反相器，然后通过消去双重反相来简化。

12. Exam Tips and Common Pitfalls | 考试技巧与常见误区

When simplifying using Boolean algebra, keep your work tidy and state the law used at each step. This earns method marks even if the final answer is incorrect. With K-maps, always check that your groupings are rectangular and as large as possible.

使用布尔代数化简时，保持卷面整洁，并注明每一步所使用的定律。这样即使最终答案有误，也能获得过程分。对于卡诺图，务必检查分组是否呈矩形且尽可能大。

Be careful with De Morgan’s theorem when brackets are involved: negating an entire bracketed expression flips the operator inside and negates each term. Double negation mistakes and missing parentheses are the most common errors.

在处理带有括号的表达式时，要小心使用德摩根定理：对整个括号取非会翻转内部的运算符并否定每一项。双重否定错误和遗漏括号是最常见的失分点。

Finally, practise deriving the expression from a word problem, constructing the truth table, simplifying with K-map, and drawing the final circuit. This integrated process is a standard A-Level exam structure.

最后，练习从文字描述问题出发，推导出表达式、构建真值表、用卡诺图化简、再画出最终电路。这一综合流程是 A-Level 考试中常见的题型。

Published by TutorHao | Computer Science Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）

Boolean Algebra Key Concepts for A-Level Computer Science | A-Level 计算机：布尔代数 考点精讲