Skip to content
Preprint

Dynamic Polyhedral Logic

Aug 2026 · 0 citations · 31 references
Computer Science

Abstract

We introduce spatio-temporal polyhedral reachability logics, extending dynamic topological logic with polyhedral semantics and a path-based spatial reachability operator. Formulas are interpreted over polyhedra, with admissible valuations ranging over polyhedral subsets; the spatial modality is interpreted as interior, the binary operator $\gamma(\varphi,\psi)$ expresses reachability of a $\psi$-point through a $\varphi$-region, and the temporal modalities are interpreted by a PL-homeomorphism and its inverse. We define h-dynamic reachability spaces and axiomatize the corresponding h-dynamic extensions of the known reachability logics of topological, finite, Alexandroff, and polyhedral spaces. The main result is soundness and completeness for the intended classes of invertible dynamical systems.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.