mlsanityData to 14 Oct 2026

A simple proof of the completeness of APAL

arXiv 1409.2612 ↗First posted 9 Sep 2014cs.LOcited by 2

Not on the map. Why?

Abstract (arXiv)

We provide a simple proof of the completeness of arbitrary public announcement logic APAL. The proof is an improvement over the proof found in the publication Knowable as Known after an Announcement.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 9 Sep 2014.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.