Spatial logic of tangled closure operators and modal mu-calculus

被引:16
|
作者
Goldblatt, Robert [1 ]
Hodkinson, Ian [2 ]
机构
[1] Victoria Univ, Sch Math & Stat, Wellington, New Zealand
[2] Imperial Coll London, Dept Comp, London, England
基金
英国工程与自然科学研究理事会;
关键词
Derivative operator; Dense-in-itself metric space; Modal logic; Finite model property; Strong completeness; DYNAMIC TOPOLOGICAL LOGIC; COMPLETENESS;
D O I
10.1016/j.apal.2016.11.006
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
There has been renewed interest in recent years in McKinsey and Tarski's interpretation of modal logic in topological spaces and their proof that S4 is the logic of any separable dense-in-itself metric space. Here we extend this work to the modal mu-calculus and to a logic of tangled closure operators that was developed by Fernandez-Duque after these two languages had been shown by Dawar and Otto to have the same expressive power over finite transitive Kripke models. We prove that this equivalence remains true over topological spaces. We extend the McKinsey Tarski topological 'dissection lemma'. We also take advantage of the fact (proved by us elsewhere) that various tangled closure logics with and without the universal modality for all have the finite model property in Kripke semantics. These results are used to construct a representation map (also called a d-p-morphism) from any dense-in-itself metric space X onto any finite connected locally connected serial transitive Kripke frame. This yields completeness theorems over X for a number of languages: (i) the modal mu-calculus with the closure operator lozenge; (ii) lozenge and the tangled closure operators (t) (in fact (t) can express lozenge); (iii) lozenge, for all; (iv) lozenge, for all, (t); (v) the derivative operator (d); (vi) (d) and the associated tangled closure operators (dt); (vii) (d), for all; (viii) ( d), for all, (dt). Soundness also holds, if: (a) for languages with for all, X is connected; (b) for languages with (d), X validates the well-known axiom G(1). For countable languages without for all, we prove strong completeness. We also show that in the presence of for all, strong completeness fails if X is compact and locally connected. (C) 2016 The Author(s). Published by Elsevier B.V.
引用
收藏
页码:1032 / 1090
页数:59
相关论文
共 22 条
  • [1] Sahlqvist Correspondence for Modal mu-calculus
    van Benthem, Johan
    Bezhanishvili, Nick
    Hodkinson, Ian
    STUDIA LOGICA, 2012, 100 (1-2) : 31 - 60
  • [2] Syntactic cut-elimination for a fragment of the modal mu-calculus
    Bruennler, Kai
    Studer, Thomas
    ANNALS OF PURE AND APPLIED LOGIC, 2012, 163 (12) : 1838 - 1853
  • [3] Modal Mu-calculus Extension with Description of Autonomy and Its Algebraic Structure
    Yamasaki, Susumu
    Sasakura, Mariko
    PROCEEDINGS OF THE 5TH INTERNATIONAL CONFERENCE ON COMPLEXITY, FUTURE INFORMATION SYSTEMS AND RISK (COMPLEXIS), 2020, : 63 - 71
  • [4] The Topological Mu-Calculus: Completeness and Decidability
    Baltag, Alexandru
    Bezhanishvili, Nick
    Fernandez-Duque, David
    JOURNAL OF THE ACM, 2023, 70 (05)
  • [5] An Infinitary Treatment of Full Mu-Calculus
    Afshari, Bahareh
    Jager, Gerhard
    Leigh, Graham E.
    LOGIC, LANGUAGE, INFORMATION, AND COMPUTATION (WOLLIC 2019), 2019, 11541 : 17 - 34
  • [6] Tangled modal logic for topological dynamics
    Fernandez-Duque, David
    ANNALS OF PURE AND APPLIED LOGIC, 2012, 163 (04) : 467 - 481
  • [7] On modal logic of deductive closure
    Naumov, P
    ANNALS OF PURE AND APPLIED LOGIC, 2006, 141 (1-2) : 218 - 224
  • [8] Formula size games for modal logic and μ-calculus
    Hella, Lauri T.
    Vilander, Miikka S.
    JOURNAL OF LOGIC AND COMPUTATION, 2019, 29 (08) : 1311 - 1344
  • [9] Deriving Inverse Operators for Modal Logic
    Guzman, Michell
    Perchy, Salim
    Rueda, Camilo
    Valencia, Frank D.
    THEORETICAL ASPECTS OF COMPUTING - ICTAC 2016, 2016, 9965 : 214 - 232
  • [10] Closure Ordinals of the Two-Way Modal μ-Calculus
    Milanese, Gian Carlo
    Venema, Yde
    LOGIC, LANGUAGE, INFORMATION, AND COMPUTATION (WOLLIC 2019), 2019, 11541 : 498 - 515