Expressivity and completeness for public update logics via reduction axioms