# Boolean Set

A Boolean Set is a set that is composed of boolean values.

**Context:**- It can be a Binary Set

**See:** Boolean Relation, Boolean Function, Boolean Algebra, True, False.

## References

### 2016

- (Wikipedia, 2015) ⇒ https://www.wikiwand.com/en/Boolean_domain Retrieved: 06-06-2016
- In mathematics and abstract algebra, a
**Boolean domain**is a set consisting of exactly two elements whose interpretations include*false*and*true*. In logic, mathematics and theoretical computer science, a Boolean domain is usually written as {0, 1},{false, true}, {F, T}, [math]\displaystyle{ \left \{ \bot,\top \right \} }[/math] or [math]\displaystyle{ \mathbb{B}. }[/math]The algebraic structure that naturally builds on a Boolean domain is the Boolean algebra with two elements. The initial object in the category of bounded lattices is a Boolean domain.

In computer science, a Boolean variable is a variable that takes values in some Boolean domain. Some programming languages feature reserved words or symbols for the elements of the Boolean domain, for example

`false`

and`true`

. However, many programming languages do not have a Boolean datatype in the strict sense. In C or BASIC, for example, falsity is represented by the number 0 and truth is represented by the number 1 or −1 respectively, and all variables that can take these values can also take any other numerical values.

- In mathematics and abstract algebra, a

### 1999

- (Wolfram Mathworld , 1999) ⇒ http://mathworld.wolfram.com/Booleans.html Retrieved: 06-06-2016
- The domain of Booleans, sometimes denoted B, consisting of the elements True and False, implemented in the Wolfram Language as Booleans. In the Wolfram Language, a quantity can be tested to determine if it is in the domain of Booleans using Element[e, Booleans].