FDs, Closure and Candidate Keys
What a functional dependency asserts, trivial and non-trivial FDs; Armstrong's axioms with the derived union, decomposition and pseudo-transitivity rules, and the rule that a left side never splits; the attribute-closure algorithm and the membership test; a routine that finds every candidate key from the attributes that appear on no right side; six relations with their keys and prime attributes computed by script; and the counts of all, trivial and non-trivial FDs on n attributes.
