Non-finite axiomatizability of dynamic topological logic

From MaRDI portal
Publication:5410331

DOI10.1145/2489334zbMATH Open1287.03069arXiv1207.5140OpenAlexW2036386940WikidataQ58883280 ScholiaQ58883280MaRDI QIDQ5410331FDOQ5410331

David Fernández-Duque

Publication date: 16 April 2014

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Abstract: 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 mathsfKM, 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.


Full work available at URL: https://arxiv.org/abs/1207.5140





Cites Work


Cited In (8)






This page was built for publication: Non-finite axiomatizability of dynamic topological logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5410331)