## Logic functions, truth tables, and switches

- NOT, AND, OR, NAND, NOR, XOR, . . .
- minimal set

## Axioms and theorems of Boolean algebra

- proofs by re-writing
- proofs by perfect induction

## Gate logic

- networks of Boolean functions
- time behavior

## Canonical forms

- two-level
- incompletely specified functions

## Simplification

- Boolean cubes and Karnaugh maps
- two-level simplification

Next slide | Back to first slide | View graphic version |