Set theory: Difference between revisions
Jump to navigation
Jump to search
imported>Howard C. Berkowitz No edit summary |
imported>Howard C. Berkowitz No edit summary |
||
| Line 5: | Line 5: | ||
| edition = 2nd | | edition = 2nd | ||
| year = 1957 | | year = 1957 | ||
| publisher = Chelsea Publishing}}</ref> and a range of operations on those sets, such as [[function (mathematics)|functions]], [[relation (mathematics)|relations]], [[union (set theory)|union]], and [[intersection (set theory)|intersection]]. [[Georg Cantor]] is usually credited with its invention. | | publisher = Chelsea Publishing}}</ref> and a range of operations on those sets, such as [[function (mathematics)|functions]], [[relation (mathematics)|relations]], [[union (set theory)|union]], and [[intersection (set theory)|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]].<ref>{{citation | It has a wide range of applications in [[computer science]], where it is often considered a subset of [[discrete mathematics]].<ref>{{citation | ||
Revision as of 17:08, 17 June 2009
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]