On generation of posets and lattices having finite bounded chains —
2001
The most famous representation theorem for finite distributive lattices is the one by Birkhoff: Every finite poset (A, <) uniquely determines a finite distributive lattice whose poset of meet-irreducible elements is isomorphic to (A, <).