Certain Bounds of Formulas in Free Temporal Algebras

: 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 ultraﬁlters), i


Introduction
Temporal logic was born with the intention of allowing the representation of temporal information in the logical framework.It was also intended to address the modal logic approach introduced around 1960 by A. Prior under the name of Tense Logic.As is well known, this field caught the subsequent attention not only of logicians but also of computer specialists.
Technical applications have been derived from it, but let us not forget the use of Tense Logic as a formalism to elucidate philosophical questions related to time, especially those arising from temporal expressions in natural language, as a language to encode temporal information in applications to A.I. development and, finally, as a tool to manipulate the execution of programs in their temporal aspects.The most modern treatment we know of these aspects is chapter 10 of [1] written by Y. de Venema and entitled "Temporal Logic".
Among the precursors is H. Reichenbach (see [2]).He explains how the function of each tense is focused on specifying relations between three tenses related to the utterance: the time of conversation (S), the time of reference (R), and the time of the event (E).Prior disagreed with this simplification and thus opened up a great avenue of evolution in analysis; out of it emerged a great variety of temporal logics.A good collection of these logics can be found in [3].
Applications of temporal logic to artificial intelligence are poorly documented in published works.Almost all of them are found in internal company documents or in untested writings.The last academic news we had on this topic was contained in [4,5].The problem was focused on the properties of the world that change with the results of other events or actions and those that do not change; at that time, it all remained very much tied to automatic demonstration.
The modal style of temporal logic has reigned supreme in applications to computing that deal with program specification and verification, especially in concurrent programming with several processors working in parallel.The central problem here is to guarantee synchronicity to ensure the integrity of the information shared between processors.The nondeterminism imprinted on computer applications has led to branching temporal models.The treatment of this can be traced back to [6].
The treatment of logics has sought the use of algebra as a great ally.Whenever a logic has turned out to be algebraizable, algebra has been not only the most elegant and expressive language for its treatment but also the ideal means for devising algorithms.That is why in this work on temporal logic we resort exactly to the study of free temporal algebra.Given the many philosophical nuances appreciated in the literature, in studying temporal algebra the course of research will drift towards varieties of temporal algebras.To see the overwhelming dimension of the problem, we can consult [7,8].
As is well known, the study of algebraic structures is founded whenever possible on the study of order relations; the case of Boolean algebra is an archetypal example of this.Classical temporal algebras are built on the platform of a Boolean algebra, and their tradition has been fully consolidated since the last quarter of the twentieth century.In this case, to the formal operations of the Boolean algebra are added the temporal ones, g and h.This addition is made, as is logical, by making these operators interact harmoniously with the Boolean operations, which leads them to play a role in the underlying order.Intuition dictates that certain values, such as g0 and h0, will play a relevant role in this context; to found and analyze it from the algebraic point of view is the essential motivation of this article.The problem of atom identification is a classical one in the study of varieties of temporal algebras (see, for example, [7,8]).By reading both papers, we confirm our intuition that the problem rests on the study of g0 ∧ h0.However, neither of these papers nor the rest of those consulted isolate in one study the role played by g0 ∧ h0 within the order of the temporal algebra; we have begun this task, and it has inevitably led us to the study of simple temporal algebras, without which we believe the problem cannot be understood in its full depth.The study we present here does not pretend to be exhaustive but an indispensable first step.
The problem of capturing atoms can be approached by understanding it as a boundedness search problem.With the purpose of contributing to possible generalizations up to temporal and polymodal varieties in general, the authors of the present paper have searched for a method of bounding formulas in free temporal algebras, using exclusively their operations, valuations, filtrations (see [9]), quotients, and products.The study should proceed by exhibiting non-zero lower bounds of a sufficient number of formulas that may have them, so that the atoms would be among the rest and could be finally selected.The essential idea of the procedure would be, as so often is the case in algebra and calculus, to descend from the temporary free algebra to a certain finite algebra carefully chosen to fit the given formula, then to gather there the necessary information, and finally to ascend again to the free algebra with the information necessary to prove what is desired.Finding that finite algebra to descend to is the task we consider central to the paper.To achieve this, a construction has been introduced that we believe to be novel: a "product" of temporal algebras in which the temporal operations are not defined componentwise but by taking into account the conditions on the adjacent components.The definitions of g, h given in Definition 6, and the consequence thereof on their dual temporal operator f and p (see Lemma 11), tentatively suggest for such a new product the name "Temporal Algebra Skew-Product" (or, for short in this context, simply "skew-product").
In our approach, the use of these skew-products has been shown to be versatile with very good algebraic qualities: it is finite by definition, it preserves the simplicity of skewfactors, and its terminal "factor" can be chosen on purpose to pick up or produce effects.It could even become a skew-product again; examples of this are shown and analyzed here.In short, we believe that this study exemplifies the application of a working technique that could be generalized to suit the search for formulae quantifications in polymodal algebras -when necessary-and, in particular, to the study of atomicity in them.On the other hand, it would suggest to researchers an algebraic object whose study may in itself be of sufficient interest.
Although this paper has been inspired by the initiative put forward in others such as [10] and even more [11], we have not overlooked classical works on finitely generated free temporal and modal algebras such as [7,12], where excellent studies of atomicity touching on varieties of temporal algebras and modal algebras are exposed.In order to constrast our views, we have devoted the last section to giving an alternative proof of Theorem 1.1 in [7].
Section 2 contains a summarized compilation of the preliminary basic concepts and language used in this paper.Section 3 is devoted to the study of extremal situations on the relation ≺ over ultrafilters, i.e., we study the classes of temporal algebras in which ≺ is empty, O, and those in which ≺ has only a connected component, W. Both classes turn out to be varieties, and a structure theorem in the classical sense of universal algebra arises.Once again in this study it is glimpsed, and here it all began for us, that g0 ∧ h0 plays an interesting role in all this.Theorem 7 is the final and central product of the section.Indeed, this theorem exposes with crystal clarity the relevance of the study of extreme cases for ≺ in that it will establish that any temporal algebra is isomorphic to a product of two algebras, one in O and the other in W, which will a priori separate the atoms of the algebra into two sets.This simple observation will turn out to be transcendental in the treatment of the final example of the article when we understand that one factor contributes all the atoms and the other, none.Section 4 is devoted to a classical topic in universal algebra; it provides a practical characterization of simple temporal algebras in their maximum generality.In it, we resort to the operators L and M for their outstanding expressive capacity.From now on, these operators will be essential for our exposition.The most outstanding result of this section is Theorem 9, which, to our knowledge, has not been reported so far.It is fully satisfactory from the algebraic point of view.It will therefore be an important tool in the rest of the paper.In Section 5, we present a skew-product construction and describe its general and technical properties.Of course the key piece is Definition 6; the subsequent results prove that it could be very appropriate for the study of order-related phenomena.In it, we highlight Lemma 15, which relates the process similar to classical "lifting" that we have suggested above.Also of interest are Corollary 8 and Lemma 16, where we establish the behavior of the construction with respect to the simplicity of the skew-factors.In Section 6, we find lower bounds of non-atomic formulas in the free temporal algebra.In this section, we highlight Theorem 14 and Theorem 16 because of the lower bound it provides.But the central result is Corollary 10; it establishes the upper bound of any atom of the free temporal algebra.Finally, as an application, Section 7 is devoted to providing an alternative and new proof of Theorem 1.1 [7] (p.61) about the number of atoms of F t (X), whenever X is of cardinality n.Specifically, the technique of proof is to give a particular bijection between the set of atoms under investigation and another well known finite set that we will specify.Of course, the result highlighted in the section is Theorem 17, although Corollary 11 is also of interest.
As for the related bibliography, we include papers with prospective value and others with algebraic subject matter.Those with prospective content are divided into two groups: those that are like [1][2][3]13] have been useful for us to be able to capture the fine nuances of astute thinkers and try to imprint them on our algebraic approaches, but their influence on the work lies in the background of our research training.The second group of prospective papers are those that open up fields of technological applications beyond the scope of the present work; they are of the [4,5,14] type.They indicate that the theoretical mathematics we elaborate could underlie certain applications.Closer to our work are [7,8,12].The first deals with certain general varieties of temporal algebras inspired by the classical literature represented by [15,16].While F. Bellissima uses the language of temporal structures, we choose the one provided by Universal Algebra, which opens us to totally different methods, language and subject matter.In the case of free temporal algebra, which is the one we are concerned with, in [7] we do not find structure theorems or allusions to congruences or simplicity.Although it speaks of atoms, the problem of bounds is not raised.In common with [7], our work only has the statement of Theorem 1.1, to which we give a very different proof.Ref. [8] does have a language and subject matter closer to ours, but while we focus on temporal algebra at full generality, T. Kowalski descends to the varieties D n , which are interesting for their nuance to the deduction theorem and their ingenious conceptual relation with Hilbert Algebra.Moreover, we will emphasize that T. Kowalski has understood the interest of the g0 ∧ h0 element, although his treatment is very different from ours.In Section 8, we detail how [8] suggests a field of possible applications of our work.Finally, [11,12,14,[17][18][19] have served us only to intuit a second field of applications or evolution of the techniques developed in this work.Finally, [9,20] are instrumental works where instruments are developed that we now use here, as indicated in the appropriate places; that was their purpose and that is what they were written for.

Preliminaries
The paper deals with temporal algebras.A temporal algebra is an algebra A = A, ∧, ∨, ¬, g, h, 1 of type 2, 2, 1, 1, 1, 0 such that: (T.1) A, ∧, ∨, ¬, 1 is a Boolean algebra.(T.2) Both g and h are ∧-morphisms As usual, we also consider in A the operators p = ¬h¬ and f = ¬g¬, as well as the unary operators L and M defined, respectively, by Lx = hx ∧ x ∧ gx and Mx = px ∨ x ∨ f x.
The class T of temporal algebras is a variety.In the sequel, we will denote by F(X) (resp.F t (X)) the algebra of terms of type 2, 2, 1, 1, 1, 0 over (resp.the free temporal algebra freely generated by) the set X.The universe of F(X) (resp.F t (X)) is denoted by F(X) (resp.F t (X)).F t (X) is a quotient of F(X) by certain well known congruence θ t (X) or simply θ (see [21]).Hence, the elements of F t (X) are the quotient classes α/θ, with α ∈ F(X).If we represent by π θ , or simply π, the epimorphic projection of F(X) onto F t (X) and i is the inclusion map of X in F(X), it is well known that for all temporal algebras A and for all mappings v : X −→ A there are unique morphisms v : F(X) −→ A and ṽ : , which we will write indistinctly π(α) or α/θ.For all temporal algebra A, Atm(A) is the set of atoms of de underliying Boolean algebra.
It is possible to construct temporal algebras in a standard form as follows.A structure is a pair T, σ , where T is a non-empty set and σ ⊆ T 2 .Given a structure T, σ , the temporal algebra T, σ + is, by definition, the algebra P (T), ∧, ∨, ¬, g σ , h σ , T , where ∧,∨, and ¬ are the Boolean operations ∩, ∪, and complementation over P (T), respectively.As for g σ and h σ , these operators are defined by g σ (X) = {a ∈ A : for all b ∈ T, if aσb then b ∈ X} and h σ (X) = {a ∈ A : for all b ∈ T, if bσa then b ∈ X}.
Let A = A, ∧, ∨, ¬, g, h, 1 be a temporal algebra.The concept of filter, ideal, and ultrafilter is the proper of the underlying Boolean algebra, i.e., F ∈ P (A) is a filter iff, by definition: 1 ∈ F, a ∧ b ∈ F whenever a, b ∈ F, and b ∈ F whenever a ∈ F and a ≤ b (see [21] (p.127)); the filter F is an ultrafilter iff, by definition, F is maximal with respect to the property that 0 / ∈ F (see [21] (p.132)).The symbol Sp(A) (resp.Ult(A)) will denote the set of filters (resp.ultrafilters) of the temporal algebra A, i.e., the Boolean algebra A, ∧, ∨, ¬, 1 .For all map k : X −→ Y and B ⊆ Y (resp.A ⊆ X), the set k * (B) (resp.k * (A)) is, by definition, the set {x ∈ X : g(x) ∈ B} (resp.{g(a) ∈ Y : a ∈ A}); k * (X) (resp.k * (X)), Here, we will use the following result proved in [9]: let α ∈ F(X) such that π(α) = 1; then, there exists a temporal valuation w α over a finite temporal algebra A α such that wα = 1.
Let A = A = A, ∧, ∨, ¬, g, h, 1 be a temporal algebra.A filter F (resp. an ideal I) of A, ∧, ∨, ¬, 1 is a temporal filter (resp.ideal) iff, by definition, Lx ∈ F (resp.Mx ∈ I) whenever x ∈ F (resp.x ∈ I).The symbol Tsp(A) will represent the set of temporal filters of A. A temporal filter of A is a maximal temporal filter iff, by definition, it is distinct from A and it is maximal in the set of temporal filters distinct from A. The set of maximal temporal filters of A will be denoted by Mtsp(A); the set SptM(A) will be denoted by Rad mt (A).
If X ⊆ A, D t (X) will denote the smallest temporal filter of A including X, that is ).For all 0 ≤ i ≤ k, here π i ( y 0 , . . ., y i , . . ., y k ) = y i is the projection map on the ith coordinate of the usual product of Universal Algebra.
According to the notion of Universal Algebra, a temporal algebra A is simple iff, by def., it has no nontrivial congruence relations or, equivalently, if every homomorphism with domain A is either injective or constant.
The following results are well known.
Lemma 2. For all temporal algebra A and for all x ∈ A: x ≤ gpx. 4.
x ≤ h f x.where ≤ is the Boolean partial order.

