arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.13954cs.LO
收藏

为ZF集合论增加一个抽象障碍

Adding an Abstraction Barrier to ZF Set Theory

Ciarán Dunne, J. B. Wells, Fairouz Kamareddine

摘要:

许多数学著作都是以集合论(英语:Set theory)为基础,通常是Zermelo-Fraenkel集合论(ZF)或其变体。在ZF中,论述的领域只包含集合,因此每个数学对象都必须是集合。因此,在ZF中,使用有序对${\langle a, b\rangle}$的通常编码,${\{a\} \in \langle a, b \rangle}$等公式具有真值,而${\mathcal P (\langle a, b\rangle)}$等运算的结果是集合。这种“偶然定理”与人们对数学的理解不相符,也给集合论在机器辅助定理证明中的应用带来了实际困难。相比之下,在许多证明助手中,数学对象和概念可以由类型理论的东西构建,因此许多数学对象本质上可以是扩展的类型化$λ$演算。然而,在类型论中形式化数学时出现了困境和挫折。受(1)纯集合论和(2)类型论方法形式化数学问题的启发,我们探索了一种具有集合论的灵活性和类型论的一些有用特征的选择。我们提出ZFP:ZF的修改,将有序对作为原始的、非集合对象。ZFP对有序对有一个更自然和抽象的公理化定义,没有任何表示的概念。本文给出了ZFP的公理,并在ZF(Isabelle/ZF中的机器检查)中证明了ZFP模型的存在性,这意味着ZFP是相容的,如果ZF是。我们讨论的方法来添加这个抽象的障碍ZF。

英文摘要:

Much mathematical writing exists that is, explicitly or implicitly, based on set theory, often Zermelo-Fraenkel set theory (ZF) or one of its variants. In ZF, the domain of discourse contains only sets, and hence every mathematical object must be a set. Consequently, in ZF, with the usual encoding of an ordered pair ${\langle a, b\rangle}$, formulas like ${\{a\} \in \langle a, b \rangle}$ have truth values, and operations like ${\mathcal P (\langle a, b\rangle)}$ have results that are sets. Such 'accidental theorems' do not match how people think about the mathematics and also cause practical difficulties when using set theory in machine-assisted theorem proving. In contrast, in a number of proof assistants, mathematical objects and concepts can be built of type-theoretic stuff so that many mathematical objects can be, in essence, terms of an extended typed $λ$-calculus. However, dilemmas and frustration arise when formalizing mathematics in type theory. Motivated by problems of formalizing mathematics with (1) purely set-theoretic and (2) type-theoretic approaches, we explore an option with much of the flexibility of set theory and some of the useful features of type theory. We present ZFP: a modification of ZF that has ordered pairs as primitive, non-set objects. ZFP has a more natural and abstract axiomatic definition of ordered pairs free of any notion of representation. This paper presents axioms for ZFP, and a proof in ZF (machine-checked in Isabelle/ZF) of the existence of a model for ZFP, which implies that ZFP is consistent if ZF is. We discuss the approach used to add this abstraction barrier to ZF.

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

↑