Switch to: Citations

References in:

Public Announcements for Non-omniscient Agents

In Kamal Lodaya (ed.), Logic and Its Applications. Springer. pp. 220--232 (2013)

Add references

You must login to add references.
  1. Logics of public communications.Jan Plaza - 2007 - Synthese 158 (2):165 - 179.
    Multi-modal versions of propositional logics S5 or S4—commonly accepted as logics of knowledge—are capable of describing static states of knowledge but they do not reflect how the knowledge changes after communications among agents. In the present paper (part of broader research on logics of knowledge and communications) we define extensions of the logic S5 which can deal with public communications. The logics have natural semantics. We prove some completeness, decidability and interpretability results and formulate a general method that solves certain (...)
    Download  
     
    Export citation  
     
    Bookmark   186 citations  
  • Knowledge and Belief: An Introduction to the Logic of the Two Notions.Jaakko Hintikka - 1962 - Studia Logica 16:119-122.
    Download  
     
    Export citation  
     
    Bookmark   698 citations  
  • Reasoning about information change.Jelle Gerbrandy & Willem Groeneveld - 1997 - Journal of Logic, Language and Information 6 (2):147-169.
    In this paper we introduce Dynamic Epistemic Logic, which is alogic for reasoning about information change in a multi-agent system. Theinformation structures we use are based on non-well-founded sets, and canbe conceived as bisimulation classes of Kripke models. On these structures,we define a notion of information change that is inspired by UpdateSemantics (Veltman, 1996). We give a sound and complete axiomatization ofthe resulting logic, and we discuss applications to the puzzle of the dirtychildren, and to knowledge programs.
    Download  
     
    Export citation  
     
    Bookmark   104 citations  
  • Moorean Phenomena in Epistemic Logic.Wesley H. Holliday & Thomas F. Icard - 2010 - In Lev Dmitrievich Beklemishev, Valentin Goranko & Valentin Shehtman (eds.), Advances in Modal Logic 8. London, England: College Publications. pp. 178-199.
    A well-known open problem in epistemic logic is to give a syntactic characterization of the successful formulas. Semantically, a formula is successful if and only if for any pointed model where it is true, it remains true after deleting all points where the formula was false. The classic example of a formula that is not successful in this sense is the “Moore sentence” p ∧ ¬BOXp, read as “p is true but you do not know p.” Not only is the (...)
    Download  
     
    Export citation  
     
    Bookmark   31 citations