Solving Inverse Truth Table Problems | 逆真值表问题求解方法

📚 Solving Inverse Truth Table Problems | 逆真值表问题求解方法

In IB Mathematics, truth tables are used to define logical connectives and to test whether compound statements are tautologies, contradictions, or contingencies. An “inverse truth table problem” asks you to work in the opposite direction: given a truth table, you must reconstruct the logical expression that produces it, or produce the truth table for a statement’s inverse, converse, and contrapositive. This is a high-value skill in the logic and proof component of IB Mathematics.

在 IB 数学中，真值表用于定义逻辑联结词，并检验复合命题是重言式、矛盾式还是偶然式。所谓”逆真值表问题”，就是要求你反向思考：给定一个真值表，反推出能够产生该真值表的逻辑表达式；或者是写出一个条件命题的逆命题、否命题、逆否命题的真值表。这是 IB 数学逻辑与证明部分的重要技能。

---

1. Truth Tables and Logical Operations | 真值表与逻辑运算

Before solving inverse problems, you must be fluent with the five key connectives used in IB Mathematics: negation (¬), conjunction (∧), disjunction (∨), implication (→), and equivalence (↔). Each connective has a unique truth-table pattern.

在解决逆问题之前，你必须熟练掌握 IB 数学中使用的五个关键联结词：否定（¬）、合取（∧）、析取（∨）、蕴含（→）和等价（↔）。每个联结词都有独特的真值表模式。

p	q	¬p	p ∧ q	p ∨ q	p → q	p ↔ q
T	T	F	T	T	T	T
T	F	F	F	T	F	F
F	T	T	F	T	T	F
F	F	T	F	F	T	T

Notice that p → q is false only when p is true and q is false. This single fact explains why the converse and inverse of a statement are not automatically true.

注意，p → q 仅在 p 为真、q 为假时为假。仅这一点就解释了为什么一个命题的逆命题和否命题并不自动为真。

---

2. What Is an Inverse Truth Table Problem? | 什么是逆真值表问题？

An inverse truth table problem in IB Mathematics typically takes one of two forms. The first form gives you a completed truth table and asks you to find a compound statement that matches it. The second form gives you a conditional statement and asks you to construct the truth tables for its inverse, converse, and contrapositive.

IB 数学中的逆真值表问题通常有两种形式。第一种形式给出一个填好的真值表，要求你找出与之匹配的复合命题。第二种形式给出一个条件命题，要求你构造其逆命题、否命题和逆否命题的真值表。

The word “inverse” is used because the process is inverted: instead of evaluating an expression row by row, you work from rows back to an expression. In the conditional case, “inverse” specifically refers to the statement ¬p → ¬q.

使用”逆”这个词是因为过程被倒转：不再是逐行计算表达式，而是从每一行反推表达式。在条件命题的情形下，”inverse”特指 ¬p → ¬q 这一命题。

Both forms appear in IB exam questions that test logical reasoning, proof methods, and set-theoretic thinking. Mastering them will also help you understand arguments and fallacies in the Theory of Knowledge component.

这两种形式都出现在 IB 考试中，考查逻辑推理、证明方法和集合式思维。掌握它们也有助于你理解认识论（TOK）中的论证与谬误。

---

3. Method 1: Direct Inspection | 方法一：直接观察法

The quickest way to recover an expression from a truth table is to look for a single row where the output is true. If the output is true in only one row, you can write the expression directly as the conjunction of the literals in that row.

从真值表反推表达式的最快方法是寻找输出为真的单独一行。如果输出仅在一行为真，你可以直接将该行中的各个文字（变量或其否定）用合取连接起来。

For example, suppose the output is true only when p = T and q = F. Then the expression must be p ∧ ¬q. No other row will make this conjunction true.

例如，假设输出仅在 p = T、q = F 时为真。那么表达式必然是 p ∧ ¬q。没有其他行会使该合取式为真。

If the output is true in several rows, you can write one conjunction for each true row and join all of them with disjunction (∨). This is the basic idea behind the disjunctive normal form.

如果输出在多个行为真，你可以为每个为真的行写出一个合取式，然后用析取（∨）连接它们。这就是析取范式的基本思想。

---

4. Method 2: Disjunctive Normal Form (Sum of Products) | 方法二：析取范式（积之和）

Disjunctive Normal Form (DNF), also called “sum of products,” is a systematic method for reconstructing any Boolean expression from a truth table. For each row where the output is T, create a minterm: assign p if p is T, and ¬p if p is F. Then combine all minterms with ∨.

