The theorems above are all about powers of cardinals of uncountable cofinality. By the late 1980's, Shelah had developed techniques, known collectively as {\em PCF theory}, which could also be used to prove theorems about cardinals of countable cofinality. Perhaps most famously, Shelah showed that if $\aleph_\omega$ is a strong limit cardinal, then $2^{\aleph_\omega} < \aleph_{\omega_4}.

This talk is mainly concerned with a transitional paper by Shelah called "On Power of Singular Cardinals" [Shelah 111], which deals only with uncountable cofinalities. In this paper, Shelah gives a proof of the Galvin-Hajnal theorem that uses generic ultrapowers much the same way Silver did. To make it work, Shelah introduces game theoretic techniques for guaranteeing that the generic ultrapowers are sufficiently wellfounded. Shelah uses these methods to obtain new results of the form: if $\aleph_\alpha$ is a singular strong limit cardinal of uncountable cofinality and $\aleph_\alpha$ is small, then $(2^(2^{\aleph_\alpha})^+$ is also small. There are various meanings of {\em small}, for example, {\em less than the least weakly inaccessible}.