布尔代数完全指南：AQA A-Level计算机科学核心考点解析 | Boolean Algebra: Complete Guide to AQA A-Level Computer Science

布尔代数是A-Level计算机科学（AQA 4.6.5）的重要组成部分，也是历年考试中的高频考点。无论是化简逻辑表达式、设计数字电路，还是理解计算机底层工作原理，布尔代数都是不可或缺的基础知识。本文将系统梳理布尔代数的核心概念、运算规则、恒等式及化简技巧，帮助你在考试中轻松拿下这一模块的分数。

Boolean algebra is a cornerstone of A-Level Computer Science (AQA 4.6.5) and a frequently tested topic in past papers. Whether you are simplifying logic expressions, designing digital circuits, or understanding how computers work at the lowest level, Boolean algebra is an essential foundation. This guide systematically covers the core concepts, operations, identities, and simplification techniques you need to master this module and ace your exams.

一、什么是布尔代数？ / What is Boolean Algebra?

布尔代数是由英国数学家乔治·布尔（George Boole）在19世纪创立的一种代数系统。与普通代数处理数值不同，布尔代数只处理两个值：TRUE（真，1）和FALSE（假，0）。在计算机科学中，布尔代数被广泛应用于逻辑电路设计、编程条件判断、数据库查询以及算法优化等领域。理解布尔代数是迈向数字逻辑和计算机体系结构的第一步。

Boolean algebra is an algebraic system developed by the English mathematician George Boole in the 19th century. Unlike conventional algebra that deals with numerical values, Boolean algebra operates on only two values: TRUE (1) and FALSE (0). In computer science, Boolean algebra is widely applied in logic circuit design, conditional statements in programming, database queries, and algorithm optimization. Mastering Boolean algebra is your first step toward understanding digital logic and computer architecture.

二、布尔表达式的基本表示法 / Basic Notation of Boolean Expressions

在布尔代数中，我们使用特定的符号来表示逻辑运算。以下是考试中常见的三种基本表示法：

In Boolean algebra, specific symbols are used to represent logical operations. Here are the three fundamental notations commonly tested in exams:

1. 变量（Variables）

与普通代数类似，我们使用大写字母 A、B、C 等来表示未知的布尔值。每个变量可以取值为 TRUE (1) 或 FALSE (0)。在考试题目中，你经常会看到如 “Simplify A + A·B” 这样的表达式，其中 A 和 B 就是布尔变量。

Just like in regular algebra, uppercase letters such as A, B, C are used to represent unknown Boolean values. Each variable can be either TRUE (1) or FALSE (0). In exam questions, you will frequently encounter expressions like “Simplify A + A·B”, where A and B are Boolean variables.

2. NOT（非）运算

NOT 运算是最简单的布尔运算，它只有一个输入并输出其相反值。如果 A 是 TRUE，那么 NOT A 就是 FALSE。在布尔代数中，NOT 运算有三种常见记法：

• Ā（在字母上方加横线）— 这是A-Level考试中最常用的记法
• ¬A（前置否定符号）
• A’（在字母右上角加单引号）

考试中绝大多数题目使用上横线记法（Ā），你需要熟练掌握它。注意：当横线覆盖多个变量时，如 A+B 上方有横线，表示对整个 OR 表达式取反。

The NOT operation is the simplest Boolean operation — it takes a single input and outputs its opposite. If A is TRUE, then NOT A is FALSE. In Boolean algebra, NOT is represented in three common ways:

• Ā (overline above the letter) — this is the most common notation in A-Level exams
• ¬A (prefixed negation symbol)
• A’ (prime notation after the letter)

The overline notation (Ā) is used in the vast majority of exam questions — you must be fluent with it. Note: when the overline covers multiple variables, such as an overline above A + B, it means the entire OR expression is negated.

3. AND（与）运算

AND 运算表示逻辑乘法——只有当所有输入都为 TRUE 时，输出才为 TRUE。AND 运算有三种记法：

• A·B（中间加点）— 读作 “A dot B”
• AB（直接并写）— 就像普通代数中乘法省略符号一样
• A ∧ B（逻辑与符号）

在A-Level考试中，最常见的形式是 A·B 和 AB。它们是等价的，可以互换使用。

The AND operation represents logical multiplication — the output is TRUE only when all inputs are TRUE. AND has three notations:

• A·B (with a dot in between) — pronounced “A dot B”
• AB (juxtaposed, no symbol) — just like multiplication in conventional algebra omits the multiplication sign
• A ∧ B (logical AND symbol)