Lemma 3.
Let A be a finite temporal algebra.For all a, b ∈ Atm(A), the following assertions are equivalent: if b ≤ hx, then a ≤ x.

A Basic Structure Theorem for Temporal Algebras
In this section, we will prove that any temporal algebra is isomorphic to a product of two others, one of which meets the condition g0 = 0; the problem is knowing how to obtain the two factors.To achieve this, we will consider elements which are, from a temporal point of view, similar to the element 0. First, we will define the following class of temporal algebras denoted by O.

Definition 1. Let O be the class of temporal algebras
Since the above definition of temporal algebras is equational, O is a variety.We will illustrate the above definition by giving two useful examples of temporal algebras.Actually, the second is a particular case of the first, and it is given using the standard method to construct a temporal algebra from a structure.
Example 2. Let us consider the structure T, σ , where T = ∅ and σ = ∅, and the temporal algebra T, σ + .It is clear, from the definition of g σ (X), that g σ (∅) = T. Hence, T, σ + is an element of O.
From property T.3, it is straightforward to show that the equality g0 = 1 holds if and only if any of the equalities f 1 = 0, h0 = 1, and p1 = 0 hold.This brings three new equivalent definitions of O. Furthermore, if A is a temporal algebra and g0 = 1, then g is constant since it is increasing (see Lemma 1) and 0 is the minimum of the lattice A, ∧, ∨, ¬, 1 ; obviously, the converse holds too.It is easy to show from the axioms of temporal algebras that g is constant if and only if any function in the set {h, f , p} is constant.So, we have four new definitions of O.
In any elements of O, it occurs that the relation ≺ is equal to ∅.Furthermore, this gives a characterization of elements in O involving ≺.For every temporal algebra in O, both g and h are constantly 1; then, L is the identity map in A. It follows that each filter of each temporal algebra A in O is closed for the map L, and so Tsp(A) coincides with Sp(A).This is not a characterization of algebras in O; nevertheless, O is a distinguished subclass of the class (actually a subvariety of the variety) of temporal algebras A verifying the property Sp(A) = Tsp(A).
From the equality Tsp(A) = Sp(A), it follows at once that Mtsp(A) = Ult(A) and so Rad mt (A) = {1}.Moreover, the equality Mtsp(A) = Ult(A) implies that, for all D ∈ Mtsp(A), A/D = E 0 .Therefore, any temporal algebra in O is a subdirected power of the algebra E 0 .So, the variety O is semisimple and generated by E 0 .
Corollary 1.The variety O is minimal in the lattice of subvarieties of T.
Proof.Let us assume that X is another subvariety of T such that X ⊆ D. Let A ∈ X and D ∈ Mtsp(A).As A/D is equal to E 0 and X is a variety, it follows that E 0 ∈ X.Therefore, X contains the variety generated by E 0 , that is, it includes D. It follows immediately that X = D.

