(algebra, logic, computing) Any function based on the operations AND, OR and NOT, and whose elements are from the domain of Boolean algebra

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

plural of Boolean function

plural of Boolean variable

(algebra) The lattice corresponding to a Boolean algebra.

Alternative letter-case form of Boolean

Alternative letter-case form of Boolean

plural of boolean

plural of Boolean ring

(algebra) A ring whose multiplicative operation is idempotent.