Quantifying over Boolean announcements

Various extensions of public announcement logic have been proposed with quantification over announcements. The best-known extension is called arbitrary public announcement logic, APAL. It contains a primitive language construct Box phi intuitively expressing that "after every public announcemen...

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 18, Issue 1; no. 1
Main Authors:	van Ditmarsch, Hans, French, Tim
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science Association 01.01.2022 Logical Methods in Computer Science e.V
Subjects:	Computer Science computer science - computational complexity computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!