Let ${{\mathcal L}^{\square\circ}}$ be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality □ and a temporal modality ◦, understood as ‘next’. We extend the topological semantic for S4 to a semantics for the language ${{\mathcal L}^{\square\circ}}$ by interpreting ${{\mathcal L}^{\square\circ}}$ in dynamic topological systems, i.e., ordered pairs 〈X, f〉, where X is a topological space and f is a continuous function on X. Artemov, Davoren and Nerode have axiomatized a logic S4C, and have shown (...) that S4C is sound and complete for this semantics. S4C is also complete for continuous functions on Cantor space (Mints and Zhang, Kremer), and on the real plane (Fernández Duque); but incomplete for continuous functions on the real line (Kremer and Mints, Slavnov). Here we show that S4C is complete for continuous functions on the rational numbers. (shrink)

Dynamic topological logic provides a context for studying the confluence of the topological semantics for S4, topological dynamics, and temporal logic. The topological semantics for S4 is based on topological spaces rather than Kripke frames. In this semantics, □ is interpreted as topological interior. Thus S4 can be understood as the logic of topological spaces, and □ can be understood as a topological modality. Topological dynamics studies the asymptotic properties of continuous maps on topological spaces. Let a dynamic topological system (...) be a topological space X together with a continuous function f. f can be thought of in temporal terms, moving the points of the topological space from one moment to the next. Dynamic topological logics are the logics of dynamic topological systems, just as S4 is the logic of topological spaces. Dynamic topological logics are defined for a trimodal language with an S4-ish topological modality □ , and two temporal modalities, ○ and * , both interpreted using the continuous function f. In particular, ○ expresses f’s action on X from one moment to the next, and * expresses the asymptotic behaviour of f. (shrink)

Dynamic Topological Logic ( ) is a modal logic which combines spatial and temporal modalities for reasoning about dynamic topological systems , which are pairs consisting of a topological space X and a continuous function f : X → X . The function f is seen as a change in one unit of time; within one can model the long-term behavior of such systems as f is iterated. One class of dynamic topological systems where the long-term behavior of f is (...) particularly interesting is that of minimal systems ; these are dynamic topological systems which admit no proper, closed, f -invariant subsystems. In such systems the orbit of every point is dense, which within translates into a non-trivial interaction between spatial and temporal modalities. This interaction, however, turns out to make the logic simpler, and while s in general tend to be undecidable, interpreted over minimal systems we obtain decidability, although not in primitive recursive time; this is the main result that we prove in this paper. We also show that interpreted over minimal systems is incomplete for interpretations on relational Kripke frames and hence does not have the finite model property; however it does have a finite non-deterministic quasimodel property. Finally, we give a set of formulas of which characterizes the class of minimal systems within the class of dynamic topological systems, although we do not offer a full axiomatization for the logic. (shrink)

Dynamic topological logic combines topological and temporal modalities to express asymptotic properties of dynamic systems on topological spaces. A dynamic topological model is a triple 〈X ,f , V 〉, where X is a topological space, f : X → X a continuous function and V a truth valuation assigning subsets of X to propositional variables. Valid formulas are those that are true in every model, independently of X or f. A natural problem that arises is to identify the logics (...) obtained on familiar spaces, such as . It [9] it was shown that any satisfiable formula could be satisfied in some for n large enough, but the question of how the logic varies with n remained open.In this paper we prove that any fragment of DTL that is complete for locally finite Kripke frames is complete for . This includes DTL○; it also includes some larger fragments, such as DTL1, where “henceforth” may not appear in the scope of a topological operator. We show that satisfiability of any formula of our language in a locally finite Kripke frame implies satisfiability in by constructing continuous, open maps from the plane into arbitrary locally finite Kripke frames, which give us a type of bisimulation. We also show that the results cannot be extended to arbitrary formulas of DTL by exhibiting a formula which is valid in but not in arbitrary topological spaces. (shrink)