A dual characterisation of simple and subdirectly-irreducible temporal Heyting algebras
By: David Quinn Alvarez
Potential Business Impact:
Makes computer logic work for time.
We establish an Esakia duality for the categories of temporal Heyting algebras and temporal Esakia spaces. This includes a proof of contravariant equivalence and a congruence/filter/closed-upset correspondence. We then study two notions of {\guillemotleft} reachability {\guillemotright} on the relevant spaces/frames and show their equivalence in the finite case. We use these notions of reachability to give both lattice-theoretic and dual order-topological characterisations of simple and subdirectly-irreducible temporal Heyting algebras. Finally, we apply our duality results to prove the relational and algebraic finite model property for the temporal Heyting calculus. This, in conjunction with the proven characterisations, allows us to prove a relational completeness result that combines finiteness and the frame property dual to subdirect-irreducibility, giving us a class of finite, well-understood frames for the logic.
Similar Papers
Observation algebras: Heyting algebra over coherence spaces
Logic in Computer Science
Makes computer rules for events more complete.
Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs
Discrete Mathematics
Organizes how information flows through time.
Duality theory and representations for distributive quasi relation algebras and DInFL-algebras
Logic in Computer Science
Makes math ideas easier to understand.