Title: The Completeness of PALKv
Speaker: Bo Hong (PKU)
on top of the axioms of 
, while it was also mentioned that it is not known whether the augmented valid schemata gives a complete axiomatization of PALKv. However, it is proven in [Wang and Fan, 2013] that the schemata proposed in [Plaza, 1989] do not axiomatize PALKv completely. But, by considering an alternative relativized knowing value operator (
), it could shown that the language of PALKv, PALKv
and ELKv are equally expressive and the latter two (where only one agent considered) can be axiomatized completely. This presentation would focus on proving the completeness of PALKv
(where only one agent was considered), using three different method, translated axiom system, canonical model (where the axiom system is named by 
) and constructing canonical model for an alternative axiom system 
, where the idea originates from [Wang and Cao, 2013].Plaza, J. A. (1989). Logics of public communications. In M. L. Emrich, M. S. Pfeifer, M. Hadzikadic, & Z.W. Ras (Eds.), Proceedings of the fourth international symposium on methodologies for intelligent systems: Poster session program (pp. 201–216).
Wang, Y., Cao, Q. On axiomatizations of public announcement logic. Synthese 190, 103–134 (2013).
Yanjing Wang, Jie Fan: Knowing that, Knowing what, and Public Communication: Public Announcement Logic with Kv Operators, in Proceedings of IJCAI 2013: pp.1147-1154. AAAI press.