Search arXivSearch

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ández-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

Explore connections, maps & timelines

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%3B%2010.1016%2Fj.apal.2016.11.006

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

KEEP EXPLORING

Related papers

Natural Term Logic

In this paper we develop a formal system called Natural Term Logic (NTL). NTL aims to represent key aspects of the logical and grammatical mechanisms of natural language as well as grammatical transformations which preserve core logical meaning. NTL can be seen as a refinement of the ideas of Quine's paper `Variables Explained Away' and the technical concepts introduced by Bealer and Zalta. NTL is more fine-grained than Bealer's first-order intensional logic (BL): there is a many-to-one correspondence $ν$ between NTL terms and closed BL terms as well as a canonical map $β$ which assigns to each closed BL term a corresponding NTL term. The map $ν$ can be seen as assigning a core logical content of the NTL term. We define a series of reductions on NTL terms which intuitivelyy speaking capture meaning-preserving syntactic transformations ( transformations which preserved the basic logical meaning of a term) and our main result is that each NTL term $T$ reduces to a unique normal term $N$. The reductions fall into the structural, predicative and pushing-in categories. Predicative reductions decompose NTL terms so that predication is only applied to a primitive term (such terms are called prenormal). A key ingredient in the proof is the fact that $βνN = N$ when $N$ is normal. This suggests that within NTL the normal form of a term expresses the core logical content of the term.

math.LO

Hyper-hyperfiniteness and complexity

We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite, then the complexity of hyperfinite countable Borel equivalence relationsis as high as possible, namely, $Σ^1_2$-complete. We also establish an implication between the question of the effectivity of hyperfiniteness and its complexity.

math.LO

Coordinate recognition: General theory, Groups, and other surprises

A class of structures \emph{recognizes coordinates} if any reduced product of structures from said class witnesses a certain kind of rigidity phenomenon. We provide several equivalent characterizations of this property. This property has (at least) two remarkable consequences, one set-theoretic and one model-theoretic, for reduced products of structures of the said class. First, under appropriate set-theoretic assumptions every isomorphism between such reduced products associated with the Fréchet ideal lifts (modulo a finite change) to an isomorphism between products of the original structures. Second, with an additional mild assumption, it implies a strong quantifier elimination result. Of note, we show that a class recognizes coordinates if and only if an individual formula witnesses a certain syntactic property. We also consider many concrete classes of structures and determine whether or not they recognize coordinates. We place heavy emphasis on well-known classes of groups, such as permutation groups, acylindircally hyperbolic groups, quasisimple groups, free products, and graph products, but we also discuss other classes of structures.

math.LO