Set-builder notation (nonfiction)

{\displaystyle \{n\in \mathbb {Z} \mid (\exists k\in \mathbb {Z} )[n=2k]\

|source = The set of all even integers, 
 expressed in set-builder notation.

}} In set theory and its applications to logic, mathematics, and computer science, set-builder notation is a mathematical notation for describing a set by enumerating its elements or stating the properties that its members must satisfy.

Defining sets by properties is also known as set comprehension, set abstraction, or as defining a set's intension.

Set-builder notation is sometimes simply referred to as set notation, although this phrase may be better reserved for the broader class of means of denoting sets.

Fiction cross-reference

• Gnomon algorithm
• Mathematics

Nonfiction cross-reference

• Algorithm (nonfiction)
• Computer science (nonfiction)
• Logic (nonfiction)
• Mathematics (nonfiction)
• Set theory (nonfiction)

External links:

• Set-builder notation @ Wikipedia