Algebraic semantics and model completeness for Intuitionistic Public Announcement Logic

被引:26
|
作者
Ma, Minghui [1 ]
Palmigiano, Alessandra [2 ]
Sadrzadeh, Mehrnoosh [3 ]
机构
[1] Southwest Univ, Inst Logic & Intelligence, Chongqing, Peoples R China
[2] Delft Univ Technol, Fac Technol Policy & Management, Delft, Netherlands
[3] Queen Mary Univ London, Sch Elect Engn & Comp Sci, London, England
基金
英国工程与自然科学研究理事会;
关键词
Public Announcement Logic; Duality; Intuitionistic modal logic; Algebraic models; Pointfree semantics; Intuitionistic Public Announcement; Logic;
D O I
10.1016/j.apal.2013.11.004
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In the present paper, we start studying epistemic updates using the standard toolkit of duality theory. We focus on public announcements, which are the simplest epistemic actions, and hence on Public Announcement Logic (PAL) without the common knowledge operator. As is well known, the epistemic action of publicly announcing a given proposition is semantically represented as a transformation of the model encoding the current epistemic setup of the given agents; the given current model being replaced with its submodel relativized to the announced proposition. We dually characterize the associated submodel-injection map as a certain pseudo-quotient map between the complex algebras respectively associated with the given model and with its relativized submodel. As is well known, these complex algebras are complete atomic BAOs (Boolean algebras with operators). The dual characterization we provide naturally generalizes to much wider classes of algebras, which include, but are not limited to, arbitrary BAOs and arbitrary modal expansions of Heyting algebras (HAOs). Thanks to this construction, the benefits and the wider scope of applications given by a point-free, intuitionistic theory of epistemic updates are made available. As an application of this dual characterization, we axiomatize the intuitionistic analogue of PAL, which we refer to as IPAL, prove soundness and completeness of IPAL w.r.t. both algebraic and relational models, and show that the well known Muddy Children Puzzle can be formalized in MAL. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:963 / 995
页数:33
相关论文
共 50 条
  • [1] Algebraic Semantics and Model Completeness for Intuitionistic Public Announcement Logic
    Sadrzadeh, Mehrnoosh
    Palmigiano, Alessandra
    Ma, Minghui
    LOGIC, RATIONALITY, AND INTERACTION, 2011, 6953 : 394 - +
  • [2] Intuitionistic Public Announcement Logic with Distributed Knowledge
    Murai, Ryo
    Sano, Katsuhiko
    STUDIA LOGICA, 2024, 112 (03) : 661 - 691
  • [3] Formalized soundness and completeness of epistemic and public announcement logic
    From, Asta Halkjaer
    JOURNAL OF LOGIC AND COMPUTATION, 2024,
  • [4] A Labelled Sequent Calculus for Intuitionistic Public Announcement Logic
    Nomura, Shoshin
    Sano, Katsuhiko
    Tojo, Satoshi
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, (LPAR-20 2015), 2015, 9450 : 187 - 202
  • [5] COMPLETENESS AND INCOMPLETENESS FOR INTUITIONISTIC LOGIC
    McCarty, Charles
    JOURNAL OF SYMBOLIC LOGIC, 2008, 73 (04) : 1315 - 1327
  • [6] INTUITIONISTIC COMPLETENESS THEOREM FOR INTUITIONISTIC PREDICATE LOGIC
    VELDMAN, W
    JOURNAL OF SYMBOLIC LOGIC, 1976, 41 (01) : 159 - 166
  • [7] Public announcement logic with distributed knowledge: expressivity, completeness and complexity
    Wang, Yi N.
    Agotnes, Thomas
    SYNTHESE, 2013, 190 : 135 - 162
  • [8] Public announcement logic with distributed knowledge: expressivity, completeness and complexity
    Yì N. Wáng
    Thomas Ågotnes
    Synthese, 2013, 190 : 135 - 162
  • [9] Semantics and Completeness for Schematic Logic
    Tatton-Brown, Oliver
    LOGIC AND LOGICAL PHILOSOPHY, 2021, 30 (02) : 227 - 280
  • [10] A COMPLETENESS THEOREM FOR INTUITIONISTIC PREDICATE LOGIC - AN INTUITIONISTIC PROOF
    DRAGALIN, AG
    PUBLICATIONES MATHEMATICAE-DEBRECEN, 1987, 34 (1-2): : 1 - 19