Overview
set
Quick Reference
x ∈ S
x ∉ S
NOT (x ∈ S)
{Ada, Pascal, Cobol, C}
is possible; the members are separated by commas and here are just the names of various programming languages. When the number of elements is not finite, the set is said to be infinite and explicit enumeration of the elements is not then possible.
Infinite and finite sets can be described using a predicate or statement such as p(x) that involves x and is either true or false, thus{x | p(x)} This is read as “the set of all elements x for which p(x) is true”, the elements being characterized by the common property p. Examples of sets described in this way are (letting R be the set of real numbers): {(x,y) | x ∈ R, y ∈ R and x + y = 9}{n | n is a prime number}{l | l is the name of a language}There is an implicit assumption here that there is some algorithm for deciding whether p(x) is true or false in any particular case.
{x | p(x)}
{(x,y) | x ∈ R, y ∈ R and x + y = 9}
{n | n is a prime number}
{l | l is the name of a language}
The idea of a set is fundamental to mathematics. It forms the basis for all ideas involving functions, relations, and indeed any kind of algebraic structure. Authors differ considerably in the way they define sets. A mathematical logician will distinguish carefully between classes and sets, basically to ensure that paradoxes such as Russell's paradox cannot occur in sets. However, the informal definition is adequate for most purposes.
See also operations on sets.
From: set in A Dictionary of Computing »
