Strong quasi-ordered residuated system

: The concept of residuated relational systems ordered under a quasi-order relation was introduced in 2018 by S. Bonzio and I. Chajda. In such algebraic systems, we have introduced and developed the concepts of implicative and comparative ﬁlters. In addition, we have shown that every comparative ﬁlter is an implicative ﬁlter at the same time and that converse it does not have to be. In this article, as a continuation of previous research, we introduce the concept of strong quasi-ordered residuated systems and we show that in such systems implicative and comparative ﬁlters coincide. In addition, we show that in such systems the concept of least upper bound for any two pair of elements can be determined.


Introduction
T he concept of residuated relational systems ordered under a quasi-order relation was introduced in 2018 by S. Bonzio and I. Chajda [1]. Previously, this concept was discussed in [2]. The author introduced and developed the concepts of filters in this algebraic structure as well as several types of filters such as implicative, associated and comparative filters [3][4][5][6].
In [6,Theorem 3.4], it is shown that every comparative filter of a quasi-ordered residuated system A is an implicative filter of A and the reverse it need not be valid [6,Example 3.3]. When analyzing the properties of comparative filters, a requirement appears that a quasi-ordered residuated system satisfies the condition (1) If the system A satisfies the previous condition, then each comparative filter F of A has the following property and, in that case, if the implicative filters satisfy the condition (2), then F is a comparative filter of A.
In order to achieve the conditions under which each implicative filter will be a comparative filter of a quasi-ordered residuated system, we have designed (Definition 6) the concept of strong quasi-ordered residuated systems. In such systems, the condition (1) is always fulfilled and, therefore, in that systems implicative and comparative filters coincide (Theorem 5). Finally, we show (Theorem 6) that in strong quasi-ordered residuated systems the least upper bound 'u v' for each pair u, v of elements can be determined. We finish this article by the statement (Theorem 7) that (A, ) is a distributive upper semi-lattice.

Concept of quasi-ordered residuated systems
In article [1], S. Bonzio and I. Chajda introduced and analyzed the concept of residual relational systems.
is an algebra of type 2, 2, 0 and R is a binary relation on A and satisfying the following properties: (1) (A, ·, 1) is a commutative monoid; (2) We will refer to the operation · as multiplication, to → as its residuum and to condition (3) as residuation.
The basic properties for residuated relational systems are subsumed in the following: Recall that a quasi-order relation on a set A is a binary relation which is reflexive and transitive (Some authors use the term pre-order relation).  Example 2. For a commutative monoid A, let P(A) denote the powerset of A ordered by set inclusion and '·' the usual multiplication of subsets of A. Then P(A), ·, →, A, ⊆ is a quasi-ordered residuated system in which the residuum are given by (∀X, Y ∈ P(A))(Y → X := {z ∈ A : Yz ⊆ X}).

Example 3. Let R be a field of real numbers. Define a binary operations '·' and '→' on
Then, A is a commutative monoid with the identity 1 and A, ·, →, <, 1 is a quasi-ordered residuated system.

Remark 1.
Quasi-ordered residauted system, generally speaking, differs from the commutative residuated lattice A, ·, →, 0, 1, , , R where R is a lattice quasi-order. First, our observed system does not have to be limited from below. Second, the observed system does not have to be a lattice. However, the difference between a quasi-ordered relational system and a CRPM (Example 6) is only in order relations since a quasi-order relation does not have to be antisymmetric. More about this last-mentioned algebraic structure can be found in [8].
The following proposition shows the basic properties of quasi-ordered residuated systems.

Concept of filters
In this subsection we give some notions that will be used in this article.
For a nonempty subset F of a quasi-ordered residuated system A we say that it is a filter of A if it satisfies conditions: In the article [3], the conditions were also analyzed:

Remark 2.
In implicative algebras, the term 'implicative filter' is used instead of the term 'filter' we use (see, for example [9,10]) because in the structure we study the concept of filter is determined more complexly than requirements (F3). It is obvious that our filter concept is also a filter in the sense of [9][10][11]. The term 'special implicative filter' is also used in the aforementioned sources if the implicative filter in the sense of [9] satisfies some additional condition.
There is considerable diversity in the literature in the use of terms that cover additional conditions that are met by filters (see, for example [12][13][14]). The terms we opted for our previous papers [5,6] and for use in this paper are taken from [13,14].

Definition 4.
[5, Definition 3.1] For a non-empty subset F of a quasi-ordered residuated system A we say that the implicative filter of A if (F2) and the following condition Definition 5. [6, Definition 3.1] For a non-empty subset F of a quasi-ordered residuated system A we say that a comparative filter of A if (F2) and the following condition are valid.

Theorem 2. [6, Theorem 3.4]
Any comparative filter of a quasi-ordered residuated system A is an implicative filter of A.

