SearcharxivSearch

arXiv · 1603.01766

Spatial logic of modal mu-calculus and tangled closure operators

Abstract

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 Fern\'andez-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 establish the finite model property in Kripke semantics for various tangled closure logics with and without the universal modality $\forall$. We also extend the McKinsey--Tarski topological `dissection lemma'. 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 $\Diamond$; (ii) $\Diamond$ and the tangled closure operators $\langle t \rangle$; (iii) $\Diamond,\forall$; (iv) $\Diamond,\forall,\langle t \rangle$; (v) the derivative operator $\langle d \rangle$; (vi) $\langle d \rangle$ and the associated tangled closure operators $\langle dt \rangle$; (vii) $\langle d \rangle,\forall$; (viii) $\langle d \rangle,\forall,\langle dt \rangle$. Soundness also holds, if: (a) for languages with $\forall$, $X$ is connected; and (b) for languages with $\langle d \rangle$, $X$ validates the well known axiom $\mathrm{G}_1$. For countable languages without $\forall$, we prove strong completeness. We also show that in the presence of $\forall$, strong completeness fails if $X$ is compact and locally connected.

Explore related subjects

Keep this discovery

BibTeXRIS

Robert Goldblatt, Ian Hodkinson. 2016-03-05. Spatial logic of modal mu-calculus and tangled closure operators. https://doi.org/10.1007/s11225-017-9732-1; 10.1016/j.apal.2016.11.006

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO