The undecidability of arbitrary arrow update logic (Q2404071)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6774149
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The undecidability of arbitrary arrow update logic |
scientific article; zbMATH DE number 6774149 |
Statements
The undecidability of arbitrary arrow update logic (English)
0 references
12 September 2017
0 references
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.
0 references
dynamic epistemic logic
0 references
update logics
0 references
undecidability
0 references
satisfiability
0 references
0.8012999296188354
0 references
0.7763573527336121
0 references
0.7752838134765625
0 references
0.7641486525535583
0 references
