📚 Investigation 2 – Equivalent Statements | 逻辑等价命题探究
In mathematics and logic, understanding when two statements are equivalent is fundamental for constructing proofs and simplifying complex expressions. Equivalent statements have the same truth value under all possible interpretations, enabling us to replace one with another without changing the logical meaning. This investigation explores how to identify, verify, and apply equivalent statements using truth tables and logical laws.
在数学和逻辑中，理解两个命题何时等价是构建证明和简化复杂表达式的基础。等价命题在所有可能的解释下具有相同的真值，使我们能够将一个命题替换为另一个而不改变逻辑含义。本次探究将探索如何使用真值表和逻辑定律来识别、验证和应用等价命题。
1. What Are Statements? | 什么是命题？
sition) is a declarative sentence that is either true or false, but not both. For example, "2 + 2 = 4" is a true statement, while "Paris is the capital of Italy" ons, commands, and exclamations are not statements because they do not have a truth value.
一个命题是一个陈述句，它要么为真要么为假，但不能同时为真又为假。例如，“2 + 2 = 4”是一个真命题，而“巴黎是意大利的首都”是假命题。疑问句、祈使句和感叹句不是命题，因为它们没有真值。
In IB Mathematics, we often use letters like p, q, r to denote simple statements. A statement can be atomic, meaning it cannot be broken down into simpler statements, or molecular, built from atomic statements using logical connectives.
在 IB 数学中，我们常常用 p, q, r 等字母表示简单命题。命题可以是原子的，即不能再分解为更简单的命题；也可以是分子的，即用逻辑联结词由原子命题组合而成。
2. Logical Connectives | 逻辑联结词
ing logical connectives to form compound statements. The basic connectives are: negation (¬, "not"), conjunction (∧, "and"), disjunction (∨, "or"), implication (→, "if... then..."), and biconditional (↔, "if and only if"). For instance, if p represents "It is raining" and q represents "I carry an umbrella", then p → q means "If it is raining, then I carry an umbrella."
我们使用逻辑联结词将简单命题组合成复合命题。基本的联结词有：否定（¬，“非”）、合取（∧，“且”）、析取（∨，“或”）、蕴含（→，“如果……则……”）以及双条件（↔，“当且仅当”）。例如，若 p 表示“正在下雨”，q 表示“我带伞”，那么 p → q 表示“如果正在下雨，那么我带伞”。
Each connective has precise rules for truth. For example, p ∨ q is an inclusive "or" when at least one of p or q is true. The biconditional p ↔ q is just shorthand for (p → q) ∧ Understanding these connectives is the first step towards exploring equivalent statements.
每个联结词都有精确的真值规则。例如，p ∨ q 是包容性“或”，意味着当 p 或 q 中至少一个为真时即为真。双条件 p ↔ q 其实就是 (p → q) ∧ (q → p) 的简写。理解这些联结词是探索等价命题的第一步。
3. Truth Tables | 真值表
: (T,T), (T,F), (F,T), (F,F). Using truth tables, we can define the semantics of each connective. For example, p ∧ q is true only when both p and q are true; p ∨ only when p is true and q is false; p ↔ q is true when p and q have the same truth value.
真值表是一种系统的方法，用于展示当原子命题取每种可能真值组合时复合命题的真值。对于两个原子命题 p 和 q，共有 2² = 4 种组合：(T,T)、(T,F)、(F,T)、(F,F)。利用真值表，我们可以定义每个联结词的语义。例如，p ∧ q 仅在 p 和 q 均为真时为真；p ∨ q 仅在两者均为假时为假；p → q 仅在 p 为真而 q 为假时为假；p ↔ q 在 p 和 q 真值相同时为真。
To construct a truth table, first list all combinations of truth values for the atomic statements. Then compute intermediate columns step by step. The table below illustrates the connectives for two variables.
要构造真值表，首先列出原子命题的所有真值组合，然后逐步计算中间列。下表展示了两变量联结词的真值。
| 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 |
Truth tables are the primary tool for proving logical equivalence, as two statements with identical columns in their truth tables are equivalent.
真值表是证明逻辑等价的主要工具，因为真值表中列完全相同的两个命题就是等价的。
4. Logical Equivalence Defined | 逻辑等价的定义
Two compound statements A and B are logically equivalent (denoted A ≡ the biconditional A ↔ B is a tautology. For example, the statement p → q is equivalent to ¬p ∨ . This equivalence is one of the most important in logic and is frequently used in proofs.
如果两个复合命题 A 和 B 在其原子命题的所有可能真值赋值下具有相同的真值，则称它们逻辑等价（记作 A ≡ B）。换句话说，双条件 A ↔ B 是一个重言式。例如，命题 p → q 等价于 ¬p ∨ q。这个等价关系是逻辑中最重要的等价之一，在证明中经常使用。
Equivalence does not mean the statements are identical in wording; rather, they always agree in truth. For instance, "If it is a cat, then it has whiskers" is equivalent to "It is not a cat, or it has whiskers." This seeming mismatch in ordinary language is resolved when you analyse the truth conditions.
等价并不意味着陈述在措辞上完全相同；而是它们的真值始终一致。例如，“如果它是猫，那么它有胡须”等价于“它不是猫，或者它有胡须”。这种日常语言中的表面不匹配在你分析真值条件时就解决了。
5. De Morgan's Laws | 德摩根定律
De Morgan's Laws are two fundamental equivalences involving negation, conjunction, and disjunction. They state that ¬(p ∧ q) ≡ ¬p ∨ ¬q and ¬(p ∨ q) ≡ ¬p ∧ ¬q. These laws allow us to distribute negation over conjunctions and disjunctions. In other words, "not (p and q)" is equivalent to "not p or not q", and similarly "not (p or q)" means "not p and not q". These are extremely useful for simplifying logical expressions in mathematics and computer science.
德摩根定律是涉及否定、合取与析取的两个基本等价式。它们指出：¬(p ∧ q) ≡ ¬p ∨ ¬q，以及 ¬(p ∨ q) ≡ ¬p ∧ ¬q。这些定律允许我们对合取与析取分配否定。换句话说，“并非(p 且 q)”等价于“非 p 或非 q”，类似地，“并非(p 或 q)”意味着“非 p 且非 q”。它们在数学和计算机科学中对于简化逻辑表达式非常有用。
To verify De Morgan's Laws, construct a truth table with columns for p, q, ¬p, ¬q, p∧q, ¬(p∧q), and ¬p ∨ ¬q. You will observe that the columns for ¬(p∧q) and ¬p ∨ ¬q are identical. The symmetrical law works similarly.
要验证德摩根定律，可以构造一个真值表，包含 p, q, ¬p, ¬q, p∧q, ¬(p∧q) 和 ¬p ∨ ¬q 的列。你会观察到 ¬(p∧q) 和 ¬p ∨ ¬q 的列完全相同。对称的那个定律也是如此。
6. The Implication and Its Equivalents | 蕴含及其等价命题
nt p → q can be expressed in several equivalent ways. The most common equivalence is p → q ≡ ¬p ∨ q. Another equivalent form is ¬q → ¬p (the contrapositive). It is also equivalent to ¬(p ∧ ¬ s false. Understanding these equivalents helps in constructing direct and indirect proofs.
条件命题 p → q 可以用多种等价的方式来表达。最常见的等价式是 p → q ≡ ¬p ∨ q。另一个等价形式是 ¬q → ¬p（逆否命题）。它还等价于 ¬(p ∧ ¬q)，即不可能出现 p 为真且 q 为假的情况。理解这些等价形式有助于构建直接证明和间接证明。
Why is the equivalence p → q ≡ ¬p ∨ q important? In classical logic, "if p then q" This dispels confusion about implications that seem counterintuitive in everyday language.
为什么等价式 p → q ≡ ¬p ∨ q 很重要？在经典逻辑中，“如果 p 则 q”为真，当且仅当 p 为假或 q 为真。这正是第一个部分被否定的析取条件。这消除了在日常语言中看似反直觉的蕴含困惑。
7. Contrapositive, Inverse, Converse | 逆否命题、逆命题与否命题
implication p → q, we define three related statements: the converse (q → p), the inverse (¬p → ¬q), and the contrapositive (¬q → ¬ the original. This is a critical insight used in proof by contrapositive, where one proves ¬q → ¬p to establish p → q.
给定一个蕴含式 p → q，我们定义三个相关的命题：逆命题（q → p）、否命题（¬p → ¬q）以及逆否命题（¬q → ¬p）。只有逆否命题与原蕴含式逻辑等价。逆命题与否命题彼此等价，但不与原式等价。这一关键洞见用于逆否证明法，即通过证明 ¬q → ¬p 来确立 p → q。
For example, the statement "If it snows, the school closes" has contrapositive "If the school does not close, then it does not snow." These two are logically identical. However, the converse "If the school closes, then it snows" may be false, because other factors could close the school. This distinction is essential for precise reasoning.
例如，命题“如果下雪，则学校关闭”的逆否命题是“如果学校没有关闭，那么没有下雪”。这两个命题逻辑上完全相同。然而，逆命题“如果学校关闭，那么下了雪”可能为假，因为其他因素也可能导致学校关闭。这一区分对于精确推理至关重要。
8. Proving Equivalence Using Truth Tables | 使用真值表证明等价
for the two statements match row by row, they are equivalent. For example, to prove p → q ≡ ¬p ∨ q, we list all combinations for p and q, compute p → q and ¬p ∨ This method is straightforward but becomes cumbersome for statements with many variables.
为了验证两个复合命题等价，我们可以构建一个真值表，其中包含每个子表达式的列。如果两个命题的最终真值列逐行匹配，则它们是等价的。例如，要证明 p → q ≡ ¬p ∨ q，我们列出 p 和 q 的所有组合，计算 p → q 和 ¬p ∨ q，并检查这两列是否一致。这种方法直接，但当变量增多时会变得繁琐。
The following truth table demonstrates the equivalence between p → q and ¬p ∨ q.
以下真值表演示了 p → q 与 ¬p ∨ q 之间的等价性。
