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 条
  • [1] Sahlqvist Correspondence for Modal mu-calculus
    Johan van Benthem
    Nick Bezhanishvili
    Ian Hodkinson
    Studia Logica, 2012, 100 : 31 - 60
  • [2] On the proof theory of the modal mu-calculus
    Studer T.
    Studia Logica, 2008, 89 (3) : 343 - 363
  • [3] DUALITY AND THE COMPLETENESS OF THE MODAL MU-CALCULUS
    AMBLER, S
    KWIATKOWSKA, M
    MEASOR, N
    THEORETICAL COMPUTER SCIENCE, 1995, 151 (01) : 3 - 27
  • [4] Sahlqvist Correspondence for Modal mu-calculus
    van Benthem, Johan
    Bezhanishvili, Nick
    Hodkinson, Ian
    STUDIA LOGICA, 2012, 100 (1-2) : 31 - 60
  • [5] Simple Probabilistic Extension of Modal Mu-Calculus
    Liu, Wanwei
    Song, Lei
    Wang, Ji
    Zhang, Lijun
    PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 882 - 888
  • [6] LOCAL MODEL CHECKING IN THE MODAL MU-CALCULUS
    STIRLING, C
    WALKER, D
    THEORETICAL COMPUTER SCIENCE, 1991, 89 (01) : 161 - 177
  • [7] ON MODAL MU-CALCULUS AND BUCHI TREE AUTOMATA
    KAIVOLA, R
    INFORMATION PROCESSING LETTERS, 1995, 54 (01) : 17 - 22
  • [8] LOCAL MODEL CHECKING IN THE MODAL MU-CALCULUS
    STIRLING, C
    WALKER, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 351 : 369 - 383
  • [9] A modal mu-calculus for durational transition systems
    Seidl, H
    11TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1996, : 128 - 137
  • [10] Algorithmic correspondence for intuitionistic modal mu-calculus
    Conradie, Willem
    Fomatati, Yves
    Palmigiano, Alessandra
    Sourabh, Sumit
    THEORETICAL COMPUTER SCIENCE, 2015, 564 : 30 - 62