Boolean function

A Boolean function maps an ordered tuple of binary values to a single binary value. Its inputs and output are usually represented as 0 and 1 or false and true.

Boolean algebra: An algebraic system for reasoning about values and operations that represent truth or binary states. Its operations provide the standard language for expressing and manipulating Boolean functions.
AND gate: A logic gate that outputs 1 only when all its inputs are 1. Conjunction is one of the basic operations used to build Boolean functions.
Combinational logic: Digital logic whose outputs depend only on its current inputs. Each output of a combinational circuit is a Boolean function of its inputs.
Boolean formula: A syntactic expression formed from Boolean variables and logical operations. A formula is one representation of a function, but distinct formulas can compute the same function.
Truth table: A table listing a function’s output for every possible combination of its inputs. A truth table gives the complete behavior of a Boolean function in explicit form.
OR gate: A logic gate that outputs 1 when at least one input is 1. Disjunction supplies a basic way to combine conditions within a Boolean function.
Multiplexer: A circuit that selects one of several data inputs according to control inputs. Its output is a Boolean function that encodes selection among input values.
Boolean relation: A relation on binary tuples that may associate an input with zero, one, or multiple outputs. Unlike a Boolean function, a relation need not assign exactly one output to every input.
Boolean variable: A variable whose value belongs to the two-element set of binary values. Each input position in a Boolean function is represented by a Boolean variable.
NOT gate: A logic gate that reverses its binary input. Negation lets a Boolean function distinguish an input from its complement.

Linked from 12 pages