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
相关论文
共 50 条
  • [21] 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
  • [22] Partial-order reduction in the weak modal mu-calculus
    Ramakrishna, YS
    Smolka, SA
    CONCUR'97 : CONCURRENCY THEORY, 1997, 1243 : 5 - 24
  • [23] Effective Cut-elimination for a Fragment of Modal mu-calculus
    Grigori Mints
    Studia Logica, 2012, 100 : 279 - 287
  • [24] Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus
    Dima, Catalin
    Maubert, Bastien
    Pinchinat, Sophie
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015, PT I, 2015, 9234 : 179 - 191
  • [25] Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus
    Dima, Catalin
    Maubert, Bastien
    Pinchinat, Sophie
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2018, 19 (03)
  • [26] Games for the mu-calculus
    Niwinski, D
    Walukiewicz, I
    THEORETICAL COMPUTER SCIENCE, 1996, 163 (1-2) : 99 - 116
  • [27] Bounded game-theoretic semantics for modal mu-calculus
    Hella, Lauri
    Kuusisto, Antti
    Ronnholm, Raine
    INFORMATION AND COMPUTATION, 2022, 289
  • [28] Domain mu-calculus
    Zhang, GQ
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2003, 37 (04): : 337 - 364
  • [29] EQUATIONAL MU-CALCULUS
    NIWINSKI, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1985, 208 : 167 - 176
  • [30] Lukasiewicz mu-calculus
    Mio, Matteo
    Simpson, Alex
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2013, (126): : 87 - 104