Semiring-Valued Fuzzy Sets and F-Transform

: The notion of a semiring-valued fuzzy set is introduced for special commutative partially pre-ordered semirings, including basic operations with these fuzzy structures. It is showed that many standard MV -algebra-valued fuzzy type structures with standard operations, such as hesitant, intuitionistic, neutrosophic or fuzzy soft sets are, for appropriate semirings, isomorphic to semiring-valued fuzzy sets with operations deﬁned. F-transform and inverse F-transform are introduced for semiring-valued fuzzy sets and properties of these transformations are investigated. Using the transformation of MV -algebra-valued fuzzy type structures to semiring-valued fuzzy sets, the F-transforms for these fuzzy type structures is introduced. The advantage of this procedure is, among other things, that the properties of this F-transform are analogous to the properties of the classical F-transform and because these properties are proven for any semiring-valued fuzzy sets, it is not necessary to prove them for individual fuzzy type structures.


Introduction
Shortly after the introduction of fuzzy sets and their lattice-valued variants by L. A. Zadeh, two new tendencies appear, the development of which continues to this day. The first of these tendencies consists in creating various generalizations of fuzzy sets and their lattice-valued variants, motivated mainly by the application possibilities of these new structures. In that way, new fuzzy type structures are created, which include, for example, intuitionistic fuzzy sets, neutrosophic fuzzy sets, hesitant fuzzy sets or fuzzy soft sets. For basic information about these structures and their possible applications see, e.g., [1][2][3][4][5][6] for intuitionistic fuzzy sets, refs. [7][8][9][10][11][12][13][14] for fuzzy soft sets, refs. [15][16][17][18] for hesitant fuzzy sets and [19][20][21] for neutrosophic sets. Some of these structures can be relatively easily approximated using classical fuzzy sets, others create completely new structures with their own theory. In addition to these "primary" new structures, their various clones, formed by mutual combinations of different structures, very often begin to appear. These new structures include, for example, intuitionistic hesitant fuzzy sets [22][23][24], intuitionistic fuzzy soft sets [25,26], hesitant fuzzy soft sets [27][28][29][30] and many others. In most cases, only a very minimal theory is developed for these new fuzzy type structures, but their application possibilities are very extensive, as evidenced by, among other things, the extensive citation of these structures on Google Scholar.
Simultaneously with the development of new fuzzy type structures and their applications, for classical fuzzy sets and lattice-valued fuzzy sets new methods simplifying calculations with these structures are also being developed. This trend is related, among other things, to the expansion of the use of fuzzy sets both for applications using large data sets, such as image processing, and for applications working in real time. In order to use these applications effectively, either powerful computing technology or simplification of the task is needed.
A natural response to these requirements was the introduction of a number of theoretical tools in fuzzy set theory, which deal with the transformation of a given fuzzy sets space. If we consider, for example, fuzzy sets with a lattice L as the value-set structure, most of these transformations can be characterized as a special mapping T : L X → L Y of fuzzy sets spaces, where X and Y are basic sets and Y ⊆ X. An important feature of these transformations is, in particular, that for each of these transformations T there is a so-called inverse transformation T * : L Y → L X , such that the composition T * T( f ) is an approximation of f ∈ L X .
One of the important transformation methods for both classical [0, 1]-valued fuzzy sets and for fuzzy sets with complete residuated lattices as value set is the so-called F-transform method, which was defined by I. Perfilieva [31]. Fuzzy transform (F-transform, shortly) represents a method in fuzzy set theory, which is used in many applications in signal and image processing [32][33][34], signal compressions [35,36], numerical solutions of ordinary and partial differential equations [37][38][39], data analysis [40][41][42] and many other applications. The F-transform method represents a special transformation map based on a system of fuzzy sets defined on a given universe, which is called a fuzzy partition. F-transform defined by a fuzzy partition A significantly reduces the computational complexity of operations with fuzzy sets, because instead of fuzzy sets defined on the original set X, it allows to work with fuzzy sets on the index set of the fuzzy partition A and then transform the result using the inverse F-transform to the original fuzzy sets space L X .
Typical tasks of this type are algorithms used in image processing, time series analysis, or even the solutions of differential equations with uncertainties. For many of these tasks, methods that use other fuzzy type structures, including hesitant, intuitionistic, or fuzzy soft sets, have also been used successfully. For illustration of these methods in fuzzy type structures see [43][44][45][46][47]. To extend the application potential of these new fuzzy type methods, it is therefore natural to address the issue of reducing the computational complexity of operations with these new fuzzy type structures. One of the possible approaches to reduce this complexity seems to be the use of the F-transform analogy for these new fuzzy type structures.
The lattice-based F-transform is defined by default for fuzzy sets with a complete residuated lattices L as value-sets. This lattice allows both the construction of F-transform and the inverse F-transform. The key assumption of these constructions is the fact that the F-transform concerns standard fuzzy sets, i.e., mappings X → L. Unfortunately, many of the new fuzzy type structures cannot be easily transformed into mappings of this type. For example, if we consider fuzzy soft sets in the space (X, K), where X is the basic set and K is the set of criteria, a fuzzy soft set is a pair (E, s), where E ⊆ K and s : E → L X . In that case (E, s) is not expressed as the mapping X → L , where L is a complete residuated lattice.
This problem led, among other things, to the gradual use of values structures other than complete residuated lattices and, subsequently, the definition of transformation maps associated with these new structures. An example of these modified transformation maps are the so called Q-module transforms, where Q stands for unitale quantale [48,49]. From the algebraic point of view, this structure is a bit more general than that of a residuated lattice and it allows to express the lattice-based F-transforms with the help of two residuated homomorphisms between Q-modules. Another approach we use in our previous paper [50], where the F-transform is defined as a semimodule homomorphism of free semimodules defined over special semirings, based on the residuated lattice L.
Although the F-transform method is very successful in applications, it is surprising that no full analogy of the F-transform has yet been defined for other types of fuzzy structures, which were mentioned in the introduction. In our previous paper [51] we tried to fill this gap by introducing the concept of the F-transform for hesitant, intuitionistic and fuzzy soft sets with special lattice-valued structures. However, for the possibility of the use of this theory in applications, the theory of inverse F-transform was still missing in these structures.
Our objective is to show how some of the methods successfully used for classical L-fuzzy sets can be universally transformed to analogical methods used in new fuzzy type structures, such as intutionistic, hesitant, neutrosophic of L-fuzzy soft sets and their mutual combinatons. Even if these fuzzy type structures have a completely different forms than the standard mappings X → L typical for L-fuzzy sets and, therefore, the methods of classical L-fuzzy sets cannot be applied directly to them. An integral part of this transformation must be the fact that these transformed methods applied in fuzzy type structures have, as far as possible, properties analogous to the original methods.
In this paper, we try to meet this goal for the direct and inverse F-transform methods, which are one of the most commonly used methods for L-valued fuzzy sets, both in theory and in applications. We adapted this method to use for a large part of the new L-fuzzy type structures, including intuitionistic, hesitant, neutrosophic or L-fuzzy soft sets. Although a large part of the new fuzzy type structures deal with, among other things, the issue of image and signal processing and data analysis, the F-transform methods have not yet been used for these L-fuzzy type structures, in contrast to classical fuzzy sets, where for these tasks the F-transform methods are often used. The advantage of such adapted method is its universal use in various fuzzy type structures, including the above mentioned L-fuzzy type structures. Moreover, the properties of this adapted F-transform method in these new L-fuzzy type structures will be analogous to the properties of the F-transform for classical L-fuzzy sets and it will not be necessary to prove them separately for individual fuzzy type structures. Hence, it seems natural that this adapted F-transform method can be used for improving the present applications of new L-fuzzy type structures in image and signal processing and data analysis.
This method is based on a simple principle: we transform each of the mentioned L-valued fuzzy type structures in a set X into mappings X → R, where R is a suitable partially ordered semiring. Moreover, we suppose that for the ring R there exists another ring R * with the same underlying set R and with non-trivial involutorial isomorphism Φ : R → R * . In that case we say that a new L-fuzzy type structure is transformable to R-fuzzy set The F-transform for these R-fuzzy sets is then the special mapping R X → R Y from the set of all R-fuzzy sets in X to the set of all R-fuzzy sets in Y and it can be defined as a formal transcription of the classical L-valued F-transform formulas using operations of semirings R and R * instead of lattice operations. The advantage of this procedure is also that it allows to introduce the concept of the inverse F-transform for fuzzy type structures and thus expand the application possibilities of these fuzzy type structures.
In summary, the aim of our paper is as follows: • To introduce the notion of R-fuzzy sets and to show that a significant part of Lfuzzy type structures, where L is the complete MV-algebra, can be transformed into R-fuzzy sets, • To show that for R-fuzzy sets it is possible to define analogies of concepts and transformations with analogous properties known from the classical L-fuzzy sets, • To show that these new concepts and transformations for R-fuzzy sets can be transformed back into concepts and transformations of the original L-fuzzy type structures. The content of the paper is as follows. After the introductory section, where we repeat some basic definitions from the theory of MV-algebras and pre-ordered semirings, in Section 3.1 we introduce the notion of the R-fuzzy set, where R is a commutative posemiring. This notion will be based on the notion of the adjoint pair (R, R * ) of po-semirings with the same underlying set R and such that there exists an involutorial isomorphism Φ : R → R * of po-semirings. We also show that for any MV-algebra L, the above L-valued fuzzy type structures such as hesitant fuzzy sets, intuitionistic fuzzy sets, neutrosophic fuzzy sets and soft fuzzy sets and their mutual combinations can be transformed to R-fuzzy sets, where R are suitable po-semirings. On the set R X of R-fuzzy sets we defined basic operations with R-fuzzy sets and we prove some basic properties of these operations. We also prove that the above mentioned L-fuzzy type structures in a set X with special operations defined for these structures are isomorphic to R X with defined operations.
In Section 3.2 we deal with the F-transform theory for R-fuzzy sets. It should be emphasised that the investigation of applications of this theory is not the primary goal of the paper. Our primary goal is to show how the F-transform methods can be extend to R-fuzzy sets and translated into the language of the respective L-fuzzy type structures. We introduce the notions of upper and lower F-transform and upper and lower inverse F-transform for R-fuzzy sets and using the transformation of L-fuzzy type structures to R-fuzzy sets, we show how the F-transform can be defined in these fuzzy type structures. We also investigate some properties of F-transforms for R-fuzzy sets and relationships between direct an inverse F-transforms.

