Surf Wiki
Save to docs
general/boolean-algebra

From Surf Wiki (app.surf) — the open knowledge base

Boolean domain

Concept in mathematical logic

Concept in mathematical logic

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}, or \mathbb{B}.

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 {0, 1} 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.

References

References

  1. (2004). "Logic and Structure". Springer.
  2. (2008). "Sets, Logic and Maths for Computing". Springer.
  3. (1980). "Computability and Logic". [[Cambridge University Press]].
  4. (1997). "Introduction to Mathematical Logic". [[Chapman & Hall]]/CRC.
  5. (2010). "A Practical Theory of Programming". Springer.
  6. (1994). "Circuit Complexity and Neural Networks". [[MIT Press]].
  7. (2002). "Logic Synthesis for Asynchronous Controllers and Interfaces". [[Springer-Verlag Berlin Heidelberg New York]].
Info: Wikipedia Source

This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.

boolean-algebra
Want to explore this topic further?

Ask Mako anything about Boolean domain — get instant answers, deeper analysis, and related topics.

Research with Mako

Free with your Surf account

Content sourced from Wikipedia, available under CC BY-SA 4.0.

This content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.

Report