arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2008.06410cs.LO
收藏

\mathbb{N}上的诱导模型

Induction Models on \mathbb{N}

A. Dileep, Kuldeep S. Meel, Ammar F. Sabili

摘要:

数学归纳法是计算机科学和数学中的一个基本工具。Henkin开创了数学归纳法形式化的研究,其研究局限于当基情形B被设置为包含0和一元生成函数S的单例集时的设置。数学归纳法的使用通常涉及到更广泛的基情况和具有不同结构限制的k元生成函数。虽然后来的研究表明,几个归纳模型是等效的,不存在精确的逻辑表征的减少和等效之间的不同归纳模型。本文推广了归纳模型的定义,证明了对给定的B,S的存在性和构造性,反之亦然。然后,我们提供了一个正式的表征之间的减少不同的归纳模型,可以让证明在一个归纳模型表示为证明在另一个归纳模型。约简的概念使我们能够捕捉归纳模型之间的等价性。

英文摘要:

Mathematical induction is a fundamental tool in computer science and mathematics. Henkin initiated the study of formalization of mathematical induction restricted to the setting when the base case B is set to singleton set containing 0 and a unary generating function S. The usage of mathematical induction often involves wider set of base cases and k-ary generating functions with different structural restrictions. While subsequent studies have shown several Induction Models to be equivalent, there does not exist precise logical characterization of reduction and equivalence among different Induction Models. In this paper, we generalize the definition of Induction Model and demonstrate existence and construction of S for given B and vice versa. We then provide a formal characterization of the reduction among different Induction Models that can allow proofs in one Induction Models to be expressed as proofs in another Induction Models. The notion of reduction allows us to capture equivalence among Induction Models.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