Methods and Basic Structures
A basic membership structure of fuzzy sets for lattice-valued F-transform is a complete residuated lattice (see e.g., [52]), i.e., a structure L = (L, ∧, ∨, ⊗, →, 0 L , 1 L ) such that (L, ∧, ∨) is a complete lattice, (L, ⊗, 1 L ) is a commutative monoid with operation ⊗ isotone in both arguments and → is a binary operation which is residuated with respect to ⊗. Recall that a negation of an element a in L is defined by ¬a = a → 0 L . By the order relation ≤ on L we understand the order relation of the lattice (L, ∧, ∨).
For our purposes in the paper we use a special variant of residuated lattice, namely, the MV-algebra [53], i.e., the structure L = (L, ⊕, ⊗, ¬, 0 L , 1 L ) satisfying the following axioms for elements of L: If we put x ∨ y = (x ⊕ ¬y) ⊗ y, x ∧ y = (x ⊗ ¬y) ⊕ y, x → y = ¬x ⊕ y, then (L, ∧, ∨, ⊗, →, 0 L , 1 L ) is a residuated lattice. MV-algebra is called complete, if that lattice is a complete lattice. The standard example of the MV-algebra is Łukasiewicz algebra L L = ([0, 1], ⊕, ⊗, ¬, 0, 1), where In the rest of the paper, L is the complete MV-algebra. The L-fuzzy set in a set X is a map f : X → L. The set of all L-fuzzy sets in X is denoted by L X .
We recall a basic definition of the F-transform and inverse F-transform for L-fuzzy sets.

