Product Design, Manufacturing & Innovation Resources
家 » 反证法(归谬法)

反证法(归谬法)

-400
Scholar engaged in proof by contradiction in an ancient library setting.

(图片仅供参考)

Proof by contradiction, or reductio ad absurdum, is a form of indirect proof. It establishes the truth of a proposition by showing that assuming the proposition to be false leads to a logical contradiction. To prove a proposition [latex]p[/latex], one assumes its negation, [latex]\neg p[/latex], and deduces a contradiction, such as [latex]q \land \neg q[/latex], thereby concluding that [latex]p[/latex] 必须 be true.

反证法的逻辑基础是矛盾律和排中律。矛盾律指出,一个命题不可能既真又假;排中律指出,一个命题只能为真或为假。该方法首先假设待证明命题的反面。例如,要证明…… square root of 2 是 irrational, one starts by assuming it is rational. If [latex]\sqrt{2}[/latex] is rational, it can be expressed as a fraction [latex]a/b[/latex] in lowest terms, where a and b are integers. This leads to [latex]2 = a^2/b^2[/latex], or [latex]a^2 = 2b^2[/latex]. This implies [latex]a^2[/latex] is even, which means [latex]a[/latex] must also be even. So, [latex]a = 2k[/latex] for some integer k. Substituting this back gives [latex](2k)^2 = 2b^2[/latex], or [latex]4k^2 = 2b^2[/latex], which simplifies to [latex]2k^2 = b^2[/latex]. This means [latex]b^2[/latex] is even, and therefore [latex]b[/latex] is also even. If both a and b are even, the fraction [latex]a/b[/latex] was not in lowest terms, which contradicts the initial assumption. This contradiction forces the conclusion that the initial assumption—that [latex]\sqrt{2}[/latex] is rational—must be false. This method is powerful but can be non-constructive, as it proves a statement is true without providing a direct example or construction.

UNESCO Nomenclature: 1201
逻辑

类型

抽象系统

中断

Foundational

用法

广泛使用

前体

  • 苏格拉底式辩论法(交叉质询)
  • 埃利亚学派哲学(例如,芝诺悖论)
  • 亚里士多德对形式逻辑的发展

应用程序

  • 欧几里得证明素数无穷大
  • 证明 2 的平方根是无理性的
  • 康托尔的对角线论证证明了实数的不可数性
  • 在计算机科学中证明停机问题是不可判定的

专利:

NA

潜在创新理念

  • 拓扑学和分析学中的非构造性存在性证明
  • security proofs in 密码学 showing an attack is impossible
  • 使用反驳技术的自动推理系统
  • 哲学和形而上学中的基础论证
  • 通过排除不可能的状态来诊断复杂系统
  • 证明计算复杂度的下界
  • 确定不可判定性是可计算性理论的结果
  • 博弈论策略可以消除劣势选项
  • formal verification of protocols by showing error states are unreachable
  • 发展直觉主义逻辑是对这种方法的批判
Related to: contradiction, reductio ad absurdum, indirect proof, irrational numbers, logic, law of non-contradiction, negation, assumption, Cantor, halting problem.

历史背景

反证法(归谬法)

-300
-300
-300
-400
-550
1635
1650
1736
-300
-300
-350
-500
150
1640
1650

(如果日期未知或不相关,例如“流体力学”,则提供其显著出现的近似估计)

第十年 周年纪念日

只有注册会员才能免费获取完整尺寸的图片和下载内容。

> 登录 <