Boolean algebra is the study of truth values (true or false) and how many of these values can be related under certain constraints. Wolfram|Alpha works with Boolean algebra by computing truth tables, finding normal forms, constructing logic circuits and more.
Perform Boolean algebra by computing various properties and forms and generating various diagrams.
Analyze a Boolean expression:
Visualize the logic circuit of an arbitrary Boolean expression.
Compute a logic circuit for a Boolean function:
Generate full truth tables for a Boolean function of many Boolean variables.
Compute a truth table for a Boolean function:
Calculate various normal forms of a Boolean expression.
Convert a Boolean expression to disjunctive normal form:
Convert a Boolean expression to conjunctive normal form:
Convert a Boolean expression to algebraic normal form:
Compute with Boolean functions specified by an integer index and the number of variables.