| English | 释义 | 拼音 |
|---|---|---|
| Boolean algebra/ˈbuːlɪən ˈældʒɪbrə/ | 布尔代数 | bù ěr dài shù |
| bit/bɪt/ | 位 | wèi |
| binary arithmetic/ˈbaɪnəri əˈrɪθmətɪk/ | 二进制运算 | èr jìn zhì yùn suàn |
| byte/baɪt/ | 字节 | zì jié |
| truth table/truːθ ˈteɪbl/ | 真值表 | zhēn zhí biǎo |
| logic gate/ˈlɒdʒɪk ɡeɪt/ | 逻辑门 | luó jí mén |
| logic circuit/ˈlɒdʒɪk ˈsɜːkɪt/ | 逻辑电路 | luó jí diàn lù |
A two-value rule can still have several inputs
- Boolean algebra 布尔代数 uses true and false with operations such as AND, inclusive OR and NOT.
- A processor can implement arithmetic using digital logic. Abstract Boolean reasoning examines a stated input/output rule, rather than proving every detail of a real computer.
Keep bit arithmetic and truth values distinct
- Binary arithmetic 二进制运算 carries at 2: binary $1+1=10$. A bit 位 is one binary digit and a byte 字节 is eight bits.
- A bit pattern can encode an unsigned value, a signed value or other information. Specify its width and interpretation before calling its value 255 or inverting it.

二进制中 1 + 1 等于什么?
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
无数字2,故进位 —— 如同十进制 9 + 1。
Evaluate every Boolean combination
- A truth table 真值表 for n unrestricted Boolean inputs has $2^n$ rows. Include intermediate expressions to make grouping visible.
- Identical outputs in every row prove two expressions equivalent for those Boolean inputs. That does not establish circuit timing, authentication security or physical reliability.
翻转输入观察输出
AND 仅当两者都为真时为真;OR 仅当两者都为假时为假。
三输入的真理表有多少行?
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
2³ = 8。每增加一个输入,组合数翻倍。
两个布尔表达式真理表完全相同,由此可得?
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
针对相同布尔输入逐行匹配可证明抽象布尔等价性,但不能确立物理时序或真实系统安全性。
A complete two-input table. In row order 00, 01, 10, 11, AND outputs 0, 0, 0, 1; inclusive OR outputs 0, 1, 1, 1; NOT A outputs 1, 1, 0, 0. A single matching row is not enough to prove two expressions equivalent.
"A AND B" 在其真理表上仅一行成立。
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
仅输入全为1的那一行。该行即为全部定义。
Follow connections through the circuit
- A logic gate 逻辑门 implements a specified operation. A logic circuit 逻辑电路 connects those operations, with outputs feeding later inputs.
- Build intermediate columns according to that dependency order. De Morgan can rewrite NOT of an AND as OR of the negated inputs, but must negate both inputs.
Simplify and verify separately. $(A\land B)\lor(A\land\neg B)=A$ by distributivity and $B\lor\neg B$ being true. Sheet 4.3 checks all four rows and separately tests fixed-width bitwise operations.
逻辑中,“A OR B”何时为假?
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
包容性或运算仅在两个输入均为假时为假。两者皆真则为真;本题明确使用包容性或运算。
Inclusive OR is true when both inputs are true. Bitwise NOT inverts only the stated positions: four-bit NOT of 1100 is 0011, unsigned 3, rather than an unspecified signed or infinite-width value.