Proposition 2. [6, Proposition 3.2] Let
A be a quasi-ordered residuated system that satisfies the condition: Then any comparative filter F in A satisfies the the condition: Theorem 3. [6, Theorem 3.3] Let F be an implicative filter of a quasi-ordered residuated system A satisfying (13). Then F is a comparative filter of A.
Notions and notations that are used but not previously defined in this paper can be found in [1,[3][4][5].

Concept of strong quasi-ordered residuated systems
In this section we introduce the concept of strong quasi-ordered residuated systems. Considering the fact that the quasi-order relation ' ', which appears in the determination of this algebraic system, does not have to be antisymmetric, the following definition gets a clearer meaning. Definition 6. For a quasi-ordered residuated system A it is said to be a strong quasi-ordered residuated system if the following holds: (14) is valid, then (14) is also valid. The reverse does not have to be true.
The following is an example of a non strong QRS: It can be easily checked that A is a quasi-ordered residuated system. Since . Thus, A is not a strong quasi-ordered residuated system. Now, we give an example of strong quasi-ordered residuated system. A = {1, a, b, c} and operations '·' and '→' defined on A as follows: 1 1 a b c  a a a a a  b b a b a  c c a a  Direct verification it can prove that A is a strong quasi-ordered residuated system.

Remark 4.
It is generally known that a quasi-order relation on a set A generates an equivalence relation ≡ := ∩ −1 on A. Due to properties (9) and (10), this equivalence is compatible with the operations in A. Thus, ≡ is a congruence on A. In light of this remark, the condition (14) can be written in the form In this paper, we shall investigate the structure of strong quasi-ordered residuated systems.

Theorem 4.
In a strong quasi-ordered residuated system A the following holds: Proof. Assume that A is a strong quasi-ordered system. For given u, v ∈ A, let be u v. First, as v (u → v) → v is valid according to (11), from here we immediately get the following by (14). Secondly, from u v it follows 1 u → v by (3). From here, applying (10), we obtain (u As a significant consequences of this theorem we can prove some important properties of strong quasi-ordered residuared systems. In what follows, we need the following lemma: Lemma 1. Let A be a strong quasi-ordered residuated system. Then the following holds: Proof. Let A be a quasi-ordered residuated system and let u, v ∈ A be arbitrary elements. As v u → v holds according to (11), by Theorem 4, we conclude that the required formula is valid.
Thus, designing a strong quasi-ordered residual system environment in such an environment it can be proven the following result: Theorem 5. Let A be a strong quasi-ordered residuated system. Then the comparative and implicative filters of A coincide.
Proof. By Theorem 2, each comparative filter is an implicative filter in any quasi-ordered residuated system. The second part of the proof of this theorem follows directly from the previous Lemma and Theorem 3.
The notion "least upper bound" is well-defined for partial order relations. Although it is not common to use this definition for quasi-order relations because, in the general case, for quasi-order relations the "least upper bound" is not unique, when it comes to a strong quasi-ordered relational system, this concept can be determined as shown in the following theorem: Theorem 6. Let A be a strong quasi-ordered residuated system. For any u, v ∈ A, the element is the least upper bound of u and v.
Proof. It is clear that the following hold: (11) and (14). This shows that u v is the upper bound for u and v. If z is any common upper bound of u and v, then by Theorem 4, On the other hand, according to (10) and (15). Therefore, u v is the least upper bound of u and v in the system A.
The following example shows that condition (14) is crucial for the defining of the least upper bound. Then A = A, ·, →, 1 is a quasi-ordered residuated systems where the relation ' ' is defined as follows : By direct verification it can be proved that A is a quasi-ordered residuated system but is is not a strong system. For example, for Since d = 1, we conclude that A is not a strong system. However, on the other hand, in this case we still have b d and c d. Obviously, 1 is an upper bound of b and c also, but we cannot define the least upper bound b c as in the previous theorem.
We end this section by the following theorem: Theorem 7. Let A be a strong quasi-ordered residuated system. Then (A, ) is a distributive upper semi-lattice in the following sense (∀x, y, z ∈ A)((x y) z ≡ (x z) (y z)).
Proof. Let x, y, z be arbitrary elements of a strong quasi-ordered residuated system. From x x z and y y z it follows x y (x z) (y z). At the other hand, we have z (x z) (y z). Thus (x y) z (x z) (y z).
Conversely, from x x y (x y) z and z (x y) z it follows x z (x y) z. Analogous to the previous one, we can get y z (x y) z. Hence (x z) (y z) (x y) z.
This proves the theorem.

Remark 5.
The term 'distributive upper semi-lattice' used here differs from the concept of 'distributive join semi-lattice' which appears for example in the book [15] (pp. 99).
Of course, the question arises quite naturally: Since (A, ) is an upper semi-lattice, how are the standard statements for semi-lattices applied in this case?

Final conclusion and further work
The concept of quasi-ordered residuated system was introduced and analyzed by Bonzio and Chajda in [1]. This system differs from the commutative residuated lattice A, ·, →, 0, 1, , , R where R is a lattice quasi-order (see Remark 1). In this article, a specific quasi-ordered system it was designed in which it was possible to determine the least upper bound for any two elements of the system. In such a newly defined environment, implicative and comparative filters have been shown to coincide.
In future work, we could study the internal structure of such a designed quasi-ordered residuated system as well as some of its substructures such as, for example, filters (so-called prime filter) that satisfy the additional condition (∀u, v ∈ A)(u v ∈ F =⇒ (u ∈ F ∨ v ∈ F)).