In A-Level exams, the most common forms are A·B and AB. They are equivalent and can be used interchangeably.

4. OR（或）运算

OR 运算表示逻辑加法——只要至少有一个输入为 TRUE，输出就为 TRUE。OR 运算的记法为：

• A + B（加号）— 这是考试中最常用的记法
• A ∨ B（逻辑或符号）

在A-Level考试中，A + B 是标准记法。请注意不要将它与普通算术中的加法混淆——在布尔代数中，1 + 1 = 1（而不是 2），因为 OR 运算在逻辑上仍是 TRUE。

The OR operation represents logical addition — the output is TRUE if at least one input is TRUE. OR notation uses:

• A + B (plus sign) — this is the standard notation in exams
• A ∨ B (logical OR symbol)

In A-Level exams, A + B is the standard notation. Do not confuse it with ordinary arithmetic addition — in Boolean algebra, 1 + 1 = 1 (not 2), because the OR operation logically remains TRUE.

三、运算优先级 / Order of Precedence

就像数学中的 BODMAS（先乘除后加减）规则一样，布尔代数也有严格的运算优先级。在化简复杂表达式时，你必须按照正确的顺序进行操作，否则会得到完全错误的结果。

Just like BODMAS (Brackets, Orders, Division/Multiplication, Addition/Subtraction) in mathematics, Boolean algebra has a strict order of precedence. When simplifying complex expressions, you must follow the correct order, or you will get a completely wrong result.

布尔运算优先级（从高到低）：

1. 括号（Brackets）——最高优先级，括号内的表达式必须先计算
2. NOT（非运算）
3. AND（与运算）
4. OR（或运算）——最低优先级

Boolean precedence (highest to lowest):

1. Brackets — highest priority, expressions inside brackets must be evaluated first
2. NOT
3. AND
4. OR — lowest priority

经典例题：表达式 B + NOT C · A 应该如何计算？按照优先级，NOT 先于 AND，AND 先于 OR，因此实际计算顺序为：B + ((NOT C) · A)。先计算 NOT C，再与 A 做 AND，最后与 B 做 OR。如果你搞错了优先级，可能会错误地将它理解为 (B + NOT C) · A，导致完全不同的结果。

Classic example: how would you evaluate B + NOT C · A? Following the precedence rules, NOT comes before AND, and AND comes before OR, so the actual evaluation order is: B + ((NOT C) · A). First compute NOT C, then AND it with A, and finally OR with B. If you get the precedence wrong, you might mistakenly interpret it as (B + NOT C) · A, leading to a completely different result.

考试技巧：在答题时，强烈建议使用括号来明确你的运算意图，即使括号在技术上是多余的。这能帮助阅卷老师清楚地理解你的化简步骤，也有助于你自己避免优先级错误。

Exam tip: When writing your answers, it is strongly recommended to use brackets to make your evaluation intent explicit, even if the brackets are technically redundant. This helps the examiner clearly follow your simplification steps and helps you avoid precedence errors.

四、布尔恒等式 / Boolean Identities

布尔恒等式是化简布尔表达式的核心工具。这些恒等式就像数学中的乘法口诀表——记住它们，你才能在考试中快速准确地化简复杂表达式。以下是A-Level考试中必须掌握的8条核心恒等式：

Boolean identities are the core tools for simplifying Boolean expressions. Think of them like multiplication tables in mathematics — memorise them, and you will be able to simplify complex expressions quickly and accurately in exams. Here are the 8 essential identities you must master for A-Level:

AND 相关恒等式 / AND-related Identities

• A · 0 = 0（任何值与0做AND运算结果恒为0——因为AND代表乘法，乘以0必得0）
• A · 1 = A（任何值与1做AND运算结果为其本身——1是AND运算的恒等元）
• A · A = A（同一变量与自己做AND运算结果不变——idempotent law / 幂等律）
• A · Ā = 0（一个变量与其NOT值做AND运算恒为0——因为两者不可能同时为TRUE / complement law / 互补律）

English explanation:

• A · 0 = 0 — Anything AND 0 is always 0, because AND represents multiplication and multiplying by zero gives zero.
• A · 1 = A — Anything AND 1 equals itself — 1 is the identity element for the AND operation.
• A · A = A — ANDing a variable with itself yields the same variable. This is the idempotent law — repeating the same input does not change the output.
• A · Ā = 0 — A variable AND its complement is always 0. A and NOT A cannot both be TRUE simultaneously. This is the complement law.

OR 相关恒等式 / OR-related Identities

