📚 Boolean Logic | 布尔逻辑
Boolean logic is a fundamental concept in digital electronics and computer science, dealing with true or false values and a set of operations for combining them. It forms the backbone of modern digital circuits, from simple switches to complex processors, and is essential for understanding how computers make decisions.
布尔逻辑是数字电子学和计算机科学中的基本概念，处理真与假这两种值以及一套组合它们的运算。它构成了现代数字电路的基础，从简单的开关到复杂的处理器都离不开它，对于理解计算机如何做出决策至关重要。
1. What is Boolean Logic? | 什么是布尔逻辑？
Boolean logic is a binary system invented by George Boole in the 19th century. It operates on two possible states: 1 (true, high, on) and 0 (false, low, off). Every logical expression can be reduced to a combination of these two values using logical operators.
布尔逻辑是由乔治·布尔在19世纪发明的二进制系统。它只有两种可能的状态：1（真、高电平、开）和0（假、低电平、关）。任何逻辑表达式都可以通过逻辑运算符简化为这两种值的组合。
2. Basic Logic Gates: AND, OR, NOT | 基本逻辑门：与门、或门、非门
The building blocks of Boolean logic are logic gates. The three simplest gates are NOT, AND, and OR. Each gate takes one or more inputs and produces a single output based on a fixed rule.
布尔逻辑的基本构件是逻辑门。三个最简单的门是非门、与门和或门。每个门接收一个或多个输入，并根据固定规则产生一个输出。
3. Truth Tables | 真值表
A truth table lists all possible input combinations to a logic gate and the resulting outputs. It is the standard way to describe gate behaviour. For n inputs, there are 2ⁿ rows in the table.
真值表列出了逻辑门所有可能的输入组合及其对应的输出，是描述门行为的标准方式。对于 n 个输入，真值表有 2ⁿ 行。
4. The NOT Gate | 非门
e input. If the input is 1, the output is 0, and vice versa. Its Boolean expression is Q = ¬A.
非门也称为反相器，有一个输入和一个输出。输出与输入相反：输入为1则输出0，反之亦然。其布尔表达式为 Q = ¬A。
| Input A | Output Q = ¬A |
|---|---|
| 0 | 1 |
| 1 | 0 |
5. The AND Gate | 与门
An AND gate outputs 1 only if all its inputs are 1. For a two-input AND gate, Q = A ∧ B. It corresponds to the logical conjunction operation.
与门仅在所有输入都为1时才输出1。对于双输入与门，Q = A ∧ B。它对应逻辑与运算。
| A | B | Q = A ∧ B |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
6. The OR Gate | 或门
An OR gate outputs 1 if at least one input is 1. For a two-input OR gate, Q = A ∨ B. It represents the logical disjunction operation.
或门只要至少一个输入为1就输出1。对于双输入或门，Q = A ∨ B。它代表逻辑或运算。
| A | B | Q = A ∨ B |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 1 |
7. Combining Logic Gates | 组合逻辑门
Multiple logic gates can be connected together to perform more complex operations. The output of one gate becomes the input to another. By combining basic gates, you can create any Boolean function.
多个逻辑门可以连接起来执行更复杂的操作。一个门的输出会成为另一个门的输入。通过组合基本门，你可以创造出任何布尔函数。
For example, Q = ¬(A ∧ bination has three gate operations: first the AND of A and B, then the NOT of that result.
例如，Q = ¬(A ∧ B) 使用了一个与门后接一个非门。这个组合的真值表涉及三次门运算：先算A和B的与，再对结果取反。
8. NAND and NOR Gates | 与非门和或非门
e is an AND gate followed by a NOT gate. Its output is the negation of the AND output: Q = ¬(A ∧ B). A NOR gate is an OR gate followed by a NOT: Q = ¬(A ∨ iversal gates because any other gate can be built using only NAND gates or only NOR gates.
与非门是与门后接非门，其输出是与运算的否定：Q = ¬(A ∧ B)。或非门是或门后接非门：Q = ¬(A ∨ B)。两者都被称为通用门，因为只用与非门或只用或非门就可以构建出任何其他门。
| A | B | NAND Q | NOR Q |
|---|---|---|---|
| 0 | 0 | 1 | 1 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 0 |
9. XOR Gate | 异或门
OR (exclusive OR) gate outputs 1 only when the inputs are different. For two inputs, Q = A ⊕ B. The truth table shows output is 1 when exactly one input is 1, and 0 otherwise.
异或门（XOR）仅在输入不同时输出1。对于双输入，Q = A ⊕ B。真值表显示当恰好一个输入为1时输出为1，否则为0。
| A | B | Q = A ⊕ B |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 0 |
10. Boolean Expressions and Simplification | 布尔表达式与化简
e keeping the same function. Common methods include applying Boolean identities, such as A ∧ (A ∨ B) = A and A ∨ (¬A ∧ B) = A ∨ B.
布尔表达式用变量、运算符和括号描述逻辑电路。化简可以减少门的数量同时保持相同的功能。常用方法包括应用布尔恒等式，例如 A ∧ (A ∨ B) = A 以及 A ∨ (¬A ∧ B) = A ∨ B。
Simplifying Boolean expressions saves cost and power in digital circuits. Karnaugh maps (K-maps) are a graphical tool used at advanced levels for simplification, but at IGCSE level you can often simplify using truth tables and basic identities.
化简布尔表达式可以节省数字电路的成本和功耗。卡诺图（K-map）是高级阶段使用的图形化化简工具，但在IGCSE阶段，你通常可以利用真值表和基本恒等式进行化简。
11. De Morgan's Laws | 德摩根定律
De Morgan' Laws are essential for converting between AND and OR operations with negation. They state: ¬(A ∧ B) = ¬A ∨ ¬B and ¬(A ∨ B) = ¬A ∧ ¬B. These laws help simplify circuits and prove gate equivalence.
德摩根定律对于在有否定的情况下转换与运算和或运算至关重要。它们表示为：¬(A ∧ B) = ¬A ∨ ¬B 以及 ¬(A ∨ B) = ¬A ∧ ¬B。这些定律有助于简化电路并证明门的等效性。
For example, a NAND gate can be built using an OR gate with inverted inputs, and a NOR gate can be built using an AND gate with inverted inputs. This is widely used in real-world circuit design.
例如，或非门可以用带反相输入的与门实现，与非门可以用带反相输入的或门实现。这在实际电路设计中应用广泛。
12. Applications of Boolean Logic in Circuits | 布尔逻辑在电路中的应用
Boolean logic is used everywhere in digital systems. Simple applications include burglar alarms (output on when door open AND motion detected), street lighting (light on when dark OR timer active), and computer memory units. Complex applications include CPUs and control units.
布尔逻辑在数字系统中随处可见。简单的应用包括防盗报警器（门打开且检测到运动时输出）、路灯（天黑或定时器激活时亮起）以及计算机存储器。复杂的应用包括CPU和控制单元。
In IGCSE examinations, you may be asked to draw a logic circuit from a problem description, write its truth table, or simplify an expression. Practice with everyday logic scenarios helps build understanding.
在IGCSE考试中，你可能会被要求根据问题描述画出逻辑电路、写出真值表或化简表达式。用日常逻辑场景进行练习有助于加深理解。
Published by TutorHao | Science (Boolean Logic) Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图