Definition 2.
Let A be a temporal algebra.The set O(A) is defined by the following equality: Given a temporal algebra A and an element a ∈ A, Ult(A) is the disjoint union of two sets, namely, that of ultrafilters containing a, U a , and that of ultrafilters containing ¬a, U ¬a .
When a ∈ O(A), the following theorem holds (of course ≺| U a represents the restriction of ≺ to the set U a ).

Theorem 2.
Let A be a temporal algebra and a ∈ O(A).Then, ≺| U a = ∅.
Proof.Let a be an element of O(A), D an ultrafilter such that a ∈ D, and D ∈ Ult(A).If D ≺ D , then p * (D) ⊆ D , so 0 = pa ∈ D and this is impossible if D is maximal.If D ≺ D, we again obtain the above contradiction, now using f instead of p. So, the theorem follows.
By means of elements of O(A), it is possible to distinguish subsets of isolated ultrafilters with regard to ≺.In the following for all a, b ∈

Lemma 4.
Let A be a temporal algebra and a ∈ O(A).The set [0, a] is a temporal ideal.

Theorem 3. For any temporal algebra
Proof.The proof is given by double-inclusion.Let us take x ∈ A such that x ≤ g0 ∧ h0.Hence, x ≤ g0 and x ≤ h0.Since p and f are both two increasing functions (see Lemma 1), we have px ≤ pg0 ≤ 0 and

Corollary 2.
Let A be a temporal algebra.Then, O(A) is a temporal ideal.
Proof.It is an inmediate consequence of Lemma 4 and the fact that g0 ∧ h0 ∈ O(A).Definition 3.For all temporal algebra A, we define F 0 and F 1 by the following equalities: and Theorem 3 gives a very concrete description of the set O(A).It is indeed the principal ideal generated by g0 ∧ h0.Lemma 5 follows immediately from this remark and Corollary 2 (note that F 1 = ¬O(A)).

