Abstract
AbstractArbitrary 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
