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},[1][2][3][4][5] or [6][7]
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 data type 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, and all variables that can take these values can also take any other numerical values.
- ^ Cite error: The named reference
vanDalen_2004was invoked but never defined (see the help page). - ^ Cite error: The named reference
Makinson_2008was invoked but never defined (see the help page). - ^ Cite error: The named reference
Boolos-Jeffrey_1980was invoked but never defined (see the help page). - ^ Cite error: The named reference
Mendelson_1997was invoked but never defined (see the help page). - ^ Cite error: The named reference
Hehner_2010was invoked but never defined (see the help page). - ^ Cite error: The named reference
Parberry_1994was invoked but never defined (see the help page). - ^ Cite error: The named reference
Cortadella-Kishinevsky-Kondratyev-Lavagno-Yakovlev_2002was invoked but never defined (see the help page).