Lemma 5.
Let A be a temporal algebra.Then, F 1 is a temporal filter of A.  Proof.For all temporal algebra A, A ∈ W if and only if g0 ∧ h0 = 0; then, the members of W admit an equational definition, so W is a variety.

Theorem 5.
Let A be a temporal algebra.The following statements are equivalent: For all D ∈ Ult(A) there is D ∈ Ult(A) such that D ≺ D or D ≺ D.
Proof.First, let us assume that A ∈ W, i.e., g0 ∧ h0 = 0.As A is isomorphic to a subalgebra of Ult(A), ≺ + , then and there is no D ∈ Ult(A) such that D ≺ D or D ≺ D then D ∈ ∅, and this is impossible.So the second statement follows.The converse can be showed analogously.Now, given a temporal algebra A we can consider two subsets of temporal filters: one made up by temporal filters D such that A/D ∈ O and one made up by temporal filters such that A/D ∈ W. As a consequence, we dispose of two radicals, understanding this concept as in ring theory.Definition 5.For all temporal algebra A, we define the spectrum Osp(A) and the radical Rad o (A) by the following equalities: Similarly, we define the spectrum Wsp(A) and the radical Rad w (A) by the equalities: Since 0 ≤ x and g are increasing (see Lemma 1), then we have that g0 ≤ gx, so h0 ∧ g0 ≤ g0 ≤ gx.Analogously, we have h0 ∧ g0 ≤ h0 ≤ hx.Corollary 3. In any temporal algebra A, the following statements hold: F 1 ∈ Wsp(A).

Lemma 7.
Let A be a temporal algebra and D ∈ Tsp(A).Then, 1. Theorem 7 and (its) Corollary 4 are the central applications/results of this section.In the Theorem, we establish that every temporal algebra is the product of two, one of which satisfies g0 = 1 and the other satisfies g0 ∧ h0 = 0; it is in fact the announced structure theorem.This result will be used of the Section 7. In order to complete our study of the defined varieties, we give a new result about T and the lattice of its subvarieties.
Corollary 5. W is maximal in the lattice of subvarieties of T.
Proof.Let X be a subvariety of T such that W ⊂ X, and let A ∈ X \ W. Since A / ∈ W, then F 0 = A, and so A o is on one hand non-trivial and on the other an out-of-joints algebra, as follows from Corollary 3. Let D ∈ TspM(A o ).It is clear that E 0 = A o /D is in the variety X.Since E 0 generates O, then O ⊆ X and so O ∪ W ⊆ X.We conclude by Theorem 7 that X = T.

A Characterization of Simple Temporal Algebras
Our aim in this section is to prove that in any simple temporal algebra, an element different from 1 can be diminished progressively to 0 by means of consecutive applications of the operator L. Furthermore, this is not possible except in a simple algebra.Of course, in this statement L can be changed by M, whenever the roles of 1 and 0 are interchanged.
Given a temporal algebra A, for all a ∈ A we set by definition L 0 a = a (resp.M 0 a = a) and L n+1 a = L(L n a) (resp.M n+1 a = M(M n a)).The following lemma describes the elements of D t (X).

Lemma 8.
Let A be a temporal algebra, X ⊆ A, and H(X) the set defined by the equality: H(X) = {a ∈ A : there exists Y ∈ P ω (X) * and n ∈ ω such that L n (∧Y) ≤ a} Hence D t (X) = H(X).
Proof.It is easy to check that 1 ∈ H(X) and that H(X) is a closed order filter for L; thus, H(X) is a temporal filter.Moreover, if we take a, b ∈ H(X) then n a , n b ∈ ω, and and so a ∧ b ∈ H(X).Since H(X) is a filter and X ⊆ H(X), we have that D t (X) ⊆ H(X).For the reciprocal inclusion, let a ∈ H(X); then, Y a ∈ P ω (X) * and n a ∈ ω must exist such that L n a (∧Y a ) ≤ a.However, X ⊆ D t (X) and D t (X) are closed for operations ∧ and L; therefore, a ∈ D t (X).
Remark 2. In the sequel, the symbol → will denote the binary operation in the universe of any temporal algebra defined by a → b = ¬a ∨ b.
In the case that X = D ∪ {a}, D ∈ Tsp(A) and a ∈ A, D t (X) has a special description.The following result, actually an algebraic formulation of the "deduction theorem", gives this description.

Theorem 8 (Deduction theorem).
Let A be a temporal algebra.For all D ∈ Tsp(A) and a ∈ A, the equality: D t (D, a) = {x ∈ A : there exists n ∈ ω such that L n a → x ∈ D} holds.
Proof.For convenience in the proof, let F be the right hand member of the conjunctive equality of the statement.The assertion is that F is a temporal filter of A containing D ∪ {a} and that it is also the smallest among those verifying this property.
It is immediate to verify that F is a filter of order and that D ∪ {a} ⊆ F.Moreover, L 0 a → 1 = 1 ∈ D, thus 1 ∈ F. If we assume that x, y ∈ F, then two natural numbers n and m (e.g.n ≤ m) exist such that L n a → x, L m a → y ∈ D. It follows that L m a → x, L m a → y ∈ D, and hence L m a → (x ∧ y) ∈ D. We thus conclude that F ∈ Sp(A).Moreover, F is temporal because if m ∈ ω exists such that L m a → x and D is temporal, then L(L m a → x) ∈ D and so L m+1 a → Lx ∈ D; hence, the temporality of F follows.
Finally, suppose that D is an element of Tsp(A) containing D ∪ {a} and let x ∈ A and m ∈ ω such that L m a → x ∈ D. In such a case, L m a, L m a → x ∈ D , which implies that x ∈ D .This concludes the proof.

Remark 3.
Let A a temporal algebra.We consider that the precedence of the operator L is greater than that of the operator Corollary 6.Let D ∈ Tsp(A) and X = {a 1 , . . ., a n } a finite subset of A. The temporal filter generated by D ∪ X is the set of

Lemma 9.
Let A be a simple temporal algebra.If X ∈ P (A) \ {∅, {1}} and a ∈ A, then there is Y a ∈ P ω (X) * and n a ∈ ω such that L n a (∧Y a ) ≤ a.