• A + 0 = A（任何值与0做OR运算结果不变——0是OR运算的恒等元）
• A + 1 = 1（任何值与1做OR运算结果恒为1——因为OR只需要一个输入为TRUE即可输出TRUE）
• A + A = A（同一变量与自己做OR运算结果不变——幂等律）
• A + Ā = 1（一个变量与其NOT值做OR运算恒为1——因为两者之中必有一个为TRUE / 互补律）

English explanation:

• A + 0 = A — Anything OR 0 equals itself — 0 is the identity element for the OR operation.
• A + 1 = 1 — Anything OR 1 is always 1 — because OR requires only one input to be TRUE to output TRUE.
• A + A = A — ORing a variable with itself yields the same variable — the idempotent law for OR.
• A + Ā = 1 — A variable OR its complement is always 1. Either A is TRUE or NOT A is TRUE — one of them must be. This is the complement law.

五、德摩根定律 / De Morgan’s Laws

德摩根定律是布尔代数中最重要、考试频率最高的内容之一。这些定律描述了如何将AND和OR运算互相转换——这对于化简包含NOT的复合表达式至关重要。

De Morgan’s Laws are among the most important and most frequently tested topics in Boolean algebra. These laws describe how to convert between AND and OR operations — absolutely critical for simplifying compound expressions that involve NOT.

第一定律：

A · B 整体取反 = Ā + B̄

即：AND运算取反等于各自取反后的OR。通俗地讲：”如果’两个条件同时满足’这句话是假的，那就意味着至少有一个条件不满足。”

First Law:

NOT (A AND B) = (NOT A) OR (NOT B)

In plain English: if it is NOT true that both A and B are true, then at least one of them must be false. The negation of an AND becomes an OR of negations.

第二定律：

A + B 整体取反 = Ā · B̄

即：OR运算取反等于各自取反后的AND。通俗地讲：”如果’至少有一个条件满足’这句话是假的，那就意味着所有条件都不满足。”

Second Law:

NOT (A OR B) = (NOT A) AND (NOT B)

In plain English: if it is NOT true that at least one of A or B is true, then both must be false. The negation of an OR becomes an AND of negations.

记忆口诀：“断开横线，改变符号”——当你看到表达式上方有一条横线时，把横线”断开”分别放在每个变量上，同时把 AND 变 OR，OR 变 AND。

Memory aid: “Break the bar, change the sign” — when you see an overline covering multiple terms, break it apart and place it over each individual variable, and simultaneously flip AND to OR and OR to AND.

六、化简布尔表达式的实战技巧 / Practical Techniques for Simplifying Boolean Expressions

考试中的化简题通常要求你运用恒等式和德摩根定律逐步简化一个复杂的布尔表达式。以下是标准的解题流程：

Simplification questions in exams typically require you to apply identities and De Morgan’s Laws step by step to reduce a complex Boolean expression. Here is the standard workflow:

步骤 1：消除冗余括号 / Step 1: Remove Redundant Brackets

如果表达式中有不必要的括号（不影响运算顺序的括号），先把它们去掉。例如：(A) + (B) 可以直接写为 A + B。

If the expression contains unnecessary brackets (brackets that do not affect the order of evaluation), remove them first. For example: (A) + (B) can be written directly as A + B.

步骤 2：应用德摩根定律 / Step 2: Apply De Morgan’s Laws

如果表达式中有横线覆盖了复合项（如 A·B 上方有横线 或 A+B 上方有横线），立刻应用德摩根定律将其展开。这是化简的关键第一步。

If the expression has an overline covering compound terms (such as an overline above A·B or above A+B), immediately apply De Morgan’s Laws to expand them. This is the critical first step in simplification.

步骤 3：使用恒等式化简 / Step 3: Simplify Using Identities

应用布尔恒等式（A·0=0, A·1=A, A+A=A, 吸收律等）来逐步减少表达式中的项数和变量数。常见的化简模式包括：

• A + A·B → A（吸收律）
• A·(A + B) → A （吸收律）
• A·B + A·B̄ → A·(B + B̄) → A·1 → A（提取公因式+互补律）
• (A + B)·(A + B̄) → A + B·B̄ → A + 0 → A（分配律+互补律）

Common simplification patterns:

• A + A·B → A (absorption law — B is redundant when A is TRUE)
• A·(A + B) → A (dual absorption)
• A·B + A·B̄ → A·(B + B̄) → A·1 → A (factor out A, then complement law B + B̄ = 1)
• (A + B)·(A + B̄) → A + B·B̄ → A + 0 → A (distributive law + complement law)

