  Browse examples

# Boolean Algebra

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.

Boolean Algebra

Perform Boolean algebra by computing various properties and forms and generating various diagrams.

Analyze a Boolean expression:

More examples

Truth Tables

Generate full truth tables for a Boolean function of many Boolean variables.

Compute a truth table for a Boolean function:

More examples

Logic Circuits

Visualize the logic circuit of an arbitrary Boolean expression.

Compute a logic circuit for a Boolean function:

More examples

Normal Forms

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:

More examples

General Boolean Functions

Compute with Boolean functions specified by an integer index and the number of variables.

Specify a Boolean function by number:

Specify a minterm or maxterm by number:

More examples