Proof. If X /
∈ {∅, {1}}, then {1} ⊂ D t (X).As A is simple, we have D t (X) = A and so a ∈ D t (X).The lemma follows at once from the definition of D t (X).
Lemma 10.Let A be a temporal algebra.Then, the statements: 1.
For all X ∈ P (A) \ {∅, {1}} and a ∈ A, there is Y a ∈ P ω (X) * and n a ∈ ω such that L n a (∧Y a ) ≤ a.

2.
For all x ∈ A \ {1}, there is n x ∈ ω such that L n x x = 0. are equivalent.
Proof.Let us assume the first statement and let x ∈ A \ {1}.For X = {x} and a = 0 there is n x ∈ ω such that L n x x ≤ 0. Conversely, if the second statement is true, X ∈ P (A) \ {∅, {1}}, a ∈ A, and x ∈ X \ {1}, then n x ∈ ω verifies L n x x = 0, and so L n x x ≤ a.If we select Y a = {x} and n a = n x , the first statement is established.

Corollary 7.
Let A be a simple temporal algebra.For every a ∈ A \ {1}, n a ∈ ω exists such that L n a a = 0. Theorem 9 is the main result of the section and is very satisfactory because it characterises simple temporal algebras by means of an arithmetical criterion.The criterion consists in being able to reduce to 0 any element of the algebra, except 1, by iterated applications of the operator L. Of course, the dual criterion states that any non-zero element may be raised to 1 by iterated applications of the operator M.

Theorem 9.
Let A be a temporal algebra.Then, the statements: For every a ∈ A \ {1}, there is n a ∈ ω such that L n a a = 0.

3.
For every a ∈ A \ {0}, there is m a ∈ ω such that M m a a = 1.

4.
For all non-trivial temporal algebra B, if φ : A −→ B is a morphism of temporal algebras, then φ is a monomorphism.
are equivalent.
Proof.The first statement implies the second, as assured by Lemma 9 and Lemma 10.It is obvious that the second implies the third.Let us assume the third statement and let φ be a morphism from A to a non-trivial algebra B. If φ is non-injective, then there is a ∈ Ker(φ) \ {1} and m ∈ ω such that M n ¬a = 1.We have: Therefore, B should be trivial, and this is impossible by hypothesis.So, the fourth statement is established.The first follows from the fourth since every temporal filter of A is the kernel of a morphism of temporal algebras.

The Skew Product
In Definition 6, we introduce the modified product of temporal algebras, which serves our objective.The term "skew-product" comes from the fact that the definition of temporal operations is not componentwise, but it is in all modified components-except at least in one, the "not-skew" (i.e., the temporal operations of the usual product of Universal Algebra)-based on a specific condition of the adjacent components in the argument tuple.As we will see later on, our reasoning is about formulas α such that pπ(α) = 0 or f π(α) = 0; hence, we consider, for example in Definition 6, the condition b ≤ pa because if pa = 0 in a finite temporal algebra, then an atom b must exist that is less than or equal to pa.The choice of the "skew factor" B will be made on purpose, as we will see, in order to cause effects or to catch them.In this section, we will make implicit use of Lemma 1, Lemma 2, and Lemma 3 almost everywhere; the applicability of these lemmas will be evident from the situation.Definition 6.Let A and B be finite temporal algebras.Let us assume that a, b ∈ Atm(A), c ∈ Atm(B), k ∈ ω * , and b ≤ pa.We define in A k × B the unary operations g and h as follows.For all y 0 , . . ., y k ∈ A k × B: or (i = k − 1 and c y k ).
The proof of the following Lemma 11 boils down to a simple routine check.

Lemma 11.
Let A and B be two finite temporal algebras.Suppose that a, b ∈ Atm(A), c ∈ Atm(B), k ∈ ω * , and b ≤ pa.The algebra A k a,b × B c = A k × B, ∧, ∨, ¬, g, h, 1 where ∧, ∨, ¬, and 1 are the operations componentwise on the product A k × B and the operations g y h are as in Definition 6, is a temporal algebra.In fact, for this algebra the operations f and p are as follows: or (i = k and a y k−1 ), or (i = k − 1 and c ≤ y k ).
Remark 4. In the hypotheses of Lemma 11 and according to its content we know that A k a,b × B c is a temporal algebra; well, we suggest giving it the name skew product of A and B regarding to the atoms a, b, and c.
To shorten in this paper we will implicitly assume that A and B are both finite temporal algebras.Moreover, when we write A k a,b × B c we presupose that: a, b ∈ Atm(A), c ∈ Atm(B), b ≤ pa, k ∈ ω * , and, finally, that the temporal operations are according to Definition 6.Sometimes, we will represent the universe of Nevertheless, the skew value of g0 matches with its componentwise value.In effect, we have the following simple but important lemma.
Proof.From the hypotheses of the lemma we have m ≤ k − 1. Suppose that j ≤ k − 1 and that a y j or, equivalently, that y j ≤ ¬a.Since b ≤ pa, it follows that hy j ≤ ¬b, that is, hy j ∧ ¬b = hy j .Hence, if 0 ≤ i ≤ m, then π i (h y 0 , . . ., y k ) = hy 0 , from which the first statement follows.Moreover, according to the definition of g in A k a,b × B c we have, for all 0 ≤ i ≤ m, From this, it follows that each 0 ≤ i ≤ m − 1 satisfies the equality π i (g y 0 , . . ., y k ) = gy 0 or π i (g y 0 , . . ., y k ) = gy 0 ∧ ¬a, depending on whether b ≤ y 0 holds or not.
The following lemma indicates what can we expect about conmutativity between M and π i .Its proof follows easily by induction on m given that py i ≤ π i (p y 0 , . . ., y k ), f y i ≤ π i ( f y 0 , . . ., y k ) and that M is an increasing function.