步骤 4：重复直至最简 / Step 4: Repeat Until Minimal

化简是一个迭代过程。每次应用一个定律后，检查是否出现了新的化简机会。不断重复步骤2和3，直到表达式无法进一步简化。

Simplification is an iterative process. After applying each law, check whether new simplification opportunities have emerged. Repeat steps 2 and 3 until the expression cannot be reduced further.

关键考试注意事项：

• 每一步都要写清楚你应用了哪个定律——这在A-Level考试中是得分的关键
• 使用真值表可以验证你的化简结果是否与原表达式等价
• 化简后的表达式通常含更少的运算符和变量——如果你化简后反而更复杂了，那很可能某一步做错了

Key exam tips:

• At each step, clearly state which law you applied — this is essential for scoring marks in A-Level exams
• Use a truth table to verify that your simplified expression is equivalent to the original
• A simplified expression should typically have fewer operators and variables — if your result is more complex than the original, you have likely made a mistake somewhere

七、学习建议与备考策略 / Study Tips and Exam Strategies

布尔代数虽然概念并不复杂，但在考试中要做得又快又准，需要大量的刻意练习。以下是几条实用的备考建议：

While the concepts of Boolean algebra are not inherently complex, achieving both speed and accuracy in exams requires substantial deliberate practice. Here are practical preparation tips:

1. 熟记8条核心恒等式 / Memorise the 8 Core Identities

把A·0=0, A·1=A, A·A=A, A·Ā=0, A+0=A, A+1=1, A+A=A, A+Ā=1 这8条恒等式背得滚瓜烂熟。它们是所有化简操作的基石，就像数学中的乘法口诀一样基础。

Drill the eight core identities — A·0=0, A·1=A, A·A=A, A·Ā=0, A+0=A, A+1=1, A+A=A, A+Ā=1 — until they become second nature. These are the building blocks of all simplification operations, as fundamental as multiplication tables in mathematics.

2. 大量练习历年真题 / Practise Extensively with Past Papers

布尔代数化简题在AQA历年考试中反复出现。通过刷历年真题，你可以熟悉常见的题型和化简模式，培养”一眼看出化简路径”的直觉。建议至少完成近5年的所有相关真题。

Boolean algebra simplification questions appear repeatedly in AQA past papers. By working through past exam questions, you will become familiar with common question types and simplification patterns, developing the intuition to “spot the simplification path at a glance.” Aim to complete all relevant questions from at least the last 5 years.

3. 掌握真值表验证法 / Master Truth Table Verification

当你化简完一个表达式后，花30秒用真值表检验一下原表达式和化简后表达式的输出是否完全一致。如果发现不一致，说明你的化简过程有误——这在考试中可以帮你及时发现并纠正错误，避免整题失分。

After simplifying an expression, spend 30 seconds using a truth table to verify that the original and simplified expressions produce identical outputs. If they do not match, your simplification contains an error — catching this in the exam can save you from losing all marks on a question.

4. 理解而非死记 / Understand, Do Not Just Memorise

虽然恒等式需要记忆，但更重要的是理解每条定律背后的逻辑。例如，A + A·B = A 之所以成立，是因为如果A为真，表达式自动为真；如果A为假，A·B也为假。当你真正理解了逻辑，即使考试时一时忘记公式，也能推导出来。

While identities do require memorisation, understanding the logic behind each law is far more important. For example, A + A·B = A holds because if A is TRUE, the expression is automatically TRUE; if A is FALSE, A·B is also FALSE. When you truly understand the logic, you can derive the formulas even if you momentarily forget them in the exam.

八、总结 / Summary

布尔代数是A-Level计算机科学的基础模块，也是后续学习数字逻辑、编程和计算机体系结构的重要铺垫。掌握本文涵盖的核心知识点——基本表示法、运算优先级、8条恒等式和德摩根定律——你就已经具备了应对AQA考试中所有布尔代数题目的能力。

Boolean algebra is a foundational module in A-Level Computer Science and a vital stepping stone toward digital logic, programming, and computer architecture. By mastering the core concepts covered in this guide — basic notation, order of precedence, the eight identities, and De Morgan’s Laws — you will be fully equipped to tackle any Boolean algebra question in the AQA exam.

祝你考试顺利！

Good luck with your exams!

📞 16621398022（同微信）| 需要更多A-Level学习资料？欢迎联系我们！

📞 16621398022 (also WeChat) | Need more A-Level study resources? Get in touch!

🔗 www.tutorhao.com | www.alevelorg.com | www.qyconsult.com