Boolean Domain
   HOME

TheInfoList



OR:

In
mathematics Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
and
abstract algebra In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures. Algebraic structures include group (mathematics), groups, ring (mathematics), rings, field (mathematics), fields, module (mathe ...
, a Boolean domain is a
set Set, The Set, SET or SETS may refer to: Science, technology, and mathematics Mathematics *Set (mathematics), a collection of elements *Category of sets, the category whose objects and morphisms are sets and total functions, respectively Electro ...
consisting of exactly two elements whose interpretations include ''false'' and ''true''. In
logic Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the science of deductively valid inferences or of logical truths. It is a formal science investigating how conclusions follow from premises ...
, mathematics and
theoretical computer science Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, lambda calculus, and type theory. It is difficult to circumsc ...
, 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 category theory, a branch of mathematics, an initial object of a category is an object in such that for every object in , there exists precisely one morphism . The dual notion is that of a terminal object (also called terminal element): ...
in the
category Category, plural categories, may refer to: Philosophy and general uses *Categorization, categories in cognitive science, information science and generally * Category of being * ''Categories'' (Aristotle) * Category (Kant) * Categories (Peirce) ...
of
bounded lattice A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra. It consists of a partially ordered set in which every pair of elements has a unique supremum (also called a least upper boun ...
s is a Boolean domain. In
computer science Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to Applied science, practical discipli ...
, a Boolean variable is a
variable Variable may refer to: * Variable (computer science), a symbolic name associated with a value and whose associated value may be changed * Variable (mathematics), a symbol that represents a quantity in a mathematical expression, as used in many ...
that takes values in some Boolean domain. Some
programming language A programming language is a system of notation for writing computer programs. Most programming languages are text-based formal languages, but they may also be graphical. They are a kind of computer language. The description of a programming ...
s feature
reserved word In a computer language, a reserved word (also known as a reserved identifier) is a word that cannot be used as an identifier, such as the name of a variable, function, or label – it is "reserved from use". This is a syntactic definition, and a re ...
s 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 computer science, the Boolean (sometimes shortened to Bool) is a data type that has one of two possible values (usually denoted ''true'' and ''false'') which is intended to represent the two truth values of logic and Boolean algebra. It is named ...
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 mathematics, the unit interval is the closed interval , that is, the set of all real numbers that are greater than or equal to 0 and less than or equal to 1. It is often denoted ' (capital letter ). In addition to its role in real analysis, ...
, 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 In propositional logic and Boolean algebra, De Morgan's laws, also known as De Morgan's theorem, are a pair of transformation rules that are both valid rules of inference. They are named after Augustus De Morgan, a 19th-century British mathem ...
to be 1-(1-x)(1-y)=x+y-xy. Interpreting these values as logical
truth value In logic and mathematics, a truth value, sometimes called a logical value, is a value indicating the relation of a proposition to truth, which in classical logic has only two possible values (''true'' or '' false''). Computing In some progr ...
s yields a
multi-valued logic Many-valued logic (also multi- or multiple-valued logic) refers to a propositional calculus in which there are more than two truth values. Traditionally, in Aristotle's logical calculus, there were only two possible values (i.e., "true" and "false ...
, which forms the basis for fuzzy logic and
probabilistic logic Probabilistic logic (also probability logic and probabilistic reasoning) involves the use of probability and logic to deal with uncertain situations. Probabilistic logic extends traditional logic truth tables with probabilistic expressions. A diffic ...
. 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 A Boolean-valued function (sometimes called a predicate or a proposition) is a function of the type f : X → B, where X is an arbitrary set and where B is a Boolean domain, i.e. a generic two-element set, (for example B = ), whose elements are i ...
*
GF(2) (also denoted \mathbb F_2, or \mathbb Z/2\mathbb Z) is the finite field of two elements (GF is the initialism of ''Galois field'', another name for finite fields). Notations and \mathbb Z_2 may be encountered although they can be confused with ...


References


Further reading

*

(455 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.) * (480 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.) *

(536 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 in Bremen, Germany on 2018-09-19/21.) * {{cite book , editor-first1=Rolf , editor-last1=Drechsler , editor-link1=Rolf Drechsler , editor-first2=Daniel , editor-last2=Große , title=Recent Findings in Boolean Techniques - Selected Papers from the 14th International Workshop on Boolean Problems , publisher= Springer Nature Switzerland AG , edition=1 , date=2021-04-30 , isbn=978-3-030-68070-1 , doi= (204 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.) Boolean algebra