6 research outputs found
Tangled closure algebras
The tangled closure of a collection of subsets of a topological space is the largest subset in which each member of the collection is dense. This operation models a logical ‘tangle modality’ connective, of significance in finite model theory. Here we study an abstract equational algebraic formulation of the operation which generalises the McKinsey-Tarski theory of closure algebras. We show that any dissectable tangled closure algebra, such as the algebra of subsets of any metric space without isolated points, contains copies of every finite tangled closure algebra. We then exhibit an example of a tangled closure algebra that cannot be embedded into any complete tangled closure algebra, so it has no MacNeille completion and no spatial representation
Non-finite axiomatizability of Dynamic Topological Logic
Dynamic topological logic (DTL) is a polymodal logic designed for reasoning
about {\em dynamic topological systems. These are pairs (X,f), where X is a
topological space and f:X->X is continuous. DTL uses a language L which
combines the topological S4 modality [] with temporal operators from linear
temporal logic.
Recently, I gave a sound and complete axiomatization DTL* for an extension of
the logic to the language L*, where is allowed to act on finite sets of
formulas and is interpreted as a tangled closure operator. No complete
axiomatization is known over L, although one proof system, which we shall call
, was conjectured to be complete by Kremer and Mints.
In this paper we show that, given any language L' between L and L*, the set
of valid formulas of L' is not finitely axiomatizable. It follows, in
particular, that KM is incomplete.Comment: arXiv admin note: text overlap with arXiv:1201.5162 by other author
Succinctness in subsystems of the spatial mu-calculus
In this paper we systematically explore questions of succinctness in modal
logics employed in spatial reasoning. We show that the closure operator,
despite being less expressive, is exponentially more succinct than the
limit-point operator, and that the -calculus is exponentially more
succinct than the equally-expressive tangled limit operator. These results hold
for any class of spaces containing at least one crowded metric space or
containing all spaces based on ordinals below , with the usual
limit operator. We also show that these results continue to hold even if we
enrich the less succinct language with the universal modality
Spatial logic of tangled closure operators and modal mu-calculus
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 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 ∀ 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 mucalculus with the closure operator ; (ii) and the tangled closure operators (in fact can express ); (iii) , ∀; (iv) , ∀, ; (v) the derivative operator ; (vi) and the associated tangled closure operators ; (vii) , ∀; (viii) , ∀,. Soundness also holds, if: (a) for languages with ∀, X is connected; (b) for languages with , X validates the well-known axiom G1. For countable languages without ∀, we prove strong completeness. We also show that in the presence of ∀, strong completeness fails if X is compact and locally connecte