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 条
  • [31] The Horn mu-calculus
    Charatonik, W
    McAllester, D
    Niwinski, D
    Podelski, A
    Walukiewicz, I
    THIRTEENTH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1998, : 58 - 69
  • [32] Uniform Interpolation from Cyclic Proofs: The Case of Modal Mu-Calculus
    Afshari, Bahareh
    Leigh, Graham E.
    Turata, Guillermo Menendez
    AUTOMATED REASONING WITH ANALYTIC TABLEAUX AND RELATED METHODS, TABLEAUX 2021, 2021, 12842 : 335 - 353
  • [33] Model checking the full modal mu-calculus for infinite sequential processes
    Burkart, O
    Steffen, B
    THEORETICAL COMPUTER SCIENCE, 1999, 221 (1-2) : 251 - 270
  • [34] 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
  • [35] COMPLEXITY OF MODEL CHECKING RECURSION SCHEMES FOR FRAGMENTS OF THE MODAL MU-CALCULUS
    Kobayashi, Naoki
    Ong, C-H Luke
    LOGICAL METHODS IN COMPUTER SCIENCE, 2011, 7 (04) : 1 - 23
  • [36] Continuous Fragment of the mu-Calculus
    Fontaine, Gaelle
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2008, 5213 : 139 - 153
  • [37] Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
    Kobayashi, Naoki
    Ong, C. -H. Luke
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT II, PROCEEDINGS, 2009, 5556 : 223 - +
  • [38] Model checking the full modal mu-calculus for infinite sequential processes
    Burkart, O
    Steffen, B
    AUTOMATA, LANGUAGES AND PROGRAMMING, 1997, 1256 : 419 - 429
  • [39] Transfinite extension of the Mu-calculus
    Bradfield, J
    Duparc, J
    Quickert, S
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2005, 3634 : 384 - 396
  • [40] RESULTS ON THE PROPOSITIONAL MU-CALCULUS
    KOZEN, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1982, 140 : 348 - 359