Boolean algebra in French

(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) 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.)