Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

AIML

2006

2006

Dynamic topological logics are combinations of topological and temporal modal logics that are used for reasoning about dynamical systems consisting of a topological space and a continuous function on it. Here we partially solve a major open problem in the field by showing (by reduction of the -reachability problem for lossy channel systems) that the dynamic topological logic over arbitrary topological spaces as well as those over Rn, for each n 1, are undecidable. Actually, we prove this result for the natural and expressive fragment of the full dynamic topological language where the topological operators cannot be applied to formulas containing the temporal eventuality. Using Kruskal's tree theorem we also show that the formulas of this fragment that are valid in arbitrary topological spaces with continuous functions are recursively enumerable, which is not the case for spaces with homeomorphisms.

Related Content

Added |
30 Oct 2010 |

Updated |
30 Oct 2010 |

Type |
Conference |

Year |
2006 |

Where |
AIML |

Authors |
Boris Konev, Roman Kontchakov, Frank Wolter, Michael Zakharyaschev |

Comments (0)