A Theory of Sets
A Theory of Sets
复制标题
集合论
DOI：
--
复制
发表时间：
1993
期刊：
影响因子：
--
通讯作者：
F. Schneider
中科院分区：
文献类型：
--
作者：
D. Gries;F. Schneider
我们将集合论定义为谓词演算的扩展。一个集合就是一组不同的元素。集合的例子有整数的集合、棕色奶牛的集合和计算机科学系的集合。集合是数学的基石，也是计算机科学的重要组成部分，在人工智能、数据库和编程语言等领域都有应用。对集合的研究引出了许多关于无穷大是否存在的问题。因此，虽然看起来很简单，但集合论是一个丰富的智力游戏场。
We define set theory as an extension of predicate calculus. A set is simply a collection of distinct (different) elements. Examples of sets are the set of integers, the set of brown cows, and the set of computer science departments. A cornerstone of mathematics, the set is also an essential ingredient of computer science and finds application in areas such as artificial intelligence, databases, and programming languages. The study of sets leads to questions about the existence of many kinds of infinities. Thus, while appearing simple, set theory is a rich intellectual playground.