Expressivity and completeness for public update logics via reduction axioms
Author:
- 1 January 2007
- journal article
- Published by Taylor & Francis in Journal of Applied Non-Classical Logics
- Vol. 17 (2) , 231-253
Abstract
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.Keywords
This publication has 14 references indexed in Scilit:
- Logics for Epistemic ProgramsSynthese, 2004
- A Logic for Suspicious Players: Epistemic Actions and Belief–Updates in GamesBulletin of Economic Research, 2002
- Modal Logic2001
- Propositional belief base update and minimal changeArtificial Intelligence, 1999
- Term Rewriting and All That1998
- Reasoning about Information ChangeJournal of Logic, Language and Information, 1997
- A NEW INTRODUCTION TO MODAL LOGIC1996
- Epistemic Logic for AI and Computer Science1995
- On the difference between updating a knowledge base and revising it1992
- An elementary proof of the completeness of PDLTheoretical Computer Science, 1981