Public announcement logic with distributed knowledge: expressivity, completeness and complexity.

While dynamic epistemic logics with common knowledge have been extensively studied, dynamic epistemic logics with distributed knowledge have so far received far less attention. In this paper we study extensions of public announcement logic ( $$\mathcal{PAL }$$) with distributed knowledge, in particu...

Descripción completa

Detalles Bibliográficos

Publicado en:	Synthese Vol. 190; pp. 135 - 163
Autores principales:	Wáng, Yì, Ågotnes, Thomas
Formato:	Artículo
Publicado:	Springer Nature Dec2013 Supplement
Materias:	Completeness theorem Epistemic logic Computational complexity Mathematical logic Proof theory Bisimulation
Acceso en línea:	Ver este registro en EBSCOhost