Number of the records: 1  

Revisiting Epistemic Logic with Names

  1. 1.
    0547636 - ÚI 2022 RIV AU eng C - Conference Paper (international conference)
    Bílková, Marta - Christoff, Z. - Roy, O.
    Revisiting Epistemic Logic with Names.
    Proceedings Eighteenth Conference on Theoretical Aspects of Rationality and Knowledge. Waterloo: Open Publishing Association, 2021 - (Halpern, J.; Perea, A.), s. 39-54. Electronic Proceedings in Theoretical Computer Science, 335. ISSN 2075-2180.
    [TARK 2021: Theoretical Aspects of Rationality and Knowledge /18./. Beijing (CN), 25.06.2021-27.06.2021]
    Institutional support: RVO:67985807
    Keywords : epistemic logic * multi-agent epistemic logic * common knowledge * distributed knowledge * neighbourhood semantics
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    http://eptcs.web.cse.unsw.edu.au/paper.cgi?TARK2021.4

    This paper revisits the multi-agent epistemic logic presented in [10], where agents and sets of agents are replaced by abstract, intensional „names”. We make three contributions. First, we study its model theory, providing adequate notions of bisimulation and frame morphisms, and use them to study the logic's expressive power and definability. Second, we show that the logic has a natural neighborhood semantics, which in turn allows to show that the axiomatization in [10] does not rely on possibly controversial introspective properties of knowledge. Finally, we extend the logic with common and distributed knowledge operators, and provide a sound and complete axiomatization for each of these extensions. These results together put the original epistemic logic with names in a more modern context and opens the door for a logical analysis of epistemic phenomena where group membership is uncertain or variable.
    Permanent Link: http://hdl.handle.net/11104/0323830

     
    FileDownloadSizeCommentaryVersionAccess
    0547636-afin.pdf1215.8 KBOAPublisher’s postprintopen-access
     
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.