Lemma 14.
Let A and B be finite temporal algebras.For all m ∈ ω and 0 ≤ i ≤ k, in A k a,b × B c the inequality M m π i ( y 0 , . . ., y k ) ≤ π i (M m y 0 , . . ., y k ) holds.Now, we introduce the hypothesis of simplicity in the factors of the new product.The simplicity of A and B implies that A k a,b × B c is simple and conversely.Nevertheless, we will prove a weaker result.
Proof.Since A is simple and y = 0, by Theorem 9, m ∈ ω * exists such that M m y = 1.This and Lemma 14 imply that there is z ∈ B such that M m y, k−1) . . ., y, z = 1, k−1) . . ., 1, z .It is clear from Lemma 14 that M m z ≤ z .In the arguments that we will give later, finding bounds requires a more careful approach in the case g0 = 0.In Definition 7, we define the necessary parameters, except the notion of degree (see Definition 9), to build the appropriate algebra A k a,b × B c to cover what we need.Moreover, in Definition 8 we give a specific temporal algebra that we are interested in using as algebra B in a specific skew-product A k a,b × B c .

Definition 7.
Let A be a finite simple temporal algebra for which the condition g0 = 0 holds and there are a, b ∈ Atm(A) such that b ≤ pa.From Lemma 12 and Corollary 8, the set of all j ∈ ω such that M j g0 = 1 at the same time in A k a,b and A is non-empty; so, it is possible to take the minimum s of this set.Let r = min{j ∈ ω : 0, k−1) . . ., 0, a ≤ M j g0} (1) We define the value t(A, a) by the equality t(A, a) = min{2j : j ∈ ω and l + 1 ≤ 2j}. ( Finally, let us define σ : B −→ B by σ(y) = ghy.
Lemma 15 is a necessary tool to show Theorem 15.In order to grasp its meaning, understand that in increasing j, M j g0 "saturates" the algebra A k a,b × B 2q c .Having 0 ≤ j ≤ r, the construction is designed so that the skew-factor B 2q c does not have any effect on the first k components of M j g0; the component k + 1 remains at 0; and when j equals r, the value of the kth component of M j g0 exceeds or equals a.Nevertheless, when the value of j exceeds r, the k + 1 component of M j g0 (i.e., the component of M j g0 in the skew-factor B 2q c ) leaves the value 0, and its evolution is helpful to measure the progress of j by means of a progressive spread of the value 1 from the first component to the last.Regarding "well chosen" q, the replacement of the value 0 in the (k + 1)th component is not complete.Actually, the reason for our definitions is to enunciate and demonstrate Lemma 15.

Lemma 15.
Let A be a finite simple temporal algebra such that g0 = 0, and let a, b ∈ Atm(A) be such that b ≤ pa.Let s be the least j ∈ ω satifying M j g0 = 1 at the same time in A k a,b and A. If r is the value given by Equation ( 1), c = 1, 0, . . ., 0 , and q ∈ ω * then the following properties hold: 1.
For all j ≤ r and 0 For all j ≤ r, If r < s and s − r < 2q, then for all r < j ≤ s, π k M j g0 = 1, j−r) . . ., 1, 0, . . ., 0 in If 2q is the number t(A, a), defined in (3), and y 0 , . . ., Proof.We will prove the first two statements at the same time by induction on j.Actually, in the two algebras the values of g0 are g0, k) . . ., g0, 0 and g0, k) . . ., g0 , respectively.So, the properties follow in the case j = 0. Let us assume that the properties hold for j < r.It is easy to verify the first one in the cases 0 ), but, by the inductive hypothesis, π k−1 (M j g0) has the same value in the two algebras under consideration, so the result holds for k − 1.Since r is the least natural i such that 0, k−1) . . ., 0, a ≤ M i g0, it follows that a π k−1 (M j g0) in A k a,b × B 2q c , and so π k (pM j g0) = p0 and π k ( f M j g0) = f 0. This implies that π k (M j+1 g0) = 0.The third property is obvious from the first one.The fourth statement also follows by induction.
So, the fourth property is established.The fifth follows from the fourth and the given definitions since the equality y 0 , . . . , if s = r and l is odd, 1, . . ., 1, 0, 0 , if s = r and l is even, holds.

Remark 7.
In the sequel, we adopt the following notational use.On the one hand, for all 0 ≤ i ≤ 2q − 1 let z i be the element of B 2q satisfying for all 0 ≤ j ≤ 2q − 1 the condition: On the other hand, if y = y 0 , . . ., y k is in A k a,b × B 2q c , then for every 0 ≤ i ≤ 2q − 1, ϑ i (y) will be the abbreviation of π i (y k ).

The Bound g0 ∧ h0
It is intuitively clear that for formulas π(α), with α ∈ F(X), such that pπ(α) = 0 or f π(α) = 0 it will be possible to find in F t (X) non-zero lower bounds.To fix ideas, here we show the reasoning in the case of pπ(α) = 0, and we leave the case f π(α) = 0, which deserves similar treatment in an obvious way.In order to determine which formulas are atoms, we will show that it is sufficient to study these cases.
Given α ∈ F(X), we need an algebra A α with appropriate properties, including simpleness, in order to build a skew-product A k a,b × B c that is useful for our purposes.The existence of this algebra, as we shall see, is warranted by the results of [9,20] and is here where we bring to our argument-and this is essential-the concept of filtration studied in [9].Later, we will set the temporal algebra B, which in this case will be very simple: the Boolean algebra with two elements: g a constant function, and h = g; having done this, the choice of the atom c is univocal.Theorem 11.Let α ∈ F(X) such that pπ(α) = 0.A finite simple temporal algebra A α and a morphism ṽ : F t (X) −→ A α exist such that ṽ π(α) = 0 and ṽ pπ(α) = 0.
In the following, we will consider that π(α) ∈ F t (X) satisfies pπ(α) = 0. So, A α and ṽ will represent the algebra and the morphism of Theorem 11.We will also assume that a, b ∈ Atm(A α ) are such that a ≤ ṽ π(α) and b ≤ ṽ pπ(α) .Moreover, if B is a temporal algebra, we define the map τ : B −→ B by the equality τy = f py.The reason for involving E 0 here (see Example 1) is exactly to be able to count on Equation (4) as a valid result; it is the key to Theorem 14 obtained through Corollary 9.
Equation ( 4) is valid when i = m, even if m = 0; therefore, the following corollary holds.
In order to apply Corollary 9 within the proof of Theorem 14, we need to assign an appropriate value for m; this value will be selected by means of a concept of degree for formulas α derived from their unique writing.In exchange for involve in our reasoning, a notion of degree conceptually simpler to the others used in the literature, we need to define two functions.In Definition 9, the function deg is given, which should actually be called deg g ; similarly, we should give and use a function deg h in the case f π(α) = 0. Our notion of degree for a formula α, deg g (α), counts the maximum number of nested g-symbols in the formula α.Remark 8.In the following, we will assume that X is the finite set {x 1 , . . ., x n }, where n ∈ ω * .Definition 9. Let α ∈ F(X); the degree of α, deg(α), is defined as follows: The proof of the following theorem follows by induction over the complexity of the formula α.It is straightforward after the definition of degree and Lemma 13.Indeed, validity of Theorem 13 is the reason underlying our definition of degree.Theorem 13.Let v : X −→ A be a temporal valuation and v its extension as a morphism to F(X).Let us consider the temporal valuation w : X −→ A k a,b × B c defined, for all 1 ≤ i ≤ n, by w(x i ) = v(x i ), v(x i ), . . ., v(x i ), 0 .For all α ∈ F(X) and 0 ≤ j ≤ k − deg(α) + 1 , π j w(α) = v(α) (or equivalently, π j w(π(α)) = ṽ π(α) ), whenever deg(α) < k.Now, we give the referred lower bounds.Everything was based on α ∈ F(X) such that pπ(α) = 0 and some simple algebra A α selected from α ∈ F(X) in Theorem 11.The case study is suggested by the different behavior of the skew-product depending on whether the equality g0 = 0 occurs in A α .In the case g0 = 0, the bound is given in Theorem 14; moreover, in the case of that g0 = 0, then our bound is given in Theorem 16.Theorem 14.Let α ∈ F(X) be such that pπ(α) = 0; A α a finite simple temporal algebra; ṽ : F t (X) −→ A α such that ṽ pπ(α) = 0; and consider the element τ m ( f g0) ∈ F t (X), where m = deg(α).If in A α the equality g0 = 0 holds, then 0 < π(α) ∧ τ m ( f g0) < π(α).

