SUPPORT THE WORK

# GetWiki

### boolean domain

ARTICLE SUBJECTS
news  →
unix  →
wiki  →
ARTICLE TYPES
feed  →
help  →
wiki  →
ARTICLE ORIGINS
boolean domain
[ temporary import ]
- the content below is remote from Wikipedia
- it has been imported raw for GetWiki
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},Dirk van Dalen, Logic and Structure. Springer (2004), page 15.David Makinson, Sets, Logic and Maths for Computing. Springer (2008), page 13.George S. Boolos and Richard C. Jeffrey, Computability and Logic. Cambridge University Press (1980), page 99. {false,â€‰true}, {F,â€‰T},Elliott Mendelson, Introduction to Mathematical Logic (4th. ed.). Chapman & Hall/CRC (1997), page 11. left { bot,top right }Eric C. R. Hehner, A Practical Theory of Programming. Springer (1993, 2010), page 3. or mathbb{B}.BOOK, Ian Parberry, Circuit Complexity and Neural Networks, 1994, MIT Press, 978-0-262-16148-0, 65, BOOK, Jordi Cortadella, Logic Synthesis for Asynchronous Controllers and Interfaces, 2002, Springer Science & Business Media, 978-3-540-43152-7, 73, etal, 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, and all variables that can take these values can also take any other numerical values.

## Generalizations

The Boolean domain {0,â€‰1} can be replaced by the unit interval {{closed-closed|0,1}}, 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).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.

## Notes

{{reflist}}{{Mathlogic-stub}}

- content above as imported from Wikipedia
- "boolean domain" does not exist on GetWiki (yet)
- time: 7:19pm EDT - Mon, Sep 24 2018
[ this remote article is provided by Wikipedia ]
LATEST EDITS [ see all ]
GETWIKI 09 MAY 2016
GETWIKI 18 OCT 2015
M.R.M. Parrott
Biographies
GETWIKI 20 AUG 2014
GETWIKI 19 AUG 2014
GETWIKI 18 AUG 2014
Wikinfo
Culture
CONNECT