Skip Navigation


Logic Journal of IGPL Advance Access originally published online on January 27, 2007
Logic Journal of IGPL 2007 15(1):77-107; doi:10.1093/jigpal/jzl036
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
15/1/77    most recent
jzl036v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Duque, D. F.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2007. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Dynamic Topological Completeness for Formula

David FernÁndez Duque

Mathematics Department, 450 Serra Mall Bldg 380, Stanford, CA, 94305. E-mail: dfd{at}math.stanford.edu.


   Abstract

Dynamic topological logic (DTL) 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 Formula . It [9] it was shown that any satisfiable formula could be satisfied in some Formula 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 Formula . This includes DTL{circ}; 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 Formula 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 Formula but not in arbitrary topological spaces.

Key Words: Dynamic topological logic • spatial logic • temporal logic


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
J Logic ComputationHome page
M. Nogin and A. Nogin
On Dynamic Topological Logic of the Real Line
J Logic Computation, December 1, 2008; 18(6): 1029 - 1045.
[Abstract] [PDF]



Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.