 \(\PAL\) Reduction Theorem. Given a PAL-friendly theory \(\L\), every F in the language \(\LPAL\) of Public Announcement Logic (without common knowledge) is \(\PAL\)-provably equivalent to a formula \(F^\circ\) coming from the announcement-free fragment of \(\LPAL\).