Boolean algebra

Betekenis (Engels)

1. An algebraic structure (Σ,∨,∧,∼,0,1) where ∨ and ∧ are idempotent binary operators, ∼ is a unary involutory operator (called "complement"), and 0 and 1 are nullary operators (i.e., constants), such that (Σ,∨,0) is a commutative monoid, (Σ,∧,1) is a commutative monoid, ∧ and ∨ distribute with respect to each other, and such that combining two complementary elements through one binary operator yields the identity of the other binary operator. (See Boolean algebra (structure)#Axiomatics.)
2. Specifically, an algebra in which all elements can take only one of two values (typically 0 and 1, or "true" and "false") and are subject to operations based on AND, OR and NOT
3. The study of such algebras; Boolean logic, classical logic.

Concepten

Booleaanse algebra

Synoniemen

Boolean logic

algebra of logic

boolean

logic algebra

logical algebra

Etymologie (Engels)

Named after George Boole (1815–1864), an English mathematician, educator, philosopher and logician.