Set-builder notation (nonfiction): Difference between revisions
Jump to navigation
Jump to search
(Created page with "In [[set theory and its applications to logic, mathematics, and Computer science (nonfiction)...") |
No edit summary |
||
| Line 1: | Line 1: | ||
In | In [[Set theory (nonfiction)|set theory]] and its applications to [[Logic (nonfiction)|logic]], [[Mathematics (nonfiction)|mathematics]], and [[Computer science (nonfiction)|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'''. | Defining sets by properties is also known as '''set comprehension''', '''set abstraction''', or as defining a set's '''intension'''. | ||
| Line 18: | Line 18: | ||
* [[Algorithm (nonfiction)]] | * [[Algorithm (nonfiction)]] | ||
* [[Computer science (nonfiction)]] | |||
* [[Logic (nonfiction)]] | * [[Logic (nonfiction)]] | ||
* [[Mathematics (nonfiction)]] | * [[Mathematics (nonfiction)]] | ||
Revision as of 17:31, 5 December 2017
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.
In the News
Fiction cross-reference
Nonfiction cross-reference
- Algorithm (nonfiction)
- Computer science (nonfiction)
- Logic (nonfiction)
- Mathematics (nonfiction)
- Set theory (nonfiction)
External links:
- Set-builder notation @ Wikipedia