Atoms of Free Temporal Algebras
In this section, we show an application of the construction presented above and its properties, namely, the exposition and counting of the atoms of any finitely generated free temporal algebra.This result is well known (see [7]), although our proof is different from the one given there.In fact, Corollary 10 provides a necessary condition for "being atom"; therefore, it is appropriate to select the atoms between the formulas that verify this condition.The technique is to give a particular bijection between the set of atoms under investigation and other that is well known.Schematically, the main idea of this last section is to split up the temporal algebra F t (X) into two pieces, one of which provides no "atoms" and the other -a "trivialization" of F t (X) that makes it practically a free Boolean algebra finitely generated-that provides all the atoms.
Our interest is now focused on free temporal algebras finitely generated.Let us denote the free temporal algebra of O (resp.W) over the non-empty set X by F o (X) (resp.F w (X)).From the results obtained in Section 3, we can easily deduce these others.We have where B(X) = B(X), ∧, ∨, ¬, 1 is the free Boolean algebra freely generated by X, and k : B(X) → B(X) is the map defined by k(a) = 1 for all a ∈ B(X).Let n ∈ ω * , σ ∈ {−1, 1} n , and X = {x 1 , . . ., x n }; define ξ σ ∈ F t (X)/F 0 by the equality ξ σ = {y σ i i : 1 ≤ i ≤ n}, where y i = x i /F 0 and given by Ψ(α/F 0 ) = h0 ∧ g0 ∧ π(α), for all π(α)/F 0 ∈ Atm F t (X)/F 0 , is well defined.Now, our goal is to show that Ψ is in fact a bijective map; for this, we will find an inverse.Lemma 17.Let α be an element of F(X).If π(α) ∈ Atm(F t (X)), then π(α)/F 0 ∈ Atm(F t (X)/F 0 ).
Theorem 17 and Corollary 11 (neither stated nor proved before) are the main results of this section.In Theorem 17, we take advantage of a well-known algebra to establish a bijection between its atoms and those of the finitely generated temporal algebra; this allows us to count its atoms and to know their form.Theorem 17.Let n ∈ ω * and X = {x 1 , . . ., x n } be a finite set with cardinality n.F t (X) has 2 n atoms and Atm F t (X) = {ξ σ ∧ h0 ∧ g0 : σ ∈ {−1, 1} n }.
Proof.Let us consider the mapping Υ : Atm F t (X) → Atm F t (X)/F 0 given by Υ π(α) = π(α)/F 0 , which is also well-defined, as indicated by Lemma 17.On the one hand, The first case is impossible, since then we would have π(α)/F 0 = 0/F 0 and so π(α)/F 0 would not be in Atm F t (X)/F 0 , in contradiction with Lemma 17.Therefore, h0 ∧ g0 ∧ π(α) = π(α) and so (Ψ • Υ)(π(α)) = π(α), for all π(α) ∈ Atm F t (X) .It follows that Ψ and Υ are mutually inverse and bijective mappings.Hence, the cardinality of Atm F t (X) coincides with the cardinality of Atm F t (X)/F 0 .From the definition of Ψ, it follows that Atm F The proof of Corollary 11 is a straightforward consequence of Lemma 17 and Theorem 17.It establishes the non-existence of atoms in the free time algebra when it is generated by a non-finite set and announces the non-existence of atoms in the free algebra of the variety W. Finally, it establishes that the free time algebra generated by a finite set is not atomic even if it has atoms.Corollary 11.Let X be a non-empty set.The following statements hold: 1.
If X is infinite, then F t (X) is atomless.

3.
If X is finite, then F t (X) is not atomic.
Proof.For the first statement, let us assume that Atm(F t (X)) = ∅; then, by Lemma 17, Atm(F t (X)/F 0 ) = ∅.But, F t (X)/F 0 is atomless whenever X is infinite.So, if X is infinite then Atm(F t (X)) = ∅.For the second, we apply F t (X) ∼ = F t (X)/F 0 × F t (X)/F 1 (see Theorem 7) and F w (X) ∼ = F t (X)/F 1 .If X is infinite, we apply that F t (X) is atomless (the first statement) to obtain that Atm F w (X) = ∅; moreover, if X is finite then, from Theorem 17, we have |Atm(F t (X))| = |Atm(F o (X))|; hence, Atm F w (X) = ∅.For the third statement, the second makes impossible to be F o (X) × F w (X) atomic; therefore, F t (X) is not atomic.

