Difference between revisions of "Boolean domain"
Karl Jones (Talk | contribs) (Created page with "In mathematics and abstract algebra, a '''Boolean domain''' is a set consisting of exactly two elements whose interpretations include false and true. In logic, mathema...") |
Karl Jones (Talk | contribs) (→External links) |
||
| Line 21: | Line 21: | ||
| − | [[Category: | + | [[Category:Mathematics]] |
Latest revision as of 11:47, 16 October 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}, etc.
Description
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.
See also
External links
- Boolean domain @ Wikipedia
