Boolean domain

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.

  1. ^ Cite error: The named reference vanDalen_2004 was invoked but never defined (see the help page).
  2. ^ Cite error: The named reference Makinson_2008 was invoked but never defined (see the help page).
  3. ^ Cite error: The named reference Boolos-Jeffrey_1980 was invoked but never defined (see the help page).
  4. ^ Cite error: The named reference Mendelson_1997 was invoked but never defined (see the help page).
  5. ^ Cite error: The named reference Hehner_2010 was invoked but never defined (see the help page).
  6. ^ Cite error: The named reference Parberry_1994 was invoked but never defined (see the help page).
  7. ^ Cite error: The named reference Cortadella-Kishinevsky-Kondratyev-Lavagno-Yakovlev_2002 was invoked but never defined (see the help page).

© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search