析取范式（DNF），也叫”积之和”，是一种从真值表重建任何布尔表达式的系统方法。对于输出为 T 的每一行，创建一个最小项：如果 p 为 T 就写 p，如果 p 为 F 就写 ¬p。然后用 ∨ 连接所有最小项。

For a two-variable XOR truth table, the output is T when p = T, q = F and when p = F, q = T. The DNF is therefore:

对于两个变量的异或（XOR）真值表，输出在 p = T、q = F 和 p = F、q = T 时为 T。因此其 DNF 为：

p ⊕ q ≡ (p ∧ ¬q) ∨ (¬p ∧ q)

This method is guaranteed to produce a correct expression, but the expression may not be the simplest one. In IB exams, you should always simplify if the question asks for “the simplest form.”

这种方法保证能产生正确的表达式，但所得表达式可能不是最简形式。在 IB 考试中，如果题目要求”最简形式”，你一定要继续化简。

---

5. Method 3: Conjunctive Normal Form (Product of Sums) | 方法三：合取范式（和之积）

Conjunctive Normal Form (CNF), also called “product of sums,” works with the rows where the output is F. For each such row, create a clause that is false in that row: use p if p is F, and ¬p if p is T. Then combine all clauses with ∧.

合取范式（CNF），也叫”和之积”，处理输出为 F 的行。对于每一个这样的行，创建一个在该行为假的子句：如果 p 为 F 就写 p，如果 p 为 T 就写 ¬p。然后用 ∧ 连接所有子句。

For the same XOR truth table, the output is F in two rows: when p = T, q = T and when p = F, q = F. The CNF is therefore:

对于同一个异或真值表，输出在 p = T、q = T 和 p = F、q = F 两行为 F。因此其 CNF 为：

p ⊕ q ≡ (p ∨ q) ∧ (¬p ∨ ¬q)

Notice that this expression is logically equivalent to the DNF. You can choose either method, but CNF is often shorter when the truth table has few false rows.

注意，该表达式与 DNF 在逻辑上等价。你可以选择其中一种方法，但当真值表中假行较少时，CNF 通常更短。

To remember the rule: DNF is “OR of ANDs” (minterms); CNF is “AND of ORs” (maxterms).

记忆方法：DNF 是”若干个合取式的析取”（最小项）；CNF 是”若干个析取式的合取”（最大项）。

---

6. Simplifying the Result | 化简结果

Once you have a DNF or CNF, you may need to simplify using Boolean algebra laws. The most useful laws for IB include the associative, commutative, distributive, identity, complement, and absorption laws.

得到 DNF 或 CNF 后，你可能需要使用布尔代数定律进行化简。对 IB 最有用的定律包括结合律、交换律、分配律、恒等律、互补律和吸收律。

• Distributive law: p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r)

  分配律：p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r)

• Absorption law: p ∨ (p ∧ q) ≡ p

  吸收律：p ∨ (p ∧ q) ≡ p

• Complement law: p ∨ ¬p ≡ T and p ∧ ¬p ≡ F

  互补律：p ∨ ¬p ≡ T，p ∧ ¬p ≡ F

For example, the expression (p ∧ ¬q) ∨ (p ∧ q) simplifies to p ∧ (¬q ∨ q), which simplifies further to p. Simplification reduces the risk of error and makes the logical meaning transparent.

例如，(p ∧ ¬q) ∨ (p ∧ q) 可化简为 p ∧ (¬q ∨ q)，进一步化简为 p。化简能降低出错风险，也使逻辑含义更加清晰。

For up to four variables, a Karnaugh map can help you spot simplifications visually. Although not always required in IB, it is a useful check before the final answer.

对于不超过四个变量，卡诺图可以帮助你直观地发现化简机会。虽然 IB 并不总是要求卡诺图，但在写出最终答案前它是一个有用的检查工具。

---

7. Converse and Contrapositive Truth Tables | 逆命题与逆否命题真值表

When asked to find truth tables for related conditionals, you need the exact definitions. For p → q:

当要求写出相关条件命题的真值表时，你需要掌握精确定义。对于 p → q：

• Converse: q → p

  逆命题：q → p

• Inverse: ¬p → ¬q

  否命题：¬p → ¬q

• Contrapositive: ¬q → ¬p

  逆否命题：¬q → ¬p

