'Knowable' as 'known after an announcement'

Review of Symbolic Logic 1 (3):305-334 (2008)
  Copy   BIBTEX

Abstract

Public announcement logic is an extension of multiagent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. We propose an extension of public announcement logic with a dynamic modal operator that expresses what is true after any announcement: after which , does it hold that Kφ? We give various semantic results and show completeness for a Hilbert-style axiomatization of this logic. There is a natural generalization to a logic for arbitrary events

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
128 (#138,934)

6 months
28 (#106,226)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Citations of this work

Contingency and Knowing Whether.Jie Fan, Yanjing Wang & Hans van Ditmarsch - 2015 - Review of Symbolic Logic 8 (1):75-107.
Moorean Phenomena in Epistemic Logic.Wesley H. Holliday & Thomas F. Icard - 2010 - In Lev Beklemishev, Valentin Goranko & Valentin Shehtman (eds.), Advances in Modal Logic 8. College Publications. pp. 178-199.

View all 37 citations / Add more citations

References found in this work

Modal Logic: Graph. Darst.Patrick Blackburn, Maarten de Rijke & Yde Venema - 2001 - New York: Cambridge University Press. Edited by Maarten de Rijke & Yde Venema.
The taming of the true.Neil Tennant - 1997 - New York: Oxford University Press.
A reply to my critics.George Edward Moore - 1942 - In Paul Arthur Schilpp (ed.), The philosophy of G. E. Moore. New York,: Tudor Pub. Co..
A logical analysis of some value concepts.Frederic Fitch - 1963 - Journal of Symbolic Logic 28 (2):135-142.

View all 18 references / Add more references