Set theory

From Citizendium
Revision as of 17:08, 17 June 2009 by imported>Howard C. Berkowitz
Jump to navigation Jump to search
This article has a Citable Version.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article has an approved citable version (see its Citable Version subpage). While we have done conscientious work, we cannot guarantee that this Main Article, or its citable version, is wholly free of mistakes. By helping to improve this editable Main Article, you will help the process of generating a new, improved citable version.

Set theory is a branch of mathematics that deals with the grouping of objects into sets, the definition of membership in sets,[1] and a range of operations on those sets, such as functions, relations, union, and intersection. Georg Cantor is usually credited with its invention.

It has a wide range of applications in computer science, where it is often considered a subset of discrete mathematics.[2]

References

  1. Felix Hausdorff (1957), Set Theory (2nd ed.), Chelsea Publishing
  2. J.P. Tremblay, R. Manohar (1975), Discrete Mathematical Structures with Applications to Computer Science, McGraw-Hill