1. 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
and
, 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
. However, neither of these papers nor the rest of those consulted isolate in one study the role played by
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 skew-factors, 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,
, and those in which ≺ has only a connected component,
. 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
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
and the other in
, 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
, 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
, 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
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.
2. Preliminaries
The paper deals with temporal algebras. A temporal algebra is an algebra of type such that:
(T.1) is a Boolean algebra.
(T.2) Both g and h are ∧-morphisms (i.e., , for ).
(T.3) The equivalence is satisfied.
(T.4) .
As usual, we also consider in A the operators and , as well as the unary operators L and M defined, respectively, by and .
The class
of temporal algebras is a variety. In the sequel, we will denote by
(resp.
) the algebra of terms of type
over (resp. the free temporal algebra freely generated by) the set
X. The universe of
(resp.
) is denoted by
(resp.
).
is a quotient of
by certain well known congruence
or simply
(see [
21]). Hence, the elements of
are the quotient classes
, with
. If we represent by
, or simply
, the epimorphic projection of
onto
and
i is the inclusion map of
X in
, it is well known that for all temporal algebras
and for all mappings
there are unique morphisms
and
such that
and
. If
, which we will write indistinctly
or
. For all temporal algebra
,
is the set of atoms of de underliying Boolean algebra.
In this article, we shall use (resp. ) to represent the set of natural numbers (resp. non-zero natural numbers). For any set X, here (resp. ) stands for the power set of X (resp. finite parts of X, i.e., finite elements of ); moreover, (resp. ), by definition, stands for (resp. ).
It is possible to construct temporal algebras in a standard form as follows. A structure is a pair , where T is a non-empty set and . Given a structure , the temporal algebra is, by definition, the algebra , where ∧,∨, and ¬ are the Boolean operations ∩, ∪, and complementation over , respectively. As for and , these operators are defined by and .
Let
be a temporal algebra. The concept of
filter,
ideal, and
ultrafilter is the proper of the underlying Boolean algebra, i.e.,
is a filter iff, by definition:
,
whenever
, and
whenever
and
(see [
21] (p. 127)); the filter
F is an ultrafilter iff, by definition,
F is maximal with respect to the property that
(see [
21] (p. 132)). The symbol
(resp.
) will denote the set of filters (resp. ultrafilters) of the temporal algebra
, i.e., the Boolean algebra
. For all map
and
(resp.
), the set
(resp.
) is, by definition, the set
(resp.
);
(resp.
), which represents the reciprocal (resp. direct) image of
X by the map
k. The relation of precedence induced by
in
, in symbols ≺, is defined as follows:
or using any equivalent condition as
,
, or
. It is well known that for any temporal algebra there is a homomorphic inclusion of
into
.
Here, we will use the following result proved in [
9]: let
such that
; then, there exists a temporal valuation
over a finite temporal algebra
such that
.
Let be a temporal algebra. A filter F (resp. an ideal I) of is a temporal filter (resp. ideal) iff, by definition, (resp. ) whenever (resp. ). The symbol will represent the set of temporal filters of . A temporal filter of 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 will be denoted by ; the set will be denoted by .
If
,
will denote the smallest temporal filter of
including
X, that is
If , we henceforth will represent the set (resp. ) by (resp. ). For all , here 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 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 1. Let be a temporal algebra. Then, f, p, g, and h are increasing functions.
Lemma 2. For all temporal algebra and for all :
- 1.
.
- 2.
.
- 3.
.
- 4.
.
where ≤ is the Boolean partial order.
Lemma 3. Let be a finite temporal algebra. For all , the following assertions are equivalent:
- 1.
,
- 2.
,
- 3.
if , then ,
- 4.
if , then .
3. 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 ; 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 .
Definition 1. Let be the class of temporal algebras satisfying .
Since the above definition of temporal algebras is equational, 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 1. Let be a Boolean algebra and a map defined by , for all . The algebra is an element of . In the particular case that , we will write to represent the simple temporal algebra .
Example 2. Let us consider the structure , where and , and the temporal algebra . It is clear, from the definition of , that . Hence, is an element of .
From property T.3, it is straightforward to show that the equality holds if and only if any of the equalities , , and hold. This brings three new equivalent definitions of . Furthermore, if is a temporal algebra and , then g is constant since it is increasing (see Lemma 1) and 0 is the minimum of the lattice ; 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 is constant. So, we have four new definitions of .
In any elements of , it occurs that the relation ≺ is equal to ∅. Furthermore, this gives a characterization of elements in involving ≺.
Theorem 1. Let be a temporal algebra. if and only if .
Proof. Let us assume that , and let . If , then . Since , it follows that , which is impossible since . Conversely, let us assume that . From Example 2, is in . Moreover, since is a subalgebra of then . □
For every temporal algebra in , both g and h are constantly 1; then, L is the identity map in A. It follows that each filter of each temporal algebra in is closed for the map L, and so coincides with . This is not a characterization of algebras in ; nevertheless, is a distinguished subclass of the class (actually a subvariety of the variety) of temporal algebras verifying the property .
From the equality , it follows at once that and so . Moreover, the equality implies that, for all , . Therefore, any temporal algebra in is a subdirected power of the algebra . So, the variety is semisimple and generated by .
Corollary 1. The variety is minimal in the lattice of subvarieties of .
Proof. Let us assume that is another subvariety of such that . Let and . As is equal to and is a variety, it follows that . Therefore, contains the variety generated by , that is, it includes . It follows immediately that . □
Definition 2. Let be a temporal algebra. The set is defined by the following equality: Given a temporal algebra and an element , is the disjoint union of two sets, namely, that of ultrafilters containing a, , and that of ultrafilters containing , . When , the following theorem holds (of course represents the restriction of ≺ to the set ).
Theorem 2. Let be a temporal algebra and . Then, .
Proof. Let a be an element of , D an ultrafilter such that , and . If , then , so and this is impossible if is maximal. If , we again obtain the above contradiction, now using f instead of p. So, the theorem follows. □
By means of elements of , it is possible to distinguish subsets of isolated ultrafilters with regard to ≺. In the following for all , .
Lemma 4. Let be a temporal algebra and . The set is a temporal ideal.
Proof. Obviously, is an ideal. Furthermore, is temporal since if then , i.e., . Analogously, and so . □
Theorem 3. For any temporal algebra , .
Proof. The proof is given by double-inclusion. Let us take such that . Hence, and . Since p and f are both two increasing functions (see Lemma 1), we have and . So, . Conversely, let us suppose that , i.e., . By Lemma 2, we have . Therefore, . □
Corollary 2. Let be a temporal algebra. Then, is a temporal ideal.
Proof. It is an inmediate consequence of Lemma 4 and the fact that . □
Definition 3. For all temporal algebra , we define and by the following equalities: Theorem 3 gives a very concrete description of the set . It is indeed the principal ideal generated by . Lemma 5 follows immediately from this remark and Corollary 2 (note that ).
Lemma 5. Let be a temporal algebra. Then, is a temporal filter of .
Given a temporal algebra , we can consider the temporal ideal . Our inmediate aim is to study the algebras with extreme value of . Obviously, a temporal algebra for which belongs to .
Definition 4. Let be the class of temporal algebras satisfying .
Theorem 4. is a variety.
Proof. For all temporal algebra , if and only if ; then, the members of admit an equational definition, so is a variety. □
Theorem 5. Let be a temporal algebra. The following statements are equivalent:
- 1.
.
- 2.
For all there is such that or .
Proof. First, let us assume that , i.e., . As is isomorphic to a subalgebra of , then . If and there is no such that or then , and this is impossible. So the second statement follows. The converse can be showed analogously. □
Now, given a temporal algebra we can consider two subsets of temporal filters: one made up by temporal filters D such that and one made up by temporal filters such that . As a consequence, we dispose of two radicals, understanding this concept as in ring theory.
Definition 5. For all temporal algebra , we define the spectrum and the radical by the following equalities:Similarly, we define the spectrum and the radical by the equalities: Lemma 6. Let be a temporal algebra. Then, Proof. Let . Since and g are increasing (see Lemma 1), then we have that , so . Analogously, we have . □
Corollary 3. In any temporal algebra , the following statements hold:
- 1.
,
- 2.
.
Proof. First, from Lemma 6 it follows that . Next, we will prove that . Since , for all , it follows that . Moreover, since f is monotone we have that ; hence, and so . This proves the first statement since .
Moreover, it is clear that . So, . This implies that . □
Lemma 7. Let be a temporal algebra and . Then,
- 1.
If then .
- 2.
If then .
Proof. If , then and so . This implies that . Moreover, if then . It follows that , i.e., , equivalently . □
Theorem 6. Let be a temporal algebra. Then, and .
Proof. It follows from Corollary 3 that and . The converse inclusions are straightforward from Lemma 7. □
Remark 1. We have, from Theorem 6 and Lemma 5, a clear relation between and , namely, . In the following, (resp. ) will be represented by (resp. ).
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
and the other satisfies
; it is in fact the announced structure theorem. This result will be used of the
Section 7.
Theorem 7. For all temporal algebra , .
Proof. Since any two congruences of a Boolean algebra permute, it is enough to show that the temporal filter generated by is A and that . Both facts occur according to Theorem 6. □
Corollary 4. The variety is generated by the class .
In order to complete our study of the defined varieties, we give a new result about and the lattice of its subvarieties.
Corollary 5. is maximal in the lattice of subvarieties of .
Proof. Let be a subvariety of such that , and let . Since , then , and so is on one hand non-trivial and on the other an out-of-joints algebra, as follows from Corollary 3. Let . It is clear that is in the variety . Since generates , then and so . We conclude by Theorem 7 that . □
4. 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 , for all we set by definition (resp. ) and (resp. ). The following lemma describes the elements of .
Lemma 8. Let be a temporal algebra, , and the set defined by the equality:Hence . Proof. It is easy to check that
and that
is a closed order filter for
L; thus,
is a temporal filter. Moreover, if we take
then
, and
exist such that
and
. The natural number
verifies
and
. Therefore,
and so
. Since
is a filter and
, we have that
. For the reciprocal inclusion, let
; then,
and
must exist such that
. However,
and
are closed for operations ∧ and
L; therefore,
. □
Remark 2. In the sequel, the symbol → will denote the binary operation in the universe of any temporal algebra defined by .
In the case that , and , has a special description. The following result, actually an algebraic formulation of the “deduction theorem”, gives this description.
Theorem 8 (Deduction theorem).
Let be a temporal algebra. For all and , the equality: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 containing 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 . Moreover, , thus . If we assume that , then two natural numbers n and m (e.g., ) exist such that , . It follows that , , and hence . We thus conclude that . Moreover, F is temporal because if exists such that and D is temporal, then and so ; hence, the temporality of F follows.
Finally, suppose that is an element of containing and let and such that . In such a case, , which implies that . This concludes the proof. □
Remark 3. Let a temporal algebra. We consider that the precedence of the operator L is greater than that of the operator → (for all , ). So, means . For all nonempty finite subset of A, is by definition the element .
Corollary 6. Let and a finite subset of A. The temporal filter generated by is the set of such that there is verifying .
Lemma 9. Let be a simple temporal algebra. If and , then there is and such that .
Proof. If , then . As is simple, we have and so . The lemma follows at once from the definition of . □
Lemma 10. Let be a temporal algebra. Then, the statements:
- 1.
For all and , there is and such that .
- 2.
For all , there is such that .
are equivalent.
Proof. Let us assume the first statement and let . For and there is such that . Conversely, if the second statement is true, , , and , then verifies , and so . If we select and , the first statement is established. □
Corollary 7. Let be a simple temporal algebra. For every , exists such that .
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 be a temporal algebra. Then, the statements:
- 1.
is simple.
- 2.
For every , there is such that .
- 3.
For every , there is such that .
- 4.
For all non-trivial temporal algebra , if 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
to a non-trivial algebra
. If
is non-injective, then there is
and
such that
. We have:
Therefore,
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
is the kernel of a morphism of temporal algebras. □
5. 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 or ; hence, we consider, for example in Definition 6, the condition because if in a finite temporal algebra, then an atom b must exist that is less than or equal to . The choice of the “skew factor” 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 and be finite temporal algebras. Let us assume that , , , and . We define in the unary operations g and h as follows. For all : The proof of the following Lemma 11 boils down to a simple routine check.
Lemma 11. Let and be two finite temporal algebras. Suppose that , , , and . The algebra where ∧, ∨, ¬, and 1 are the operations componentwise on the product 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: Remark 4. In the hypotheses of Lemma 11 and according to its content we know that 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 and are both finite temporal algebras. Moreover, when we write we presupose that: , , , , and, finally, that the temporal operations are according to Definition 6. Sometimes, we will represent the universe of by , though this universe is in fact the set .
Nevertheless, the skew value of matches with its componentwise value. In effect, we have the following simple but important lemma.
Lemma 12. In the equality holds.
Proof. We have the equality . Since , we have that , or equivalently, ; hence, . □
Lemma 13. Let such that and . If there is such that and , for all , then for all , and for all , .
Proof. From the hypotheses of the lemma we have
. Suppose that
and that
or, equivalently, that
. Since
, it follows that
, that is,
. Hence, if
, then
, from which the first statement follows. Moreover, according to the definition of
g in
we have, for all
,
From this, it follows that each
satisfies the equality
or
, depending on whether
holds or not. □
The following lemma indicates what can we expect about conmutativity between M and . Its proof follows easily by induction on m given that , and that M is an increasing function.
Lemma 14. Let and be finite temporal algebras. For all and , in the inequality holds.
Now, we introduce the hypothesis of simplicity in the factors of the new product. The simplicity of and implies that is simple and conversely. Nevertheless, we will prove a weaker result.
Theorem 10. Let and be two finite simple temporal algebras and . If , then exists such that , for some satisfying .
Proof. Since is simple and , by Theorem 9, exists such that . This and Lemma 14 imply that there is such that . It is clear from Lemma 14 that . □
Remark 5. If and , the symbol (resp. ) will represent the algebra (resp. ).
Corollary 8. Let a be a finite simple temporal algebra and . If then there exists such that and .
In the arguments that we will give later, finding bounds requires a more careful approach in the case . In Definition 7, we define the necessary parameters, except the notion of degree (see Definition 9), to build the appropriate algebra to cover what we need. Moreover, in Definition 8 we give a specific temporal algebra that we are interested in using as algebra in a specific skew-product .
Definition 7. Let be a finite simple temporal algebra for which the condition holds and there are such that . From Lemma 12 and Corollary 8, the set of all such that at the same time in and is non-empty; so, it is possible to take the minimum s of this set. LetandWe define the value by the equalityFinally, let us define by . Definition 8. Given , if B represents the set then we define the functionsas follows (): Remark 6. Let . It is clear that the algebra is a temporal algebra. For , the operations f and p are as follows:Moreover, in the equality holds. Lemma 15 is a necessary tool to show Theorem 15. In order to grasp its meaning, understand that in increasing j, “saturates” the algebra . Having , the construction is designed so that the skew-factor does not have any effect on the first k components of ; the component remains at 0; and when j equals r, the value of the kth component of exceeds or equals a. Nevertheless, when the value of j exceeds r, the component of (i.e., the component of in the skew-factor ) 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 ()th component is not complete. Actually, the reason for our definitions is to enunciate and demonstrate Lemma 15.
Lemma 15. Let be a finite simple temporal algebra such that , and let be such that . Let s be the least satifying at the same time in and . If r is the value given by Equation (1), , and then the following properties hold: - 1.
For all and , the value of in coincides with its value in .
- 2.
For all , in .
- 3.
in .
- 4.
If and , then for all , in .
- 5.
If is the number , defined in (3), and is in , then .
Proof. We will prove the first two statements at the same time by induction on
j. Actually, in the two algebras the values of
are
and
, respectively. So, the properties follow in the case
. Let us assume that the properties hold for
. It is easy to verify the first one in the cases
. When
, since
in
then the value of
is
. In the case of
, the value of
is
, but, by the inductive hypothesis,
has the same value in the two algebras under consideration, so the result holds for
. Since
r is the least natural
i such that
, it follows that
in
, and so
and
. This implies that
. The third property is obvious from the first one. The fourth statement also follows by induction. For
, the result holds. Actually, according to Property 2 and Property 3 we have
and
; then,
and, furthermore,
. Let us assume that
,
and that the result holds for
. If
stands for
, the inductive hypothesis means that
and
. It is clear that
Hence, all we need is to examine the right-hand side of this equality. Represent by
(resp.
) the value
(resp.
). Since
, then
and so
. On the other hand,
; hence,
. When
, the values of
and
are as follows:
- 1.
; in this case, the result is obvious,
- 2.
and ; if j is even (resp. odd), then (resp. ),
- 3.
, ; therefore, , and so, if j is either even or odd, and .
So, the fourth property is established. The fifth follows from the fourth and the given definitions since the equality
holds. □
Remark 7. In the sequel, we adopt the following notational use. On the one hand, for all let be the element of satisfying for all the condition:On the other hand, if is in , then for every , will be the abbreviation of . Lemma 16. Let be a finite simple temporal algebra such that and such that . Let , and let c be the atom of . If in for some , then .
Proof. Let us assume that , and use induction to show that for all , . In the case , the result follows directly from the hypotheses. Suppose that , ; nevertheless, . Hence, . This implies that . According to the definition of g, since is odd and different from , we conclude that . Since is even, ; therefore, by the definition of h, the equality holds or, equivalently, , which is contradictory with the inductive hypothesis. In particular, we have . By contradiction, let us suppose now that , that is, . Since and , we have that ; hence, and, consequently, , which is contradictory. Therefore, . □
6. The Bound
It is intuitively clear that for formulas , with , such that or it will be possible to find in non-zero lower bounds. To fix ideas, here we show the reasoning in the case of , and we leave the case , 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
, we need an algebra
with appropriate properties, including simpleness, in order to build a skew-product
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
, which in this case will be very simple: the Boolean algebra with two elements:
g a constant function, and
; having done this, the choice of the atom
c is univocal.
Theorem 11. Let such that . A finite simple temporal algebra and a morphism exist such that and .
Proof. Since
, a finite temporal algebra
and a morphism
exist (see [
9]) such that
; hence,
. Since
is finite, it is isomorphic to a product of finite simple temporal algebras (see [
20]). Composing
with the canonical projection over the convenient simple factor of
,
, we obtain the mapping
of the statement. It is clear that
. Therefore, the equality
is impossible. □
In the following, we will consider that
satisfies
. So,
and
will represent the algebra and the morphism of Theorem 11. We will also assume that
are such that
and
. Moreover, if
is a temporal algebra, we define the map
by the equality
. The reason for involving
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.
Theorem 12. Let be a finite temporal algebra. In the algebra , where and , the equality:holds for all . Proof. The proof is by induction on
i. For
, the statement is obviously true. Let us assume that the property holds for
j, and let us take
. It is straightforward to show that
. Since
is an increasing funtion,
increases with
j; hence, for all
,
and so
. By definition of
f and
p we have:
which is just what we wanted to show. □
Equation (4) is valid when , even if ; therefore, the following corollary holds.
Corollary 9. Let be a finite temporal algebra. In the algebra , where and , the equality 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 is given, which should actually be called ; similarly, we should give and use a function in the case . Our notion of degree for a formula , , 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 , where .
Definition 9. Let ; the degree of α, , 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 be a temporal valuation and its extension as a morphism to . Let us consider the temporal valuation defined, for all , by . For all and , (or equivalently, ), whenever .
Now, we give the referred lower bounds. Everything was based on such that and some simple algebra selected from in Theorem 11. The case study is suggested by the different behavior of the skew-product depending on whether the equality occurs in . In the case , the bound is given in Theorem 14; moreover, in the case of that , then our bound is given in Theorem 16.
Theorem 14. Let be such that ; a finite simple temporal algebra; such that ; and consider the element , where . If in the equality holds, then .
Proof. We have . Since , the inequality is not possible; therefore, . Now, all we need is to show that . For this, take the algebra , where and , and define the temporal valuation by the equality . According to Theorem 13, ; hence, . Since holds in , the value of in is , where is the algebra . According to Corollary 9, we have . Since , it follows that , and so . □
Theorem 15. Let be such that and both and the algebra and the morphism whose existence ensures Theorem 11. Let us assume that condition holds in and take the atoms and of . If , , is , and is the extension to of the temporal valuation:defined by , then the properties: - 1.
.
- 2.
.
- 3.
.
hold.
Proof. According to the choice of
s (see Definition 7), the equality
holds in
. Since for all
we have that
, it follows that
and so
. The second property is an immediate consequence of Part 5 in Lemma 15. For the third property, we will show that, under the hypotheses of the theorem, if
q represents to
(
) and, for all
,
is the element of
satisfying for
:
then in
the condition
holds for all
. If
, the result is true by Lemma 16. Let us suppose that
and that the result holds for
i, i.e.,
. If
, then
and, so long as
, we have
Since
, we deduce from (
5) that
; but,
, hence
, which contradicts the inductive hypothesis. In particular, we have
; that is to say,
, which proves part 3. □
Theorem 16. Let such that , and let us assume that in the condition holds. Let and both s and the values defined in Definition 7. Then, Proof. The morphism
satisfies that
and that
. So,
. For
, where
is here the algebra
and
a is the selected atom satisfying
, the condition
holds (see Theorem 15). Nevertheles, since
, Theorem 13 ensures that
; therefore,
. It follows that
and so
. □
Gathering the information provided by Theorem 14 and Theorem 16, we obtain in Corollary 10 an upper bound of the elements in .
Corollary 10. Let be such that . Then, .
Proof. If
, then
or
. If
, then take
equal to
or
as needed (see Theorem 14 and Theorem 16). It follows that
hence the result. In case that
, it is feasible to give a dual reason. □
7. 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
into two pieces, one of which provides no “atoms” and the other —a “trivialization” of
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
(resp.
) over the non-empty set
X by
(resp.
). From the results obtained in
Section 3, we can easily deduce these others. We have
. It is straightforward to verify that
(resp.
) is isomorphic to
(resp.
). Moreover,
is freely generated by
. The temporal algebra
is isomorphic to
, where
is the free Boolean algebra freely generated by
X, and
is the map defined by
for all
. Let
,
, and
; define
by the equality
, where
and
Then,
has
atoms and
.
It is straightforward to show that if
then
. Moreover, if
then it is clear that
if and only if
. Therefore, the mapping
given by
, for all
, 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 . If , then .
Proof. Let us assume that . It follows from Corollary 10 that . Since is an atom, it is different to 0; therefore, , so . Then, suppose that . It follows that , and this implies that either or . The first equality is equivalent to and the second one to . □
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 and be a finite set with cardinality n. has atoms and .
Proof. Let us consider the mapping
given by
, which is also well-defined, as indicated by Lemma 17. On the one hand,
and, on the other hand,
. Since
and
, then either
or
. The first case is impossible, since then we would have
and so
would not be in
, in contradiction with Lemma 17. Therefore,
and so
, for all
. It follows that
and
are mutually inverse and bijective mappings. Hence, the cardinality of
coincides with the cardinality of
. From the definition of
, it follows that
. □
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 . 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 is atomless.
- 2.
is atomless.
- 3.
If X is finite, then is not atomic.
Proof. For the first statement, let us assume that ; then, by Lemma 17, . But, is atomless whenever X is infinite. So, if X is infinite then . For the second, we apply (see Theorem 7) and . If X is infinite, we apply that is atomless (the first statement) to obtain that ; moreover, if X is finite then, from Theorem 17, we have ; hence, . For the third statement, the second makes impossible to be atomic; therefore, is not atomic. □
8. Conclusions
In this paper, we have investigated how the element
intervenes in the order of the temporal algebra
. We have studied the varieties of temporal algebras for which
has extreme values, i.e.,
and
A; this has provided the varieties
and
, respectively. This has allowed us to obtain that every temporal algebra is isomorphic to one, which is a product of a certain element of
and another in
; 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
Section 7, to count atoms the contributed by the
factor (all) and those contributed by the
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 , we have devised an unconventional product of temporal algebras that we have provisionally called skew-product (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 .
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 . 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
, 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
and
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
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
, 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
. On the other hand, Tomasz Kowalski has left his study on
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.