📚 Boolean Algebra for IB AQA Computer Science | IB AQA 计算机：布尔代数 考点精讲
Boolean algebra is the mathematical foundation of all digital systems, from the simplest logic gate to the most complex processor. For IB and AQA Computer Science, mastering Boolean algebra means understanding how to express, simplify, and implement logical functions using only two states – true and false. This guide walks you through every key concept: variables, operators, truth tables, laws, Karnaugh maps, logic gates, combinational circuits, and exam-ready problem-solving strategies. Each explanation is paired with its Chinese translation to support bilingual learners and ensure deep understanding.
布尔代数是所有数字系统的数学基础，从最简单的逻辑门到最复杂的处理器。对于 IB 和 AQA 计算机科学，掌握布尔代数意味着你要理解如何用只有两个状态（真和假）来表达、化简和实现逻辑功能。本指南带你逐一攻克每个核心概念：变量、运算符、真值表、定律、卡诺图、逻辑门、组合逻辑电路，以及针对考试的解题策略。每段英文讲解都配有中文翻译，以支持双语学习，确保透彻理解。
1. Introduction to Boolean Algebra | 布尔代数简介
Boolean algebra is a branch of mathematics that deals with binary variables and logical operations. It was introduced by George Boole in the 19th century and later became the backbone of digital electronics. In computer science, Boolean algebra allows us to model circuits, construct algorithms, and reason about conditions using only two values: 1 (true) and 0 (false).
布尔代数是数学的一个分支，处理二进制变量和逻辑运算。它由乔治·布尔在 19 世纪提出，后来成为数字电子学的支柱。在计算机科学中，布尔代数让我们能够仅用两个值 1（真）和 0（假）来构建电路模型、设计算法并推理条件。
Every digital system, from a simple calculator to a server, is built upon Boolean logic. Understanding its principles is essential for AQA and IB exam success, as questions regularly test the ability to simplify expressions, draw logic circuits, and apply laws.
每个数字系统，从简单的计算器到服务器，都建立在布尔逻辑之上。理解其原理对 AQA 和 IB 考试成功至关重要，因为试题经常考察化简表达式、绘制逻辑电路和应用定律的能力。
2. Boolean Variables and Values | 布尔变量与值
A Boolean variable can only take one of two possible values: true (1) or false (0). In logic expressions we often use letters such as A, B, C to represent these variables. The state ‘1’ typically indicates a high voltage or a true condition, while ‘0’ represents a low voltage or a false condition.
布尔变量只能取两个可能值之一：真（1）或假（0）。在逻辑表达式中我们常用字母 A、B、C 来表示这些变量。状态 ‘1’ 通常表示高电平或真条件，而 ‘0’ 表示低电平或假条件。
It is crucial to remember that Boolean algebra does not recognise any other number; it is a two-valued system. Exams often test this by asking you to complete truth tables or evaluate expressions where you must substitute 0s and 1s correctly.
必须记住，布尔代数不识别其他任何数字；它是一个双值系统。考试常通过让你填写真值表或求值表达式来考查这一点，此时你必须正确代入 0 和 1。
3. Basic Boolean Operations: AND, OR, NOT | 基本布尔运算：与、或、非
The three fundamental operations of Boolean algebra are AND, OR, and NOT. Every complex logic function can be built from these primitives. The AND operation (conjunction) is typically represented by a dot (·) or ∧. It outputs 1 only when all inputs are 1.
布尔代数的三个基本运算是与 (AND)、或 (OR) 和非 (NOT)。每一个复杂逻辑函数都可以由这些基本运算构建。与运算（合取）通常用点 (·) 或 ∧ 表示。仅当所有输入都为 1 时，它才输出 1。
For example, if A = 1 and B = 1, then A·B = 1; otherwise the result is 0. The truth table for AND is:
例如，若 A = 1 且 B = 1，则 A·B = 1；否则结果为 0。与运算的真值表如下：
| A | B | A · B |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
与运算真值表显示，只有当 A 和 B 都是 1 时输出才是 1。
The OR operation (disjunction) is denoted by a plus (+) or ∨. It outputs 1 if at least one input is 1.
或运算（析取）用加号 (+) 或 ∨ 表示。只要至少有一个输入为 1，它就输出 1。
| A | B | A + B |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 1 |
或运算真值表表明，只要 A 或 B 中有一个是 1，输出就是 1。
The NOT operation (negation) is a unary operator, shown by a prime (′), overbar (ˉ), or ¬. It inverts the input: if A = 0, then A′ = 1.
非运算（否定）是一个一元运算符，用撇号 (′)、上划线 (ˉ) 或 ¬ 表示。它反转输入：如果 A = 0，那么 A′ = 1。
| A | A′ |
|---|---|
| 0 | 1 |
| 1 | 0 |
非运算真值表很简单：输出总是与输入相反。
4. Truth Tables | 真值表
A truth table lists every possible combination of input values for a Boolean expression, together with the corresponding output. For n input variables there are 2ⁿ rows. They are an essential tool for analysing, comparing, and simplifying logical functions.
真值表列出了布尔表达式所有可能的输入组合以及对应的输出。对于 n 个输入变量，共有 2ⁿ 行。真值表是分析、比较和化简逻辑函数的基本工具。
To construct a truth table, write all combinations of 0s and 1s for the inputs in binary counting order. Then evaluate the expression step by step, adding intermediate columns if needed. For example, the expression (A + B) · C′ with three variables yields:
要构建真值表，按二进制计数顺序写出所有 0 和 1 的输入组合。然后逐步求值表达式，需要时可添加中间列。例如，三变量表达式 (A + B) · C′ 的真值表为：
| A | B | C | C′ | A+B | (A+B)·C′ |
|---|---|---|---|---|---|
| 0 | 0 | 0 | 1 | 0 | 0 |
| 0 | 0 | 1 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 | 1 | 1 |
| 0 | 1 | 1 | 0 | 1 | 0 |
| 1 | 0 | 0 | 1 | 1 | 1 |
| 1 | 0 | 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 | 1 | 1 |
| 1 | 1 | 1 | 0 | 1 | 0 |
在考试中，真值表经常用来证明两个表达式是否等价，或用来推导出更简单的形式。
5. Boolean Expressions and Evaluation | 布尔表达式与求值
A Boolean expression combines variables with AND, OR, NOT, and parentheses to define a logic function. The order of evaluation follows the precedence: NOT first, then AND, then OR – unless parentheses dictate otherwise. This is similar to arithmetic precedence.
布尔表达式将变量与 AND、OR、NOT 以及括号组合起来定义一个逻辑函数。求值顺序遵循优先级：非最高，然后与，最后或——除非括号另有规定。这类似于算术优先级。
For instance, the expression A + B · C means A OR (B AND C), not (A OR B) AND C. Always use parentheses to remove ambiguity, and practice breaking down complex expressions into smaller parts when constructing truth tables.
例如，表达式 A + B · C 表示 A 或 (B 与 C)，而不是 (A 或 B) 与 C。始终使用括号来消除歧义，并在构建真值表时练习将复杂表达式分解为更小的部分。
Substituting values: if A=1, B=0, C=1, then A + B · C = 1 + (0·1) = 1 + 0 = 1. Being systematic prevents careless errors in exams.
代入值：若 A=1, B=0, C=1，则 A + B · C = 1 + (0·1) = 1 + 0 = 1。有条理地求值可以防止考试中的粗心错误。
6. Laws of Boolean Algebra | 布尔代数定律
Boolean algebra is governed by a set of laws that allow us to manipulate and simplify expressions without changing their function. The most important ones are:
布尔代数受一组定律支配，这些定律允许我们在不改变函数的前提下操作和简化表达式。最重要的定律有：
Identity Law: A + 0 = A and A · 1 = A
同一律： A + 0 = A，A · 1 = A
Null Law: A + 1 = 1 and A · 0 = 0
零一律： A + 1 = 1，A · 0 = 0
Idempotent Law: A + A = A and A · A = A
幂等律： A + A = A，A · A = A
Complement Law: A + A′ = 1 and A · A′ = 0
补律： A + A′ = 1，A · A′ = 0
Commutative Law: A + B = B + A and A · B = B · A
交换律： A + B = B + A，A · B = B · A
Associative Law: A + (B + C) = (A + B) + C and 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 and 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 and A·(A+B) = A
吸收律： A + A·B = A，A·(A+B) = A
These laws are your toolkit for simplifying logic circuits and solving exam problems efficiently.
这些定律是你化简逻辑电路和高效解决考试题目的工具箱。
7. De Morgan’s Laws | 德摩根定律
De Morgan’s laws describe how to distribute negation over AND and OR. They are vital for converting expressions between sum-of-products and product-of-sums forms, and for implementing circuits with only NAND or NOR gates.
德摩根定律描述了如何将否定分配到与和或上。它们对于在和之积与积之和形式之间转换表达式，以及仅用与非门或或非门实现电路至关重要。
The two laws are:
(A · B)′ = A′ + B′
(A + B)′ = A′ · B′
两条定律为：
(A · B)′ = A′ + B′
(A + B)′ = A′ · B′
To apply De Morgan: break the negation bar, change the operator (AND becomes OR, OR becomes AND), and negate each variable. For example, (A·B + C)′ becomes (A·B)′ · C′ = (A′+B′) · C′.
应用德摩根定律：断开否定杠，变换运算符（与变或，或变与），并对每个变量取反。例如，(A·B + C)′ 变成 (A·B)′ · C′ = (A′+B′) · C′。
Common exam question: ‘Simplify the expression (A′ + B)′ using De Morgan’s law.’ Answer: A · B′.
常见考题：’用德摩根定律化简表达式 (A′ + B)′。’ 答案：A · B′。
8. Simplifying Boolean Expressions | 布尔表达式化简
Simplifying Boolean expressions reduces the number of logic gates needed in a circuit, saving cost and power. The two main methods are algebraic manipulation using the laws, and graphical methods like Karnaugh maps.
化简布尔表达式可以减少电路中所需的逻辑门数量，从而节省成本和功耗。两种主要方法是使用定律进行代数操作，以及像卡诺图这样的图形化方法。
Example: simplify A·B + A·B′. Using the distributive law, factor out A: A·(B + B′) = A·1 = A. So a circuit with two AND gates and one OR can be replaced by a single wire. Always double-check with a truth table if time permits.
例：化简 A·B + A·B′。使用分配律，提取 A：A·(B + B′) = A·1 = A。因此，一个带两个与门和一个或门的电路可以被单根导线替代。如果时间允许，始终用真值表复核。
Another common technique is to add redundant terms using the rule A = A + A or multiply by (A+A′)=1 to enable further simplification. Practice is essential to spot patterns quickly.
另一个常用技巧是利用 A = A + A 或乘以 (A+A′)=1 的规则添加冗余项来实现进一步化简。练习对于快速识别模式至关重要。
9. Karnaugh Maps (K-Maps) | 卡诺图
A Karnaugh map is a visual method for simplifying Boolean expressions of up to four variables (or more with care). It rearranges truth table rows into a grid so that adjacent cells differ by only one variable, making it easy to spot and eliminate redundant variables.
卡诺图是一种图形化简法，最多可处理四个变量（仔细操作也可处理更多）。它将真值表的行重新排列成网格，使相邻单元格仅有一个变量不同，从而容易发现并消去冗余变量。
For a 2-variable map with inputs A, B, the four cells represent A′B′, A′B, AB′, AB. After populating with 1s from the truth table, groups of 1, 2, or 4 cells are circled (powers of two). Each group yields a product term with the variable that stays constant.
对于输入为 A、B 的二变量卡诺图，四个单元格分别代表 A′B′、A′B、AB′、AB。在填入真值表中的 1 之后，圈出大小为 1、2 或 4 的 1 格子组（2 的幂）。每组给出一个乘积项，其中包含保持不变的变量。
For 3-variable and 4-variable maps, wrapping around edges is allowed. The goal is to cover all 1s with the fewest, largest possible groups to obtain the minimal sum of products. This is a heavily tested skill on AQA papers.
对于三变量和四变量卡诺图，允许跨边环绕。目标是用最少、最大的可能组覆盖所有 1，以获得最简的积之和式。这是 AQA 试卷中反复考查的技能。
Example: a 3-variable map with 1s at cells 000, 001, 100, 101 can be grouped as A′B′C′+A′B′C and AB′C′+AB′C, which simplify to B′. Always state the simplified expression clearly.
例：一个三变量卡诺图，在 000、001、100、101 位置为 1，可圈组为 A′B′C′+A′B′C 和 AB′C′+AB′C，化简后为 B′。务必清晰写出化简后的表达式。
10. Logic Gates
Published by TutorHao | IB Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导