Certain Bounds of Formulas in Free Temporal Algebras

Abstract

In this paper, we give a basic structure theorem based on the study of extreme cases for the value of ≺ (the classical precedence relation between ultrafilters), i.e., ≺=∅ and no isolated element in ≺. This gives rise, respectively, to the temporal varieties O and W, with the result that O generates a variety of temporal algebras. We also characterize the simple temporal algebras by means of arithmetical properties related to basical temporal operators; we conclude that the simplicity of the temporal algebra lies in being able to make 0 any element less than 1 by repeated application to it of the L operator. We then present an algebraic construction similar to a product but in which the temporal operations are not defined componentwise. This new “product” is shown to be useful in the study of algebra order and finding of bounds by means of something similar to a lifting process. Finally, we give an alternative proof of an already known result on atoms counting in free temporal algebras.

Keywords

• temporal logic
• free temporal algebras
• polymodal algebras