Conclusions
In this paper, we have investigated how the element g0 ∧ h0 intervenes in the order of the temporal algebra A = A, ∧, ∨, ¬, g, h, 1 .We have studied the varieties of temporal algebras for which [0, g0 ∧ h0] has extreme values, i.e., {0} and A; this has provided the varieties W and O, respectively.This has allowed us to obtain that every temporal algebra is isomorphic to one, which is a product of a certain element of O and another in W; this is the content of Theorem 7. Subsequently, this result has been particularized to the free temporal algebra generated by X, and this has allowed one, in the application of the 7 section, to count atoms the contributed by the O factor (all) and those contributed by the W factor (nothing).We consider this approach to be one of the essential aspects of the original methodology we propose in our article.
As a second contribution, we have been able to obtain an original characterization of simple temporal algebras.The characterization we provide makes use of the operators L and M. The characterizing fact (see Theorem 9) is to be able, for each element of A other than 1 (resp.0), to take it to 0 (resp.1) by a (finite) iteration of the application of L (resp.M).The study of simplicity in algebraic structures is a classical topic in universal algebra; in this case, we have been able to obtain a very satisfactory criterion due to the clarity of the information it provides and being arithmetical in nature.
On our way to investigate the role played by the element g0 ∧ h0, we have devised an unconventional product of temporal algebras that we have provisionally called skewproduct (see Definition 6).It is based on finite temporal algebras and their previously selected atoms.The definition of the temporal operations in this "product" algebra is not componentwise, and in applications it must be tailored to the purpose; in our case, it was the study of the role of g0 ∧ h0.
Section 5 is very technical, but we highlight Lemma 15 in it.Also of interest are Corollary 8 and Lemma 16, where we establish the behavior of the construction with respect to the simplicity of the skew-factors.
Theorem 14 and Theorem 16 show the use of the product construction introduced above.They show how given a formula of the free temporal algebra satisfying certain conditions compatible with nonatoms, it is possible to take advantage of the properties of some conveniently constructed skew-product algebra in order to find a nonzero lower bound of it.This allows one to prove easily, as we have done, that every atom of the free temporal algebra is bounded by g0 ∧ h0.It is here that we see something reminiscent of the classical lifting technique.
Finally, as an application, we give another proof of Theorem 1.1 of [7] (p.61) about the number of atoms of F t (X), whenever X is of cardinality n (see Theorem 17).Specifically, the technique of proof is to give a particular bijection between the set of atoms under investigation and another well known finite set that we specify.As an original contribution, we add the information on atomicity provided by Corollary 11.Along the way, we have particularized the structure theorem we gave based on O and W to the case of the free temporal algebra, noting the key role it plays in the study of atomicity.As far as we know, the statement of Theorem 1.1 is the only known thing that has been included in this work; however, the proof that we give as an application of the previous constructions and the results are totally novel; in fact, what we present here is a technique.
We believe that we have introduced a tool that could be useful as part of a demonstration technique.In the future, we will investigate the role of this construction in the field of polymodal algebras (see [11,14,17,19]).However, in the short term, contributing to the study of order and atomicity in temporal varieties along the lines of [7] will be a high priority for us.In [22], we presented an approach to the study of independently introduced D n varieties in [8].There, we sensed the need to organize the ideas contained in this article before delving into varieties that contemplated the stabilization of the powers of L starting from a given one; in fact, when studying [8] we see the profuse use it makes of g0 ∧ h0, which has been deeply studied in this work.Note that an important point of connection between this work and [8] is in Theorem 8. We strongly believe that our general results could be used to study the finitely generated free algebra on the variety D n .On the other hand, Tomasz Kowalski has left his study on D 2 so we could make progress in the subscript.In fact, as far as we know the current state of the problem is that left by those papers.
which represents the reciprocal (resp.direct) image of X by the map k.The relation of precedence induced by A in Ult(A), in symbols ≺, is defined as follows: D ≺ D if and only if g * (D) ⊆ D or using any equivalent condition as p * (D) ⊆ D , f * (D ) ⊆ D, or h * (D ) ⊆ D. It is well known that for any temporal algebra there is a homomorphic inclusion of A into Ult(A), ≺ + .

Theorem 1 .
Let A be a temporal algebra.A ∈ O if and only if ≺= ∅.Proof.Let us assume that A ∈ O, and let D, D ∈ Ult(A).If D ≺ D , then p * (D) ⊆ D .Since p1 = 0, it follows that 0 ∈ D , which is impossible since D = A. Conversely, let us assume that ≺= ∅.From Example 2, Ult(A), ∅ + is in O.Moreover, since A is a subalgebra of Ult(A), ∅ + then A ∈ O.

Definition 4 .
Let W be the class of temporal algebras A satisfying O(A) = {0}.

Theorem 4 .
W is a variety.

Theorem 6 .Remark 1 .
Let A be a temporal algebra.Then, Rad o (A) = F 0 and Rad w (A) = F 1 .Proof.It follows from Corollary 3 that Rad o (A) ⊆ F 0 and Rad w (A) ⊆ F 1 .The converse inclusions are straightforward from Lemma 7. We have, from Theorem 6 and Lemma 5, a clear relation between O(A) and Rad w (A), namely, ¬O(A) = Rad w (A).In the following, A/Rad o (A) (resp.A/Rad w (A)) will be represented by A o (resp.A w ).

Theorem 7 .Corollary 4 .
For all temporal algebra A, A ∼ = A o × A w .Proof.Since any two congruences of a Boolean algebra permute, it is enough to show that the temporal filter generated by Rad o (A) ∪ Rad w (A) is A and that Rad o (A) ∩ Rad w (A) = {1}.Both facts occur according to Theorem 6.The variety T is generated by the class O ∪ W.

Remark 5 .Corollary 8 .
If B = A and c = b, the symbol A k+1 a,b (resp.A) will represent the algebra A k a,b × A b (resp.A 1 a,b ).Let a A be a finite simple temporal algebra and y ∈ A \ {0}.If y, . . ., y ∈ A k a,b then there exists m ∈ ω * such that M m y, . . ., y = 1, . . ., 1 and M m y = 1.