Definition 1 ([31]
). Let X be a set and let A = {A y : y ∈ Y} ⊆ L X . Then 1.
A is called a fuzzy partition, if {core(A y ) : y ∈ Y} is a partition of X, where core(A) = {x ∈ X : A(x) = 1 L }, i.e., y∈Y core(A y ) = X, core(A y ) ∩ core(A z ) = ∅, if y = z.

2.
A mapping F X,A : L X → L Y is called the upper F-transform based on A, if for s ∈ L X , y ∈ Y, F X,A (s)(y) = x∈X s(x) ⊗ A y (x).

3.
A mapping G X,A : L Y → L X is called the inverse upper F-transform based on A, if for g ∈ L Y , x ∈ X, G X,A (g)(x) = y∈Y ¬A y (x) ⊕ g(y).
In our previous paper [51] we have shown that fuzzy type transformations for various fuzzy type structures can be equivalently defined using two different tools, based on the theory of monads and monadic relations and on the theory of semirings and semimodules. In this paper, we extend this method based on the theory of semirings so that it can be used to define the inverse F-transform, and special examples of this extended structure should be the fuzzy type of structure mentioned in the introduction, i.e., hesitant, intuitionistic or soft fuzzy sets.
The semiring appears for the first time in [54] and this notion was elaborated in [55]. For our purposes, we need to use semirings in which a partially order or pre-order relation is defined. This notion of a partially ordered semiring was first introduced in the [56]. For more information about semimodules and their applications see, e.g., [57,58].
Definition 2 ([54,56]). A partially pre-ordered (or ordered) idempotent commutative semiring R = (R, ≤, +, ×, 0 R , 1 R ) (or, shortly, po-semiring) is an algebraic structure with the following properties: (v) (R, ≤) is a partially pre-ordered (or ordered) set such that for all a, b, c ∈ R the following hold If a structure R satisfies only axioms (i) − (iv), then R is called only the semiring. An important example of a po-semiring which seems to be very useful for the F-transform theory was published in the paper of Di Nola and Gerla [59].
The notion of a semimodule over a semiring is taken from [55]. We use the commutative version of this notion only. Moreover, analogously as for semirings, we need to use the notion of a partially pre-ordered (or ordered) semimodule which is introduced in [60].
(M, , 0) is a commutative monoid, 2. : If the structure M satisfies only axioms 1. − 6., it is called a R-semimodule. If there can be no misunderstanding, for simplicity, we will sometimes use only the term semiring and semimodule instead of a po-semiring and a po-semimodule, respectively.
If a semiring R and R-semimodule M = (M, M , 0 M ) are such that for any subsets S ⊆ R and N ⊆ M, there exist sums of elements r ∈ S and x ∈ N, then M is called a complete R-semimodule. The sum of elements x ∈ N is denoted by M x∈N x and the sum of elements r ∈ S is denoted by ∑ R r∈S r. In the paper [61] the following examples of po-semimodules were presented.

Example 2 ([61]).
(1) Let X = ∅, L be a complete residuated lattice and let L ∨ = (L, ≤, ∨, ⊗, 0 L , 1 L ) be the po-semiring from Example 1. For all f , g ∈ M = L X define , , The notion of a semiring homomorphism and R-semimodule homomorphism is defined standardly as follows from the following definition. Definition 4. Let R and S be po-semirings, M and N be po-R-semimodules.

2.
A R-semimodule homomorphism Ψ : M → N is a mapping Ψ : M → N such that (a) Ψ : M → N is an order preserving homomorphism of monoids, Let us consider the following example, which is very important for our purposes.

R-Valued Fuzzy Sets
As we mentioned in the introduction, in order to be able to use analogies of constructions and methods that are standardly used in classical L-fuzzy sets for new L-valued fuzzy type structures, we will transform these L-valued fuzzy type structures in a set X into mappings X → R, where R is a suitable po-semiring. The specificity of these po-semirings, which will be used as value sets of these new L-fuzzy type structures, lies in the fact that instead of one po-semiring R we will use a pair of po-semirings (R, R * ) with the same underlying sets, which are adjoint in a specific way. The value sets defined in that way for new fuzzy type structures will allow us not only to transform them into X → R mappings, but also to introduce operations on a set of R-fuzzy sets, analogous to existing operations on L-valued fuzzy type structures.
We begin this section with the definition of the pair of adjoint po-semirings.

