Basic on propositional calculus, DNF and CNF formulae, complete set of connectives
Three methods to see if a formula A is a tautology: truth-tables, Quine's method, and analysing what are the consequences of A = 0
Definition of Boolean algebra, and simplification rules. Example of simplification of a circuit for addition using the laws of Boolean algebra.
Last modified: Mon May 22 20:56:46 MET DST 2000