Boolean Algebra
Boolean algebra is the algebra of two-valued logic used to describe and simplify digital circuits. Variables take values in 0,1; the operations AND, OR and NOT correspond to series switches, parallel switches and inversion.
Digital Logic · topic
Boolean algebra
Laws and theorems with their duals, De Morgan, absorption, consensus, XOR algebra and algebraic simplification; minterms and maxterms, canonical SOP and POS, duals and complements in index form; counting Boolean, self-dual and other function classes; functional completeness by Post's five classes, NAND and NOR realisations and minimum gate counts.
Study this topic
Canonical Forms and Functional Completeness
Every Boolean function has two canonical representations that are unique up to term order: the sum of minterms (canonical SOP) and the product of maxterms (canonical POS).
Boolean algebra cheat sheets
One-page visual sheets for this topic, in the sheet library on the store. Previews are free; the full sheets come with the subject pack.