1.
In the rest of the paper, if (R, R * ) will be the adjoint pair of semirings with the adjoint isomorphism Φ, then R and R * are supposed to be complete po-semirings with the same operations as in Definition 5.

2.
It should be observed that the following statements dual to statements from Definition 5 also holds: In the next examples we show some non-trivial examples of adjoint pairs of posemirings which, as we will see later, are closely related to mentioned L-fuzzy type structures. All these examples are based on the complete MV-algebra L = (L, ⊗, ⊕, ¬, 0, 1) with sup ∨ and inf ∧ defined by these operations..

2.
The partially pre-ordered semiring R * Then (R 1 , R * 1 ) is the adjoint pair of po-semirings and Φ is the adjoint po-semiring isomorphism.

1.
The po-semiring Then (R 2 , R * 2 ) is the adjoint pair of po-semirings and Φ is the adjoint po-semiring isomorphism.

1.
Let K be the fixed set of criteria. The po-semiring where ¬ψ is defined component-wise. Then (R 3 , R * 3 ) is the adjoint pair of po-semirings and Φ is the adjoint po-semiring isomorphism.
It is clear from the above examples that the pair (R, R * ) represents a certain generalization of the pair (L ∨ , L ∧ ), where (L, ⊕, ⊗, ¬, 0, 1) is the MV-algebra. It would therefore be possible to expect that just as the original MV-algebra L can be derived from the pair (L ∨ , L ∧ ) by operations ⊕, ⊗, ¬, 0 and 1, another MV-algebra L can be analogously derived from the pair (R, R * ), i.e., L = (R, ×, × * , Φ, 0 R , 1 R ). Unfortunately, it is not true, as the following example shows. Example 9. Let (R 1 , R * 1 ) be adjoint pair of po-semirings with adjoint isomorphism Φ from Example 5 and let L be the Łukasiewicz algera. Then (R 1 , × 1 , × * 1 , Φ, 0 1 , 1 1 ) is not an MV-algebra. In fact, it is easy to see that, in general, we have and it follows that R 1 is not a MV-algebra. In fact, to prove the first row is trivial.
as follows from the definition of ≤ 1 , because 0.5 ≥ 0.6.
Using the adjoint pair (R, R * ) of po-semirings we can now define the notion of Rfuzzy sets and we can also introduce basic operations with R-fuzzy sets. Finally, using this definition, we show that mentioned L-fuzzy type structures, such as hesitant, intuitionists, neutrosophic or soft L-fuzzy sets and also their mutual combinations are R-fuzzy sets where operations with these R-fuzzy sets are identical to operations defined on these fuzzy type structures. Definition 6. Let (R, R * ) be adjoint pair of po-semirings with adjoint isomorphism Φ. Let X be a set.

1.
A mapping s : X → R is called the R-fuzzy set in X. For x ∈ X, s(x) ∈ R is called the R-membership value of s in x.

2.
The operations with R-fuzzy sets s, t in X and elements a ∈ R are defined by (a) The intersection s t is defined by (s t)(x) = s(x) The union s t is defined by The complement ¬s is defined by ¬s(x) = Φ(s(x)), The external multiplication by elements from R is defined by (a s)(x) = a × s(x), (e) The pre-order relation ⊆ between R-fuzzy sets is defined by

3.
For arbitrary x ∈ X, by η X (x) we denote the R-fuzzy set in X such that In the following simple lemma we show some basic properties of operations with R-fuzzy sets. On the other hand, because R-fuzzy sets represent a relatively strong generalization of standard L-fuzzy sets, it cannot be expected that the same properties of operations will apply to them as for classical L-fuzzy sets. We will show these differences in the following examples. Lemma 1. Let (R, R * ) be adjoint pair of po-semirings with adjoint isomorphism Φ. Let X be a set and s, t, w be R-fuzzy sets in X. Then the following statements hold. 1.
s s = s, s s = s, 2.
From the definition of R-fuzzy sets in a set X it follows that the set of all R-fuzzy sets in a set X is the free R-semimodule R X . For convenience of readers we recall the definition of this structure. Definition 7. Let R = (R, ≤ R , + R , × R , 0 R , 1 R ) be a po-semiring. By the free R-semimodule over a set X we understand the po-R-semimodule R X = (R X , ≤, , 0, ) defined by 1. For .
It is clear that any po-semiring homomorphism Φ : R 1 → R 2 can be extended to the semimodule homomorphism Φ e : R X 1 → R X 2 of corresponding free semimodules, where In the next part we show that the mentioned hesitant, intuitionistic, neutrosophic or soft L-fuzzy sets are, in fact, R-fuzzy sets for appropriate po-semiring R. For convenience of the readers, we repeat firstly the definitions of these structures. As we mentioned in the Introduction, as the value-lattice in the paper we use the MV-algebra L. Definition 8 ([2,9,17,20]).

1.
A hesitant L-fuzzy set in a set X is a mapping h : X → 2 L , i.e., for x ∈ X, h(x) ⊆ L. By H(X) we denote the set of all hesitant fuzzy sets in X.

2.
An intuitionistic L-fuzzy set in a set X is a pair (u, v) of L-fuzzy sets on X, such that ¬u ≥ v. By J(X) we denote the set of all intuitionistic fuzzy sets in X.

3.
A neutrosophic L-fuzzy set in a set X is a triple (u, v, w) of L-fuzzy sets on X, called a truth membership function u, an indeterminancy membership function v and a falsity membership function w. By N(X) we denote the set of all neutrosophis fuzzy sets in X.

