To be announced

Ditmarsch, Hans van

doi:10.1016/j.ic.2023.105026

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

2024

Publication Types

Select...

Article2

Book1

Other1

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 118 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Quantification over various epistemic actions, and in particular over public announcements, has been explored in the last 15 or so years [9]. Adding quantification over public announcements allows one to shift the emphasis from the effects of a particular announcement to the question of (non-)existence of an announcement leading to a desired epistemic goal.…”

Section: Introductionmentioning

confidence: 99%

Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard

Galimullin¹,

Kuijer²

2023

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Arbitrary Public Announcement Logic with Common Knowledge (APALC) is an extension of Public Announcement Logic with common knowledge modality and quantifiers over announcements. We show that the satisfiability problem of APALC on S5-models, as well as that of two other related logics with quantification and common knowledge, is Σ 1 1 -hard. This implies that neither the validities nor the satisfiable formulas of APALC are recursively enumerable. Which, in turn, implies that APALC is not finitely axiomatisable.

show abstract

Section: Introductionmentioning

confidence: 99%