【离散数学】 SEU - 08 - 2021/03/26 - Introduction to Proofs

最新推荐文章于 2024-09-04 19:51:15 发布

Teddy van Jerry

最新推荐文章于 2024-09-04 19:51:15 发布

阅读量225

点赞数

分类专栏：【离散数学】文章标签：离散数学数学 Mathematics

本文链接：https://blog.csdn.net/weixin_50012998/article/details/115228637

版权

【离散数学】专栏收录该内容

43 篇文章 6 订阅

订阅专栏

本文介绍了《离散数学及其应用》第八版中关于逻辑与证明的基础概念，包括定理、引理、推论的定义，以及直接证明、逆否法和矛盾法等证明方法。重点讲解了如何通过定义、已有定理、公理和推理规则来证明陈述。适合初学者理解证明过程和构造技术。

摘要由CSDN通过智能技术生成

Discrete Mathematics and its Applications (8th Edition)
2021/03/26 - Introduction to Proofs

1 The Foundations: Logic and Proofs

1.7 Introduction to Proofs

1.7.2 Some Terminology

A theorem is a statement that can be shown to be true using:

definitions
other theorems
axioms (statements which are given as true)
rules of inference

A lemma is a ‘helping theorem’ or a result which is needed to prove a theorem.

A corollary is a result which follows directly from a theorem.

Less important theorems are sometimes called propositions.

A conjecture is a statement that is being proposed to be true.

1.7.5 Direct Proofs

1.7.6 Proof by Contraposition

1.7.7 Proof by Contradiction

$\forall x\ (A(x)\rightarrow B(x))\rightarrow(\forall x\ A(x)\rightarrow\forall x\ B(x))\equiv \mathbf{T}$

Solution:
$\forall x\ (A(x)\rightarrow B(x))\rightarrow(\forall x\ A(x)\rightarrow\forall x\ B(x))\\\equiv\neg\forall x\ (A(x)\rightarrow B(x))\vee(\forall x\ A(x)\vee\forall x\ B(x))\\\equiv(\neg\forall x\ (A(x)\rightarrow B(x))\vee\forall x\ A(x))\vee\forall x\ B(x)\\\equiv\neg((\forall x\ A(x)\rightarrow B(x))\wedge\forall x\ A(x))\vee\forall x\ B(x)\\\equiv\cdots$

Actually, we have
$p\rightarrow(q\rightarrow r)\\\equiv(p\wedge q)\rightarrow r$ so, it is equivalent to Premise $\forall x\ (A(x)\rightarrow B(x))\wedge \forall x\ A(x)$ , Conclusion $\forall x\ B(x)$ .