 \(\EAL\) Reduction Theorem (Baltag, Moss, and Solecki 1998, 1999; see also Baltag and Moss 2004). Given an action-friendly logic \(\L\), every F in the language \(\LEAL\) of Epistemic Action Logic (without common knowledge) is \(\EAL\)-provably equivalent to a formula \(F^\circ\) coming from the action model-free modal language \eqref{ML}.