北京邮电大学--计算机学院--离散数学-2.1--Sets.pptVIP

北京邮电大学--计算机学院--离散数学-2.1--Sets.ppt

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
北京邮电大学--计算机学院--离散数学-2.1--Sets.ppt

* With Venn diagrams, you can see that one set is a subset of another just by seeing that you can draw an enclosure around its members that fits completely inside an enclosure drawn around the larger set’s members. * Sometimes people also define “bags”, which are unordered collections in which duplicates matter. If you have a bag of coins, they are in no particular order, but it matters how many coins of each type you have. College of Computer Science Technology, BUPT Yang Juan yangjuan@bupt.edu.cn College of Computer Science Technology Beijing University of Posts Telecommunications Sets * * College of Computer Science Technology, BUPT Introduction to Set Theory A set is a new type of structure, representing an unordered collection (group, plurality) of zero or more distinct (different) objects. Set theory deals with operations between, relations among, and statements about sets. Sets are ubiquitous in computer software systems. All of mathematics can be defined in terms of some form of set theory (using predicate logic). * * College of Computer Science Technology, BUPT Sets(集合) A set is a collection or group of objects(对象) or elements(元素) or members(成员). (Cantor 1895) A set is said to contain(包含) its elements. There must be an underlying universal set(全集) U, either specifically stated or understood. * * College of Computer Science Technology, BUPT Notation list the elements between braces: S = {a, b, c, d}={b, c, a, d, d} (Note: listing an object more than once does not change the set. Ordering means nothing.) * * College of Computer Science Technology, BUPT Notation specification by predicates(谓词): S= {x| P(x)}, P(x) denote a sentence or statement P concerning the variable object x. S contains all the elements from U which make the predicate P true. * * College of Computer Science Technology, BUPT Notation brace notation with ellipses: S = { . . . , -3, -2, -1}, the negative integers. * * College of Computer Science Technology, BUPT Notation x

文档评论(0)

heroliuguan + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

版权声明书
用户编号:8073070133000003

1亿VIP精品文档

相关文档