Posets, Hasse Diagrams and Lattices
Partial and total orders, Hasse diagrams as cover relations, minimal and maximal versus least and greatest elements, upper bounds, least upper bound and greatest lower bound, chains, antichains and linear extensions; lattices with join and meet, bounded, distributive, complemented and Boolean lattices, divisor lattices and the square-free test, complements and their uniqueness, sublattices versus subsets that are lattices, and the M3 and N5 test for distributivity, with a four-panel Hasse diagram.
