The undecidability of arbitrary arrow update logic (Q2404071)

Arbitrary arrow update logic (AAUL) [\textit{H. van Ditmarsch} et al., Artif. Intell. 242, 80--106 (2017; Zbl 1392.68396)] can be considered a dynamic modal logic with a modality to quantify over arrow updates. The authors introduce and develop the syntax and semantics of AAUL, provide a brief definition of the tiling problem and show that it can be encoded in the corresponding satisfiability problem.