How to Agree without Understanding Each Other: Public Announcement Logic with Boolean Definitions

  title={How to Agree without Understanding Each Other: Public Announcement Logic with Boolean Definitions},
  author={Malvin Gattinger and Yanjing Wang},
In standard epistemic logic, knowing that p is the same as knowing that p is true, but it does not say anything about understanding p or knowing its meaning. In this paper, we present a conservative extension of Public Announcement Logic (PAL) in which agents have knowledge or belief about both the truth values and the meanings of propositions. We give a complete axiomatization of PAL with Boolean Definitions and discuss various examples. An agent may understand a proposition without knowing… 

Figures from this paper


A logic for reasoning about ambiguity
Logics of public communications
Extensions of the logic S5 which can deal with public communications are defined and some completeness, decidability and interpretability results are proved and a general method is formulated that solves certain kind of problems involving public communications.
Knowing That, Knowing What, and Public Communication: Public Announcement Logic with Kv Operators
It is shown that in the setting of PAL, replacing the Kv operator with its generalized version does not increase the expressive power of the resulting logic, so it is suggested that the more flexible generalization can be used instead of the original PAL+Kv.
Hidden protocols: Modifying our expectations in an evolving world
On axiomatizations of public announcement logic
By designing non-standard Kripke semantics for the language of PAL, it is shown that the proof system based on this core set of axioms does not completely axiomatize PAL  without additional axiom and rules.
Epistemic Logic with Functional Dependency Operator
This paper proposes a new operator Kf to express knowledge of the functional dependencies between variables, and axiomatizes three such logics in a single agent setting by allowing the function domain to vary relative to different agents and possible worlds.
Knowing Values and Public Inspection
A sound and strongly complete axiomatization for the single and multi-agent case, making use of the well-known Armstrong axioms for dependencies in databases.
To Know is to Know the Value of a Variable
  • A. Baltag
  • Mathematics
    Advances in Modal Logic
  • 2016
An epistemic logic that can express knowledge of a dependency between variables (or complex terms) is developed and it is proved completeness, decidability and finite model property.
Sequent Systems for Nondeterministic Propositional Logics without Reflexivity
This work introduces nondeterministic semantics for propositional logic with an arbitrary set C of connectives and introduces a cut-free sequent style proof system S C that is sound and complete for the given semantics.
Reasoning About Agent Types and the Hardest Logic Puzzle Ever
A simple formal language to specify types of agents in terms of necessary conditions for their announcements is proposed and a spectrum of new puzzles based on HLPE is proposed by considering subjective (knowledge-based) agent types and relaxing the implicit epistemic assumptions in the original puzzle.