Zermelo-Fraenkel集合理论

James T Smith
{"title":"Zermelo-Fraenkel集合理论","authors":"James T Smith","doi":"10.1142/9789811201936_0003","DOIUrl":null,"url":null,"abstract":"The units on set theory and logic have used ZF set theory without specifying precisely what it is. To investigate which arguments are possible in ZF and which not, you must have a precise description of it. A major question asked during the development of ZF was what system of logic should be used as its framework. Logicians eventually agreed that the framework itself should not depend very much on set-theoretic reasoning. Investigators could then focus on the difficult problems of set theory: there would be little interplay between the framework and the subject under study. During 1920–1940, first-order logic crystallized as a convenient framework for the study of algebraic structures. Applying it does not require use of techniques commonly regarded as set-theoretic. Moreover, the Gödel completeness theorem shows that it encompasses (but doesn't necessarily simulate) many arguments that mathematicians commonly use to prove theorems expressed in a first-order language. Thus, to facilitate investigation of the scope of set theory, it seems appropriate to express it in a first-order language, and restrict it to use logic that is compatible with the first-order framework. When we apply set theory formulated that way, we can highlight the use of its major principles. They're explicitly stated in first-order set-theoretic axioms, and explicitly mentioned in first-order proofs. To be sure, some very elementary parts of set theory are involved in the underlying logical framework, necessary even to formulate those axioms and proofs. But the more powerful set-theoretic principles are displayed conspicuously. ZF is formulated in a first-order theory with minimal apparatus: • countably many variables, which we regard as varying over all sets; • no constants; • no operators; • just two predicates, equality and the binary membership predicate 0. The nonlogical axioms of ZF can be reduced to a small number, as follows. extensionality power set choice separation pair set foundation replacement union infinity The ZF axioms are kept to the minimum number in order to simplify studies of their properties. The list can be pared even further by deriving some axioms from others, but those arguments are uninformative. Each of these axioms is stated below in detail, with some remarks to show how the axioms are used to develop formally the set theory used in the various other units.","PeriodicalId":114605,"journal":{"name":"Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Zermelo–Fraenkel Set Theory\",\"authors\":\"James T Smith\",\"doi\":\"10.1142/9789811201936_0003\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The units on set theory and logic have used ZF set theory without specifying precisely what it is. To investigate which arguments are possible in ZF and which not, you must have a precise description of it. A major question asked during the development of ZF was what system of logic should be used as its framework. Logicians eventually agreed that the framework itself should not depend very much on set-theoretic reasoning. Investigators could then focus on the difficult problems of set theory: there would be little interplay between the framework and the subject under study. During 1920–1940, first-order logic crystallized as a convenient framework for the study of algebraic structures. Applying it does not require use of techniques commonly regarded as set-theoretic. Moreover, the Gödel completeness theorem shows that it encompasses (but doesn't necessarily simulate) many arguments that mathematicians commonly use to prove theorems expressed in a first-order language. Thus, to facilitate investigation of the scope of set theory, it seems appropriate to express it in a first-order language, and restrict it to use logic that is compatible with the first-order framework. When we apply set theory formulated that way, we can highlight the use of its major principles. They're explicitly stated in first-order set-theoretic axioms, and explicitly mentioned in first-order proofs. To be sure, some very elementary parts of set theory are involved in the underlying logical framework, necessary even to formulate those axioms and proofs. But the more powerful set-theoretic principles are displayed conspicuously. ZF is formulated in a first-order theory with minimal apparatus: • countably many variables, which we regard as varying over all sets; • no constants; • no operators; • just two predicates, equality and the binary membership predicate 0. The nonlogical axioms of ZF can be reduced to a small number, as follows. extensionality power set choice separation pair set foundation replacement union infinity The ZF axioms are kept to the minimum number in order to simplify studies of their properties. The list can be pared even further by deriving some axioms from others, but those arguments are uninformative. Each of these axioms is stated below in detail, with some remarks to show how the axioms are used to develop formally the set theory used in the various other units.\",\"PeriodicalId\":114605,\"journal\":{\"name\":\"Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/9789811201936_0003\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/9789811201936_0003","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

集合论和逻辑学的单元使用了ZF集合论,但没有明确说明它是什么。为了研究哪些参数在ZF中是可能的,哪些不是,您必须对它有一个精确的描述。在开发ZF的过程中,一个主要的问题是应该使用什么逻辑系统作为它的框架。逻辑学家最终一致认为,框架本身不应该太依赖于集合论推理。研究人员可以专注于集合论的难题:框架和被研究对象之间几乎没有相互作用。在1920-1940年间,一阶逻辑结晶为代数结构研究的一个方便的框架。应用它并不需要使用通常被认为是集合论的技术。此外,Gödel完备性定理表明,它包含(但不一定模拟)数学家通常用来证明用一阶语言表达的定理的许多论证。因此,为了便于研究集合论的范围,用一阶语言表达集合论似乎是合适的,并将其限制为使用与一阶框架兼容的逻辑。当我们以这种方式应用集合论时,我们可以强调其主要原理的使用。它们在一阶集合论公理中被明确地陈述,并且在一阶证明中被明确地提到。可以肯定的是,集合论的一些非常基本的部分涉及到潜在的逻辑框架,甚至是表述那些公理和证明所必需的。但更强大的集合论原理却得到了显著的展示。ZF用最小装置的一阶理论表示:•可数多个变量,我们认为它们在所有集合上都是变化的;•没有常量;•无操作员;•只有两个谓词,相等和二元成员谓词0。ZF的非逻辑公理可以简化为少量,如下。可拓性幂集选择分离对集基础置换并无穷为了简化对ZF公理性质的研究,ZF公理保持在最小数量。这个列表可以通过从其他公理中推导出一些公理来进一步缩减,但这些论证是没有信息的。下面将详细说明每一个公理,并说明如何使用这些公理来正式发展在各种其他单位中使用的集合论。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Zermelo–Fraenkel Set Theory
The units on set theory and logic have used ZF set theory without specifying precisely what it is. To investigate which arguments are possible in ZF and which not, you must have a precise description of it. A major question asked during the development of ZF was what system of logic should be used as its framework. Logicians eventually agreed that the framework itself should not depend very much on set-theoretic reasoning. Investigators could then focus on the difficult problems of set theory: there would be little interplay between the framework and the subject under study. During 1920–1940, first-order logic crystallized as a convenient framework for the study of algebraic structures. Applying it does not require use of techniques commonly regarded as set-theoretic. Moreover, the Gödel completeness theorem shows that it encompasses (but doesn't necessarily simulate) many arguments that mathematicians commonly use to prove theorems expressed in a first-order language. Thus, to facilitate investigation of the scope of set theory, it seems appropriate to express it in a first-order language, and restrict it to use logic that is compatible with the first-order framework. When we apply set theory formulated that way, we can highlight the use of its major principles. They're explicitly stated in first-order set-theoretic axioms, and explicitly mentioned in first-order proofs. To be sure, some very elementary parts of set theory are involved in the underlying logical framework, necessary even to formulate those axioms and proofs. But the more powerful set-theoretic principles are displayed conspicuously. ZF is formulated in a first-order theory with minimal apparatus: • countably many variables, which we regard as varying over all sets; • no constants; • no operators; • just two predicates, equality and the binary membership predicate 0. The nonlogical axioms of ZF can be reduced to a small number, as follows. extensionality power set choice separation pair set foundation replacement union infinity The ZF axioms are kept to the minimum number in order to simplify studies of their properties. The list can be pared even further by deriving some axioms from others, but those arguments are uninformative. Each of these axioms is stated below in detail, with some remarks to show how the axioms are used to develop formally the set theory used in the various other units.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信