4.
Let K be the fixed set of criteria. A pair (E, s) is called an L-fuzzy soft set in the set X, if ∅ = E ⊆ K and s : E → L X . By S(X) we denote the set of all fuzzy soft sets in X.

Remark 3.
For a fuzzy soft set (E, s), a mapping s can be extended to the mapping s : K → L X such that s(e)(x) = 0 L for e ∈ K \ E. In that case (E, s) can be identified with the mapping (E, s) : In what follows we use this interpretation of L-fuzzy soft sets.
In the following proposition we show that the elements of sets H(X), J(X), N(X) and S(X) can be represented as R-fuzzy sets in a set X for appropriate po-semirings R and sets H(X), J(X), N(X) and S(X) are isomorphic to the free R-semimodules R X of all R-fuzzy sets in a set X. This result allows us to interpret the above mentioned L-fuzzy type structures in the universal way as the R-fuzzy sets and to use common tools and methods from the theory of R-fuzzy sets for these structures. In the next Section we will illustrate this procedure on the issue of the F-transform for these fuzzy type structures.
For arbitrary po-semiring R, by (R X , , , ¬, ) we denote the algebraic structure of all R-fuzzy sets with operations from Definition 6. If T(X) is an arbitrary from the sets H(X), J(X), N(X) and S(X), by (T(X), ∪, ∩, ¬, •) we denote this set with operations of union, intersection, negation and external multiplication by element from L defined on these fuzzy type structure. These operations for intuitionistic, neutrosophis and soft fuzzy sets are defined in [2,9,20]. The original definition [16] of these operations for hesitant L-fuzzy sets is very atypical in comparison with other fuzzy type structures, because, for example, it does not guarantee distributivity between ∪ and ∩ operations, as is the case of other fuzzy type structures. For our purposes we use a modified definition, where for hesitant L-fuzzy set s, t we define (s ∪ t)( We use the following notation. Notation 1. Let F (X) = (F(X), ∪, ∩, ¬, •) be a fuzzy type structure in a set X with the basic operations union, intersection, negation and external product. F (X) is called to be transformable to R-fuzzy sets, if F (X) is isomorphic to the structure (R X , , , ¬, ), where (R, R * ) is the adjoint pair of po-semirings with adjoint isomorphism Φ. Proposition 1. Let X be a set.

Proof.
(1) Any hesitant L-fuzzy set is a mapping X → 2 L and it follows that H(X) = R X 1 . The isomorphism of operations follows directly from the definitions of operations in R X 1 and in H(X). (2) Any intuitionistic L-fuzzy set is a mapping X → {(α, β) ∈ L 2 : ¬α ≥ β} and it follows that J(X) = R X 2 . The isomorphism of operations follows directly from the definitions of operations in R X 2 and in J(X). (3) According to Remark 3, any L-fuzzy soft set (E, s) ∈ S(X) is a mapping (E, s) : We define the mapping Λ : S(X) → R X 3 such that We prove that Λ(S(X)) = R X 3 . Because Λ(E, s) ∈ R X 3 , we have Λ(S(X)) ⊆ R X 3 and we need to prove only the inverse inclusion. Let g ∈ R X 3 , g(x) = (E x , ψ x ) ∈ R 3 for x ∈ X. Let the element (E, s) ∈ S(X) be defined by For x ∈ X we have Λ(E, s)(x) = (E, s x ) and we show that Λ(E, s)(x) and g(x) are equal as mappings K → L. For k ∈ K we have Therefore, Λ(E, s) = g and Λ(S(X)) = R X 3 . It is easy to see that Λ is the injective map. The isomorphism of operations in R X 3 and in S(X) follows directly from definitions of these operations in R X 3 and S(X). Therefore, the algebraic structure S(X) is isomorphic to the algebraic structure R X 3 . (4) Any neutrosphic L-fuzzy set is a mapping X → L 3 and it follows that N(X) = R X 4 . The isomorphism of operations follows directly from the definitions of operations in R X 4 and in N(X).
Free R-semimodules R X have specific R-base, which will be essential for F-transform constructions.
Lemma 2. Let (R, R * ) be the adjoint pair of complete semirings with adjoin isomorphism Φ and let X be a set.

1.
The set B = {η X (x) : x ∈ X} is the R-base of the free R-semimodule R X .

Proof.
(1) We show firstly that the following identity holds for arbitrary f ∈ R X : In fact, according to Definition 7, for a ∈ X we obtain and the identity (1) holds. If for some elements {r x ∈ R : x ∈ X} the identity R X x∈X r x η X (x) = 0 holds, according to Definition 7, for arbitrary a ∈ X we obtain Therefore, B is the R-base of R X . (2) We show that for arbitrary f ∈ (R * ) X we have In fact, according to Definition 5 and Definition 7, for a ∈ X we have and the identity (2) holds. The rest is similar to the previous case.

F-Transform for R-Fuzzy Sets
The F-transform method for L-fuzzy sets is one of the very effective tools for reducing the difficulty of uncertainties tasks requiring operations with large sets of this uncertain data. Typical tasks of this type are algorithms used in image processing, time series analysis, or even the solutions of differential equations with uncertainties. For many of these tasks, methods that use other fuzzy type structures, including hesitant, intuitionistic, or fuzzy soft sets, have also been used successfully. For illustration of these methods in these fuzzy type structures see [43][44][45][46][47].
A large part of new fuzzy type methods are used, among others, in applications related to image processing. In these applications, individual images are transformed into objects of these fuzzy type structures, for example, intuitionistic fuzzy sets or hesitant fuzzy sets, which are defined on pixels of individual images. Due to the value-sets of these new fuzzy type structures, this in turn leads to the fact that the computational complexity of operations with these objects is higher than in the case of classical fuzzy sets.
It is therefore natural to create a certain F-transform analogy for these fuzzy type structures, which would subsequently make it possible to reduce the computational complexity of these tasks and thus expand the application possibilities of these methods.
The classical theory of F-transform for L-fuzzy sets deals with two types of this transformation, namely with upper and lower F-transforms [31], which represent the upper and lower variant (in terms of ordering) of the transformed function. Since both of these transformations preserve the order relation defined on fuzzy sets, the possibility of choosing from two variants of the transformed function expands, among other things, the application possibilities of this theory. The resulting upper or lower transformations of the original function thus represent a significant simplification of the original L-fuzzy set f and thus simplify the overall processing and operations with the original function. However, in order to take full advantage of these transformations of the original function, there must be a possibility to reproduce the original function from these simplified functions, i.e., there must be so-called inverse F-transform.
In this section we introduce both these types of the transforms and their inverse variants for R-fuzzy sets, which allows the use of these terms for general fuzzy type structures, including hesitant, intuitionistic, neutrosophic or fuzzy soft sets and their possible combinations and we show some relationships among these structures.
Analogously as for classical L-fuzzy sets, the F-transform for R-fuzzy sets is also based on analogies of fuzzy partitions. Unlike the classic concept of L-fuzzy partition originally defined in [31], fuzzy type partitions for R-fuzzy sets will be defined more generally. The definition chosen in this way then allows to choose different types of fuzzy partitions according to the conditions of a particular task. Definition 9. Let R be a complete po-semiring. A subset A = {p y : y ∈ Y} ⊆ R X is called the R-partition of X if there exists a binary relation u ⊆ X × Y such that the following conditions are satisfies: In the following definition we introduce both basic types of the F-transform for Rfuzzy sets, i.e., upper and lower F-transform. This notion can be introduced for arbitrary adjoint pair of po-semirings with adjoint isomorphism. Definition 10. Let (R, R * ) be adjoint pair of po-semirings with adjoint isomorphism Φ, R = (R, ≤, +, ×, 0, 1), R * = (R, ≤ * , + * , × * , 0 * , 1 * ) and let A = {p y : y ∈ Y} be a R-partition of a set X.

1.
The upper F-transform of R-fuzzy sets in X is a mapping F ↑ A,X : R X → R Y defined by

2.
The lower F-transform of R-fuzzy sets in X is a mapping F ↓ A,X : R X → R Y defined by In the following example we illustrate how the F-transform can be defined also for mutual combinations of various fuzzy type structures. As an example we consider intuitionistic fuzzy soft sets which were introduced in [62]. We use an extended variant of intuitionistic fuzzy soft sets, where membership values are from the complete MValgebra L.

Example 10.
Recall the definition of the intuitionistic L-fuzzy soft set. Let K be the fixed set of criteria and let X be a set. An intuitionistic L-fuzzy soft set in a set X is a pair (E, s), where E ⊆ K and s : K → J (X) = R X 2 is such that s(k) = 0 R 2 , if k ∈ K \ E, where 0 R 2 : X → R 2 is the constant function with the valued 0 R 2 . We show that any intuitionistic L-fuzzy soft set is a R 5 -fuzzy set for appropriate po-semiring R 5 . To define the F-transform for intuitionistic L-fuzzy soft sets we need the adjoint pair (R 5 , R * 5 ) of po-semirings and adjoint isomorphism Φ 5 : R 5 → R * 5 . We set where R 2 and R * 2 are from Example 6. Let the operations in R 5 and R * 5 be defined point-wise from operations in R 2 and R * 2 , respectively. Let the mapping Φ 5 : R 5 → R * 5 be defined by It is easy to see that (R 5 , R * 5 ) is the adjoint pair of po-semirings and Φ 5 is the adjoint isomorphism. We show the there exists the isomorphism between the structure IF S(X) = (IFS(X), ∪, ∩, ¬) of all intuitionistic L-fuzzy soft sets in a set X with standard operations ∪, ∩, ¬ defined in [62] and the free R 5 -po-semimodule R X 5 with the point-wise operations defined from + 2 , × 2 and Φ 2 .
In fact, let us defined the map Γ : Γ is the surjective map. In fact, for f ∈ R X 5 , we set It follows that Γ(E, s) = f and it is easy to see that Γ is the isomorphism. Finally, we show how the formula for lower F-transform looks for intuitionistic L-fuzzy soft sets. Using the above isomorphism Γ between IF S(X) and R X 5 , instead of elements from IF S(X) we use elements of R X 5 . Let A = {p y : y ∈ Y} ⊆ R X 5 be a R 5 -partition of X. For x ∈ X, k ∈ K, let p y (x)(k) = (α yxk , β yxk ) ∈ R 2 . According to Definition 10, for arbitrary f ∈ R X 5 , f (x)(k) = ( f 1,xk , f 2,xk ), x ∈ X, k ∈ k, we obtain the lower F-transform F ↓ A,X : In the following theorem we will show how to characterize the lower and upper F-transforms for R-fuzzy sets also without the use of a fuzzy partition. Theorem 1. Let (R, R * ) be adjoint pair of po-semirings with adjoint isomorphism Φ. Let F : R X → R Y be an arbitrary mapping. 1.
The following statements are equivalent.
(a) F is the R-po-semimodule homomorphism and there exists a relation u ⊆ X × Y with dom(u) = X, codom(u) = Y and such that There exists a R-partition A = {p y : y ∈ Y} such that F = F ↑ A,X . 2.
The following statements are equivalent.

Proof.
(1) Let the condition (b) holds. We set (x, y) ∈ u ⇔ A y (x) = 1 R . It is easy to that F ↑ A,X is the R-po-semimodule homomorphism and that the additional condition holds. Let the condition (a) holds. According to Lemma 2, for arbitrary element f ∈ R X we obtain f = R X x∈X f (x) η X (x). Because F is a R-semimodule homomorphism, according to Definition 7, we obtain where we set p y (x) = F(η X (x))(y). Therefore, A = {p y : y ∈ Y} is a R-partition and the statement 2. holds.
(2) Let the condition (b) holds. For r ∈ R * , f , g ∈ (R * ) X and y ∈ Y we obtain and F ↓ A,X is the R * -po-semimodule homomorphism. Moreover, for (x, y) ∈ u we have Let the condition (a) holds. According to Lemma 2, we have where we set p y (x) = Φ(F(¬(η X (x)))(y)) and A = {p y : y ∈ Y}.
As we mentioned in the introduction, one of the main advantages of the classical F-transform for L-fuzzy sets is the existence of the inverse F-transform, which allows to reconstruct with some accuracy the original function from its F-transform image. It is therefore natural to try to define a similar inverse transformation for the F-transform of R-fuzzy sets and to determine its basic properties. We introduce the inverse F-transform for R-fuzzy sets in the following definition. Definition 11. Let (R, R * ) be adjoint pair of po-semirings with adjoint isomorphism Φ and let X be a set. Let A = {p y : y ∈ Y} be a R-partition of X.

1.
The upper inverse F-transform of R-fuzzy sets defined by A is a mapping G ↑ A,X : R Y → R X , defined by

2.
The lower inverse F-transform of R-fuzzy sets defined by A is a mapping G ↓ A,X : R Y → R X , defined by There are simple relationships between the transformations F ↑ , F ↓ and G ↑ , G ↓ , respectively, as can be seen from the following proposition. Proposition 2. Let (R, R * ) be adjoint pair of po-semirings with adjoint isomorphism Φ and let X be a set. Let A = {p y : y ∈ Y} be a R-partition of X. The following statements hold for arbitrary a ∈ R, f , g ∈ R X , h, k ∈ R Y , x ∈ X, y ∈ Y.
(5) We have The proof of (6) can be done analogously and it will be omitted.
(8) Let y ∈ Y be arbitrary and let x ∈ X be such that (x, y) ∈ u. We have and, analogously, The proof is similar to the proof of (8) and it will be omitted. The rest of the proof can be done easily and it will be omitted.
Analogously as for direct F-transform, the inverse F-transform can be characterised without the notion of R-partition. It is not surprising that these characterisations are, in some aspects, dual to the characterisations of direct F-transforms and that the proofs of these characterisations are analogical to the proofs for direct F-transforms. It follows from the following lemma.
Lemma 3. Let (R, R * ) be adjoint pair of po-semirings with adjoint isomorphism Φ and let X, Y be sets. Let A = {p y : y ∈ Y} be a R-partition of X and let B = {q x : x ∈ X} be a R-partition of Y, such that ∀x ∈ X, ∀y ∈ Y, p y (x) = q x (y).
Then for any s ∈ R Y hold The proof of Lemma is trivial and it will be omitted. Using Lemma 3 and Theorem 1 it is easy to see that the following characterisations of lower and upper inverse F-transforms without the notion of R-partition hold. Theorem 2. Let (R, R * ) be adjoint pair of po-semirings with adjoint isomorphism Φ and let X be a set. Let G : R Y → R X be an arbitrary mapping. 1.
The following statements are equivalent.
(a) G is the R * -po-semimodule homomorphism (R * ) Y → (R * ) X and there exists a relation u ⊆ X × Y with dom(u) = X, codom(u) = Y and such that There exists a R-partition A = {p y : y ∈ Y} such that G = G ↑ A,X . 2.
The following statements are equivalent.
(a) G is the R-po-semimodule homomorphism R Y → R X and there exists a relation u ⊆ X × Y with dom(u) = X, codom(u) = Y and such that There exists a R-partition A = {p y : y ∈ Y} such that G = G ↓ A,X .
The proof follows directly from Theorem 2 and Lemma 3 and it will be omitted.

Notation 2.
Let F (X) = (F(X), ∪, ∩, ¬, •) be a fuzzy type structure in a set X which is transformable to R-fuzzy sets.

1.
The mappings F ↑ X,A , F ↓ X,A from Definition 10 are called upper and lower F-transform of this fuzzy type structure F (X).

2.
The mapping G ↑ Y,A , G ↓ X,A from Definition 11 are called the upper and lower inverse Ftransform of this fuzzy type structure F (X).
For the classical L-valued F-transform and its inversion more properties hold than stated in Proposition 2. Because R-fuzzy sets comprise a lot of fuzzy type structures and some of them could be very different from L-fuzzy sets, we cannot expect that the F-transforms for arbitrary R-fuzzy sets will have the same properties as F-transforms for L-fuzzy sets. On the other hand, many R-fuzzy sets defined for particular fuzzy type structures have additional properties that imply other important properties of F-transforms and their inversions. Let us consider the following example of these additional properties. Definition 12. Let (R, R * ) be adjoint pair of po-semirings with adjoint isomorphism Φ. We say that (R, R * ) satisfies the axiom (+), if the following condition holds.
As we can see from the following proposition, for adjoint pairs of po-semirigs (R, R * ) which satisfy the axiom (+), many analogies properties of direct and inverse F-transforms well known for classical F-transform for L-valued fuzzy sets also hold. Proposition 3. Let (R, R * ) be adjoint pair of po-semirings with adjoint isomorphism Φ, which satisfies the axiom (+). Let A = {p y : y ∈ Y} be a R-partition of X. The following statements hold.
Proof. For simplicity, instead of F ↑ A,X we use only F ↑ and similarly for other F-transforms. (1) According to axiom (+) we have Because Φ(p y (x)) × * (p y (z) × f (z) ∈ R, according to Definition 2(v) we have Φ(p y (x)) × * (p y (z) × f (z) ≥ 0 and, according to axiom (+), for arbitrary y ∈ Y it follows According to Definition 5, for arbitrary y ∈ Y we have Therefore, using inequalities (3), (4), (5) and (6), we have (2) According to Proposition 2 and previous part (1), we have (3) From the axiom (+) and its dual version, analogously as in (1), it follows (4) The proof can be analogously as in (2) and it will be omitted.
The proof can be done analogously as in (7) and it will be omitted.
From Propositions 2 and 3 and from Example 11 the following Corollary follows, which is important for possible applications of the F-transform theory for other fuzzy type structures. Corollary 1.

1.
For arbitrary fuzzy type structure which is transformable to R-fuzzy sets, the F-transform and inverse F-transform of this fuzzy type structure satisfy all properties from Proposition 2.

2.
The F-transform and inverse F-transform of L-fuzzy soft sets satisfy all properties of Proposition 3.

Discussion and Conclusions
In lattice-valued fuzzy set theory, there are a number of fuzzy type structures that represent either generalisations of classical lattice-valued fuzzy sets or are built on these fuzzy sets using special constructions. A common feature of these new fuzzy type structures is especially their usability in specific applications, as evidenced by a number of research publications related to these structures. Although these new fuzzy type structures are in some way based on the classical theory of lattice-valued fuzzy sets, for the theory and methods used in these fuzzy type structures, own procedures are developed that often represent procedures modified in one or another way from the classical fuzzy set theory. It is therefore natural to ask the following question. Is it possible to develop a new general theory based on methods or theories from classical lattice-valued fuzzy sets, which could be directly applied to a large part of new fuzzy type structures and at the same time had as many properties similar to the original theory as possible? In this paper, we have tried to answer this question at least in part and to present one possible variant of such a general theory that could be successfully used to create new methods in new lattice-valued fuzzy type structures in a unified way. This method is based on the use of the so-called R-fuzzy sets, i.e., fuzzy sets with commutative pre-ordered semirings R as value sets and with operations defined by operations of these semirings. In the paper, we have shown that many of new L-fuzzy type structures, where L is a complete MV-algebra, including hesitant, intuitionistic, neutrosophic or fuzzy soft sets, including their mutual combinations are transformable to R-fuzzy sets for suitable semirings R. This allows us to "copy" the classical methods used in L-fuzzy sets and simply transfer these methods to these new fuzzy type structures in a unified way. In addition, if a given fuzzy type structure is transformable to R-fuzzy sets, we can determine in advance what properties the possible application of a new method to this fuzzy type structure will have.
As an illustrative example of such a procedure, we chose the F-transform method, which is often used in L-fuzzy sets and their applications but so far was not used in these new fuzzy type structures. For this purpose, we defined the F-transform method for general R-fuzzy sets in the way formally similar to the classical F-transform, and using the transformation of new L-fuzzy type structures to R-fuzzy sets, we introduced the F-transform for these new fuzzy type structures. The advantage of this procedure is, among other things, that the properties of these F-transforms in new fuzzy type structures are known in advance, because these properties are proven for any R-fuzzy set.
Like any method, the use of R-fuzzy sets has its limitations. One limitation is that to transform a given L-fuzzy type structure to R-fuzzy sets, L is required to be a MValgebra. However, since a large part of applications using L-fuzzy type structures is based on Łukasiewicz algebra L, which is the MV-algebra, this is not a fundamental limitation. A certain limitation of this method results from its ability to cover a number of fuzzy type structures. Due to the differences of individual structures, it is not expected that all these structures will have the same properties. As a result, general R-fuzzy sets have only properties that apply to all L-fuzzy type structures that can be transformed into R-fuzzy sets. On the other hand, R-fuzzy sets have not properties which are special properties only for some transformable fuzzy type structures. An example of a property that does not apply to general R-fuzzy sets is the axiom (+) from Definition 12. This axiom applies only to some types of R-fuzzy sets and therefore only to some types of new L-fuzzy type structures.
We must emphasise that this paper is intended to be a theoretical basis for the possible transformation of methods which are standardly used in classical fuzzy sets to applications in various fuzzy type structures. For further development of methods based on the theory of R-fuzzy sets, we will deal with, among other things, rough R-fuzzy sets and their applications to various new fuzzy type structures. Although fuzzy type structures are often used in both theory and some applications, most real applications of these structures are based on the use of [0, 1] value set with specific operations instead of MV-algebra L. It is therefore appropriate to focus on the transformation of these fuzzy type structures into R-fuzzy set, where R will be appropriate semirings, or their generalisations with specific operations and properties.