Boolean Algebra
Boolean Algebra
analyze a Boolean expression
P and not Q
P && (Q || R)
Truth Tables
compute a truth table for a Boolean function
truth table p xor q xor r xor s
Logic Circuits
compute a logic circuit for a Boolean function
logic circuit (p or ~q) and (r xor s)
Normal Forms
convert a Boolean expression to disjunctive normal form
DNF (P || Q || R) && (~P || ~Q)
convert a Boolean expression to conjunctive normal form
CNF (P && ~Q) || (R && S) || (Q && R && ~S)
convert a Boolean expression to algebraic normal form
ANF (~P || Q) && (P || ~Q)
General Boolean Functions
specify a Boolean function by number
11th Boolean function of 2 variables
129th Boolean function of x,y,z
specify a minterm or maxterm by number