Expressivity and completeness for public update logics via reduction axioms

In this paper, we present several extensions of epistemic logic with update operators modelling public information change. Next to the well-known public announcement operators, we also study public substitution operators. We prove many of the results regarding expressivity and completeness using so-called reduction axioms. We develop a general method for using reduction axioms and apply it to the logics at hand.

• Type: Journal
• Year: 2007
• Where: JANCL
• Authors: Barteld P. Kooi
• Keywords: JANCL 2007, Public Substitution Operators, Reduction Axioms, So-called Reduction Axioms