The truth table below compares these statements for all four combinations of p and q.

下表比较了 p 和 q 的所有四种组合下这些命题的真值。

p	q	p → q	q → p	¬p → ¬q	¬q → ¬p
T	T	T	T	T	T
T	F	F	T	T	F
F	T	T	F	F	T
F	F	T	T	T	T

From the table, p → q is logically equivalent to ¬q → ¬p, and q → p is logically equivalent to ¬p → ¬q. This is why the contrapositive can be used as a valid proof method, but the converse and inverse cannot.

由表可知，p → q 与 ¬q → ¬p 逻辑等价，q → p 与 ¬p → ¬q 逻辑等价。这就是为什么逆否命题可以作为有效的证明方法，而逆命题和否命题不能。

---

8. Common Pitfalls and Exam Tips | 常见陷阱与考试技巧

Many students lose marks because of simple sign errors in minterms and maxterms. In DNF, a T means the variable is positive; in CNF, a F means the variable is positive. Write this rule at the top of your working page.

许多学生因为在最小项和最大项中的简单符号错误而失分。在 DNF 中，T 表示该变量为正；在 CNF 中，F 表示该变量为正。请在草稿纸顶部写下这条规则。

• Always include all rows in the truth table, including the case where one input is false.

  始终包含真值表中的所有行，包括某个输入为假的情况。

• Do not confuse the inverse with the converse. The inverse negates both p and q; the converse reverses them.

  不要混淆否命题与逆命题。否命题同时否定 p 和 q；逆命题交换 p 和 q 的位置。

• If your reconstructed expression misses a true row or includes a false row, check your literals against the table.

  如果你重建的表达式遗漏了某个为真的行，或包含了某个为假的行，请对照真值表检查你的文字符号。

• Remember that p → q is vacuously true when p is false. This is not intuition, but a logical convention.

  记住，当 p 为假时，p → q 为”空真”。这并非直觉，而是一种逻辑约定。

When time permits, test your final expression by substituting every row back into the expression. This is a cheap and reliable verification method.

如果时间允许，将每一行代回最终表达式进行检验。这是一种省时又可靠的验证方法。

---

9. Worked Example | 综合例题

Consider the following truth table with three variables A, B, and C. Find a simplified expression for F.

考虑下面含有三个变量 A、B、C 的真值表。求 F 的化简表达式。

A	B	C	F
F	F	F	F
F	F	T	F
F	T	F	F
F	T	T	F
T	F	F	F
T	F	T	T
T	T	F	T
T	T	T	T

Using the DNF method, take the three true rows and build a minterm for each:

使用 DNF 方法，取三个为真的行，为每一行构建最小项：

F ≡ (A ∧ ¬B ∧ C) ∨ (A ∧ B ∧ ¬C) ∨ (A ∧ B ∧ C)

Factor out A from all three terms:

从三个项中提取公因子 A：

F ≡ A ∧ [ (¬B ∧ C) ∨ (B ∧ ¬C) ∨ (B ∧ C) ]

Using the distributive law, the bracket simplifies to B ∨ C. Therefore:

利用分配律，括号部分化简为 B ∨ C。因此：

F ≡ A ∧ (B ∨ C)

Alternatively, using the CNF method on the five false rows yields an equivalent result after simplification. Both paths confirm the same answer.

另一种方法是使用 CNF 方法处理五个为假的行，化简后也会得到等价结果。两种路径得到相同的答案。

---

10. Conclusion | 总结

Inverse truth table problems are not mysterious once you see them as pattern recovery. Build minterms for true rows to get DNF, build maxterms for false rows to get CNF, and simplify using Boolean laws. For conditionals, always keep the definitions of converse, inverse, and contrapositive clear.

一旦你将逆真值表问题看作模式恢复，它就不再神秘。为真行构建最小项得到 DNF，为假行构建最大项得到 CNF，再用布尔定律化简。对于条件命题，始终保持逆命题、否命题和逆否命题的定义清晰。

Practise with two, three, and four variables until the transformation becomes automatic. In the IB exam, this skill not only earns direct marks but also builds a strong foundation for proofs by contradiction and contrapositive.

用两个、三个和四个变量反复练习，直到这种转换成为本能反应。在 IB 考试中，这项技能不仅能直接得分，还能为反证法和逆否命题证明打下坚实基础

Published by TutorHao | IB Mathematics Revision Series | aleveler.com

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