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 , or $\mathbb.$

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.

Generalizations

The Boolean domain can be replaced by the unit interval , in which case rather than only taking values 0 or 1, any value between and including 0 and 1 can be assumed. Algebraically, negation (NOT) is replaced with $1-x,$ conjunction (AND) is replaced with multiplication ($xy$), and disjunction (OR) is defined via De Morgan's law to be $1-(1-x)(1-y)=x+y-xy$.

Interpreting these values as logical truth values yields a multi-valued logic, which forms the basis for fuzzy logic and probabilistic logic. In these interpretations, a value is interpreted as the "degree" of truth – to what extent a proposition is true, or the probability that the proposition is true.

See also

* Boolean-valued function
* GF(2)

References

Further reading

*
https://m.tau.ac.il/~ilia1/publications/rpbd_book.pdf draft version -->
(xxx+428 pages

(NB. Contains extended versions of the best manuscripts from the 10th International Workshop on Boolean Problems held at the Technische Universität Bergakademie Freiberg, Germany on 2012-09-19/21.)
* (xxxv+1+445+1 pages

(NB. Contains extended versions of the best manuscripts from the 11th International Workshop on Boolean Problems held at the Technische Universität Bergakademie Freiberg, Germany on 2014-09-17/19.)
*

(xli+1+494 pages

(NB. Contains extended versions of the best manuscripts from the 12th International Workshop on Boolean Problems held at the Technische Universität Bergakademie Freiberg, Germany on 2016-09-22/23.)
* (vii+265+7 pages

(NB. Contains extended versions of the best manuscripts from the 13th International Workshop on Boolean Problems (IWSBP 2018) held at the University of Bremen, Bremen, Germany on 2018-09-19/21.)
* (vii+1+197+5 pages

(NB. Contains extended versions of the best manuscripts from the 14th International Workshop on Boolean Problems (IWSBP 2020) held COVID-19, virtually on 2020-09-24/25.)
* (xxii+231+1 pages)
* {{cite book , editor-first1=Rolf , editor-last1=Drechsler , editor-link1=Rolf Drechsler , editor-first2=Sebastian , editor-last2=Huhn , title=Advanced Boolean Techniques - Selected Papers from the 15th International Workshop on Boolean Problems , publisher= Springer Nature Switzerland AG , publication-place=Cham, Switzerland , location=Bremen, Germany , edition=1 , date=2023-05-30 , isbn=978-3-031-28915-6 , doi=10.1007/978-3-031-28916-3 (viii+172+6 pages

(NB. Contains extended versions of the best manuscripts from the 15th International Workshop on Boolean Problems (IWSBP 2022) held at the University of Bremen, Bremen, Germany on 2022-09-22/23.)

Boolean algebra