We will define the notion of noetherianity for a partially ordered
set. After seeing various characterizations of noetherianity, we will connect
this to the noetherianity of rings. Finally, we will prove Higman's Lemma,
which is a powerful tool to produce new noetherian posets out of existing
ones. Higman's Lemma is extensively used in computer science, but has recently
been used to prove the noetherianity of many large algebraic structures. Speaker(s): Karthik Ganapathy (UM)