What you'll learn

35 lessons in Boolean algebra & logic

Boolean operations & lawsTruth tables & expressionsLogic gatesKarnaugh mapsSequential circuits & flip-flopsHalf/full addersQuine-McCluskey minimizationMultiplexers & demultiplexersDecoders & encodersFinite state machinesALU designBinary decision diagrams (BDDs)SAT solvers & DPLLModal & temporal logicBoolean satisfiability variantsProof: NAND is universalProof: XOR cannot be 2-level OR-of-ANDs without negationCombinational vs sequential designFirst-order logic & resolutionShannon expansion & cofactorsFunctional completeness & Post's theoremAlgebraic normal form (Reed–Muller)Threshold logic & linear separabilityMonotone & symmetric functionsTwo's complement & binary arithmeticGray codesHazards in combinational circuitsFourier analysis of Boolean functionsSensitivity & decision-tree complexityCircuit size, depth & lower boundsNonlinearity & bent functionsHamming distance & error-correcting codesLinear feedback shift registersCarry-lookahead & fast addersReversible & Toffoli gates

How Erudia teaches

Built to be understood — and remembered.

Every idea is taught with motivation and a worked example before the drills, and an FSRS spaced-repetition engine schedules each review for the day its model predicts you would forget it. A short placement check finds what you already know, so you start Boolean algebra & logic exactly where it's useful.

Start Boolean algebra & logic →

Related Discrete Mathematics subjects

Combinatorics Graph theory Order Theory Diophantine Approximation Algebraic Number Theory Discrete Math