Almost APAL - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Logic and Computation Année : 2022

Almost APAL

Résumé

Arbitrary public announcement logic (APAL) is a logic of change of knowledge with modalities representing quantification over announcements. We present two rather different versions of APAL wherein this quantification is restricted to formulas only containing a subset of all propositional variables: SAPAL and SCAPAL. Such restrictions are relevant in principle for the specification of multi-agent system dynamics. We also present another version of APAL, quantifying over all announcements implied by or implying a given formula: IPAL. We then determine the relative expressivity of all these logics and APAL. We also present complete axiomatizations of SAPAL and SCAPAL and show undecidability of satisfiability for all logics involved, by arguments nearly identical to those for APAL. We show that the IPAL quantifier, motivated by the satisfaction clause for substructural implication, yields a new substructural dynamic consequence relation.
Fichier principal
Vignette du fichier
Almost_APAL.pdf (518.27 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-04238177 , version 1 (12-10-2023)

Licence

Identifiants

Citer

Hans van Ditmarsch, Mo Liu, Louwe Kuijer, Igor Sedlar. Almost APAL. Journal of Logic and Computation, 2022, 33 (6), pp.1350-1378. ⟨10.1093/logcom/exac012⟩. ⟨hal-04238177⟩
19 Consultations
20 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More