Boolean algebra englannista kaikille kielille

Kieli	Käännökset
japani	ブール代数 (Būru-daisū / būrudaisū)
ranska	algèbre de Boole, algèbre booléenne
ruotsi	Boolesk algebra
saksa	boolesche Algebra
tšekki	Booleova algebra, booleovská algebra
unkari	Boole-algebra
venäjä	булева алгебра (buleva algebra)

(algebra) An algebraic structure $(\Sigma ,\vee ,\wedge ,\sim ,0,1)$ where $\vee$ and $\wedge$ are idempotent binary operators, $\sim$ is a unary involutory operator (called "complement"), and 0 and 1 are nullary operators (i.e., constants), such that $(\Sigma ,\vee ,0)$ is a commutative monoid, $(\Sigma ,\wedge ,1)$ is a commutative monoid, $\wedge$ and $\vee$ 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.)
(algebra, logic, computing) 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
(mathematics) The study of such algebras; Boolean logic, classical logic.

The set of divisors of 30, with binary operators: g.c.d. and l.c.m., unary operator: division into 30, and identity elements: 1 and 30, forms a Boolean algebra.
The nodes Ni of a Boolean lattice can be labeled with Boolean formulae F(Ni), such that if node C is the meet of nodes A and B, then F(C) = F(A)F(B); if node C is the join of nodes A and B, then F(C) = F(A)+F(B); if node C is the complement of node A, then F(C) = F(A)'; and the '≤' order relation corresponds to logical entailment. A set of 'n' Boolean formulae could be called a "basis" for a 2n-element Boolean algebra iff they are all mutually disjoint (i.e., the product of any pair is 0) and their Σ (collective sum) is equal to 1. A set S of formulae could then generate a Boolean algebra inductively as follows: (base step) let P0 = S ∪ {(ΣS)'}, (inductive step) if a pair of formulae F and G in Pi are non-disjoint (i.e., FG≠0), then let Pi+1 = (Pi ∪ {FG, F'G, FG'}) \ {F, G}, otherwise Pi is a basis. If CARD(Pi)=n then the Boolean algebra will have 2n elements which are all "linear combinations" of the basis elements, with a coefficient of either 0 or 1 for each term of each linear combination.

Monikko

Sanakirja.org