# Difference between revisions of "Set theory"

(Robot: Capitalize "Set theory" category) |
|||

Line 19: | Line 19: | ||

<References/> | <References/> | ||

− | [[Category: | + | [[Category:Set Theory]] |

## Revision as of 03:57, 22 August 2010

**Set theory** is a branch of mathematics dealing with collections of objects.

- The language of set theory is based on a single fundamental relation, called membership. We say that A is a member of B (in symbols A ∈ B), or that the set B contains A as its element. The understanding is that a set is determined by its elements; in other words, two sets are deemed equal if they have exactly the same elements.
^{[1]}

## History of set theory

It was developed in the late 1800s, primarly by the German mathematician Georg Cantor. This initial attempt became known as "naive set theory" because mathematicians found flaws in it. It was replaced by "axiomatic set theory" in the early 1900s. The most commonly used such axiomatization is Zermelo-Fraenkel set theory.

One paradox in naive set theory was announced by Bertrand Russell in 1901, and is known as Russell's Paradox.

Like all sufficiently strong mathematical theories, set theory is incomplete, as shown by Kurt Godel. However, set theory is the received axiomatization of mathematics today, with subjects like analysis, algebra, topology, and geometry using set theory and its language for their own foundation.

## The Empty Set

The empty set is the set with no members. Because sets are uniquely defined by membership, the empty set is unique. The empty set is usually denoted by {} or ∅.