Abstract
Omega rings (-rings) (and other related structures) are lattice-valued structures (with being the codomain lattice) defined on crisp algebras of the same type, with lattice-valued equality replacing the classical one. In this paper, -ideals are introduced, and natural connections with -congruences and homomorphisms are established. As an application, a framework of approximate solutions of systems of linear equations over -fields is developed.
Keywords:
fuzzy algebra; omega ring; fuzzy congruence; fuzzy equality; ideals in rings; omega fields; systems of linear equations; complete lattice MSC:
08A72; 03B52; 03E72
1. Introduction
An algebraic structure of a ring in the framework of -structures, where is a complete lattice, is introduced in [1]. Therein some basic properties of -rings are investigated and some related structures are introduced and investigated as well.
In the present paper, we develop this study further, introducing -ideals, connecting them with -congruences and -homomorphisms and continuing our investigation towards the theory of solving systems of equations on -rings, in particular on -fields.
-algebras are classical algebras characterized by a particular lattice-valued relation, so-called -equality, which replaces the ordinary one; according to this generalized equality, -algebras fulfill identities as lattice formulas.
Since -equality is a lattice-valued function, -algebras are objects in the lattice-valued fuzzy framework. Fuzzy algebraic structures are one of the most established topics in the theoretical research of fuzziness. Almost all aspects of classical algebraic structures are “fuzzified”. Besides fuzzy groups, which were studied by hundreds of investigators (e.g., [2,3,4,5,6]), various aspects of fuzzy rings are also investigated (e.g., [7,8,9,10,11]).
The classical framework of fuzzy algebraic structures is based on classical algebras of the corresponding types (e.g., fuzzy groups are constructed by groups, similarly fuzzy rings, etc).
Our framework is different in several aspects. First, we use a lattice as a codomain of functions representing fuzzy sets; therefore, we say that they are lattice-valued [12,13]. Further, -algebras by definition can use wider classes of classical algebras of the corresponding type. Moreover, in the present research, we use -valued equality which does not necessarily fulfill the separability property [1,14]. This enables us to extend our framework more, using full classes of underlying algebras of the given type, as proved in our previous study [1]. However, in general, our study follows the others with various types of -algebras with separability [15,16].
Historically, we have to mention that this type of lattice-valued equality was first introduced by Fourman and Scott [17] for investigations in logic and set theory and later by Höhle [17,18,19,20] in the theoretical development of fuzziness; this framework also contained a separability condition and it was based on a complete Heyting algebra. Demirci, Bělohlávek and Vychodil also conducted research on algebraic structures that were equipped with a concept of similar fuzzy equality (see e.g., [21,22,23,24,25,26,27,28,29]). In this approach, traditional algebras are utilized, but instead of employing strict equality, fuzzy equality compatible with the algebra’s fundamental operations is employed.
To sum up, let us clearly underline the motivating reasons for dealing with -algebraic structures. The first is the usage of generalized, -valued equality instead of the classical “being equal” relation.. Indeed, in many real-life situations, data are corrupted, or they are missing, or simply there is noise in the communication. Then, being equal is often replaced by equal to some extent, and an appropriate many-valued equality can establish a connection among similar objects. In addition, the level of equality of an object to itself is understood as the belonging of this object to a domain with non-sharp boundaries. Finally, in reality, a set of equality levels for different objects need not be linearly ordered, which leads to a complete lattice as a codomain. This points to the second reason for introducing -algebras. They are constructed on classical basic algebras, which are equipped with an -equality. Depending on the identities that they satisfy with respect to this generalized equality, they may be, e.g., -groups, -quasigroups, -rings, etc. Still, the mentioned basic algebras need not be groups, quasigroups, rings, etc. However, an essential property of -algebras is that particular quotient structures of level subalgebras over the levels of -equality are classical algebras fulfilling the mentioned equalities! In other words, classical groups, quasigroups, rings, etc., are hidden as quotient algebras of -groups, -quasigroups, -rings, etc., respectively. Therefore, when dealing with a generalized -structure obtained from a real situation, we can use many suitable features of the corresponding classical structure, which is present in the form of quotients.
2. Preliminaries
2.1. Some Basic Notions from Ordered and Algebraic Structures
In our approach, we mostly deal with functions whose codomain is a complete lattice, which is a partially ordered set in which there are infima (the greatest lower bounds meet) and suprema (the lowest upper bounds join) for all subsets (denoted by ∧ and ∨, respectively) ([30]). The greatest (top) element is denoted by 1 and the lowest (bottom) element by 0.
In the following, we recall some well-known algebraic notions.
We consider a ring to be an algebraic structure of the type , where R is a nonempty set, + and are binary operations, − is a unary operation and o is a constant (nullary operation), such that is a commutative group and is a semigroup and the second binary operation, , is distributive with respect to the first, .
We also consider algebras where are operations of the same type (as for rings) without special properties.
A homomorphism of two algebras of the same type and is a mapping , such that for all ,
, , and .
(Although the operations on S and T are different, for simplicity we use the same symbol for the corresponding operations.)
A kernel of the homomorphism is a relation on R, such that if and only if .
A congruence on is an equivalence relation, on R, which is compatible with all operations:
For , if and , then , and .
The congruence class of a is defined by as usual. The quotient ring is the ring on the set of all congruence classes, where the operations are naturally defined by representatives.
A kernel of a homomorphism is a congruence relation on the domain algebra.
We formulate here the Second Isomorphism Theorem for rings [31]. Since we require it for certain proofs, it is necessary to mention it.
Theorem 1.
If ϕ and θ are congruences on a ring and , then is a congruence on .
2.2. -Valued Sets and Relations
As mentioned, the main objects of this research are functions from various sets in a lattice, named in several ways throughout the literature: fuzzy sets and fuzzy relations (if the domain is a square of a set); also lattice-valued sets and relations; finally, -valued sets and -valued relations, if the codomain lattice is denoted by . In order to unify the notation, throughout the text we use the last version of these, sometimes replacing -valued with lattice valued, for the most general notions. Moreover, for several notions, we use only the prefix (without the word “valued”).
An -valued set on a nonempty set A is a function , where is a complete lattice.
If and are -valued sets, then is an -valued subset of (denoted by ), if for every , .
For , a cut set (p-cut) of is defined by
Example 1.
Let Ω be a lattice in Figure 1, and let be a set. Then, defined by
is an Ω-valued set on A.
| x | a | b | c | d |
| p | 1 | r | r |
Figure 1.
Lattice .
The cut sets of μ are , and .
An -valued relation on A is an -valued set on .
As usual, is symmetric if and is transitive if for all .
A symmetric and transitive -valued relation on A is called an -valued equality on A.
Let be an -valued set and an -valued relation on A. If for , and satisfy
then we say that is an -valued relation on (see, e.g., [32]).
The -valued relation is reflexive on if
Example 2.
Let Ω be a lattice in Figure 1, and let as in Example 1. Let be an Ω-valued relation defined in Table 1.
Table 1.
-valued equality on A.
One can easily check that E is an Ω-valued equality on A. It is also a reflexive Ω-valued relation on the Ω-valued set μ from Example 1.
Let be a nonempty -valued subset of an -valued set , R an -valued relation on and an -valued relation on A. Then, S is a restriction of R to if
In the following, we introduce the (known) concept of lattice-valued compatibility.
If is a complete lattice and is an algebra, then the function is said to be compatible with the operations in F if for any , , for all and for a nullary operation ,
Analogously, an -valued relation on is compatible with the operations in F if the following holds: for every n-ary operation , for all , and for constant ,
Throughout the text, we relate some algebraic properties of lattice-valued objects with their cuts, as follows: a property of an -valued structure A is said to be cutworthy if the analog crisp property holds for every cut-structure , .
2.3. -Rings
An -set is an ordered pair , where R is a nonempty set and E an -valued equality on A [17].
Remark 1.
There is a difference between an -valued set defined in the previous section and an -set as defined here. The former is only a function from a set on a lattice Ω and the latter is a pair consisting of a set and a particular lattice-valued relation on this set.
If is an -set, the related -valued set on R, denoted by , is defined by
E is an -valued reflexive relation on , as defined by (1) (to be more precise, E is an -valued equality on .
If is an algebra and an -valued equality on R compatible with the operations in F, then is an -algebra. Algebra is called the underlying, basic algebra of .
Let be an -algebra and , and briefly let be an identity in the type of . Then, we can state that satisfies identity if
for all and the term operations on corresponding to terms and , respectively.
We continue with the main structure of the present research. An -ring is an -algebra , where is an algebra with two binary operations (), a unary operation (−) and a constant (o), so that the following identities hold in the sense of (7):
We have .
Next, we present some cut properties of -rings. These also hold for -groups and generally for all -algebras as well [14].
Theorem 2.
Let be an Ω-algebra of the type . Then, is an Ω-ring if and only if for every the quotient structure is a ring.
Example 3.
Let , operations + and be as presented in Table 2 and the unary operation − defined by , and let b be a constant (nullary operation). Let be the Ω-relation defined in Example 2 (Table 1), where Ω is a lattice in Figure 1. μ is Ω-set from Example 2 and E is symmetric, transitive and reflexive on μ.
Table 2.
(a) Binary operation + on A. (b) Binary operation on A.
The Ω-relation E is compatible since all the cuts are congruence relations on cuts of μ.
All the factor cuts are rings. Indeed, is a one-element ring, isomorphic to , is a two-element ring isomorphic to subring . is also a one-element ring. is a two-element ring . Finally, is also a one-element ring with one element being the class .
Hence, the structure is an Ω-ring by Theorem 2.
We mention some basic properties of -rings (proved in [1]) that we shall need in some proofs.
Proposition 1
([1]). Let be an Ω-ring where .
- (i)
- , ;
- (ii)
- ;
- (iii)
- .
An -ring is commutative if .
If is an algebra with two binary, one unary and two nullary operations o and , then is an -ring with identity if is an -ring and if . An -ring with identity is called an -field if (where is a unary operation) is an -group, where is the restriction of E to .
The following proposition is proved in [1].
Proposition 2
([1]). An Ω-ring with identity is an Ω-field if and only if for every , the factor is a field.
If and are -rings, we say that is an -subring of the -ring if is a restriction of E to the -valued function of , determined by .
Hence, for all .
Theorem 3
([1]). Let be an Ω-ring and an Ω-subring of . Then, for every , the ring is, up to an isomorphism, a subring of the ring .
3. Results
3.1. -Congruences and -Ideals
Let be an -ring. Knowing the well-known connection between congruences and ideals in crisp algebras, first we define -congruences and then -ideals using this notion.
An -valued congruence on is an -valued relation on R, which is -reflexive (for every , ), symmetric, transitive and compatible with the operations in , and for all fulfills .
The following proposition yields directly from the definition.
Proposition 3.
Let Θ be an Ω-valued congruence on an Ω-ring . Then, for every , such that , is a congruence relation on , and the algebra is a ring.
If is a congruence on an -ring , we define by
where o is a nullary operation in . Next, we define by
Analyzing the -valued set , we can see that it “measures” the grade to which an element is equal to the constant o. Taking into account the definition of crisp two-sided ideals in the ring, it corresponds to a congruence on the ring and it consists of all elements which are congruent with o. Hence, we introduce a notion of the -two-sided ideal in -ring, as follows.
If on R is an -valued congruence on an -ring , then , where is an -valued two-sided ideal on an -ring (or -valued ideal).
There is the smallest and the greatest congruence on every -ring, and the related -ideals are described in the sequel.
The smallest congruence on an -ring is . Then, and .
The greatest congruence is , for all . Then, for all and .
In the following part, we prove that the -valued ideal is an -subring of .
Proposition 4.
If is an Ω-ring, then the Ω-valued ideal is an Ω-subring of .
Proof.
First, we have to prove that is compatible with the nullary, unary and two binary operations.
That is, , , and .
By being an -congruence, we have that .
By Proposition 1, we have that , and .
Hence, we have the following:
Using transitivity from the previous three formulas, we have
. Since it is valid for every x, it is also valid for o, so we have that
Since
we have that
Now,
Hence,
Further, by Proposition 1, we have that and hence . Therefore,
Finally, by , we have that
Finally, the condition that is a restriction to is fulfilled:
by the definition of , since , and similarly for .
Therefore, is an -subring of . □
Remark 2.
Note that in the case of classical (crisp) rings, an Ω-ideal gives a characteristic function of an ideal. Indeed, since in a crisp case Ω is the chain , Θ is a weak-congruence relation (weakly reflexive, symmetric, transitive and compatible with operations). In this case, an ideal is a characteristic function with values 1 in case an element is in relation with o under Θ, which characterizes an ideal.
Since we first defined -ideals independently of the notion of -subrings and later proved that every -ideal is an -subring, in the following we give a necessary and sufficient condition for an -subring to be an -ideal.
Proposition 5.
Let be an Ω-ring and an Ω-subring of . Then, the necessary and sufficient condition that is an Ω-ideal of is that there is an Ω-valued congruence Θ on , such that for all ,
Proof.
The proof is obvious by the definition of an -ideal. □
In the following, we prove that the notion of the -ideal introduced above is cutworthy, in the sense that -ring is an -ideal if and only if all cut sets over related cut equalities are ideals of the corresponding cut-factor ring.
Theorem 4.
An Ω-subring of an Ω-ring is an Ω-ideal of if and only if for every , is an ideal of the ring .
Proof.
If is an -ideal of an -ring , then by the definition there is an -valued congruence on , such that for all , and
By the cutworthy properties of -congruences, the cut for is a congruence on the subalgebra of , by -reflexivity and the fact that .
The relation , naturally defined on classes by
is a congruence on .
By Theorem 1,
where is a ring and is a congruence on it; hence, is a ring as well.
By the definition of , for all , and looking at the cuts, for , if and only if .
It is already proved in Theorem 3 that is a subring of .
Now we show that is an ideal of . By the definition, we should prove that is a class of a congruence on , containing o.
We have that is a congruence on and the class of this congruence containing o is exactly (since for every p).
To prove the converse, let be an -subring of an -ring . Now, we have the assumption on cuts, and we have to prove that is an ideal on .
Since for every , is an ideal of , elements in are exactly some classes of . Now we can look at the related congruences. For every , on is defined by
Since is an ideal, is a congruence on
if and only if
if and only if
if and only if
Starting from a family of congruences ,
if and only if
Further,
if and only if
for every if and only if
The family is closed under intersections, since
Next, by the synthesis of this family, we define a relation by
The supremum of ∅ in the complete lattice is 0; hence, in the case that does not belong to any for , we have that
Now, is a symmetric, transitive and compatible -valued relation on (being a synthesis of the family of the relations of analogous crisp properties). It is also -reflexive: for ,
since is one of the values over which the supremum runs.
Finally, we prove the condition that for all , as follows. If , then and hence . Since is a congruence on , we have that and .
Hence, is an -valued congruence on , and by the construction . Therefore, is an -ideal of . □
Remark 3.
If is an Ω-ideal of an Ω-ring , then the congruence Θ related to the ideal is unique. This follows from the proof of the previous theorem. Indeed, if θ is an Ω-congruence, then the unique Ω-ideal is obtained by the definition. On the other hand, if is an Ω-ideal, then the congruences obtained on all cuts , on , defined by
are unique (due to the fact that ideals and congruences are in 1-1 correspondence in rings). Now the Ω-congruence θ is uniquely obtained from the family of cuts on , as in the proof of Theorem 4.
By the previous remark, the -ideals and -congruences are in 1-1 correspondence in -rings.
Now, adapting the definition of -homomorphisms in algebras from [33], we formulate the definition of -homomorphisms and introduce the relationship among the -ideals, -congruences and -homomorphisms in -rings.
Let and be two algebras, and and two -rings.
A function is an -homomorphism from to if for all , and the following conditions hold:
By the general result about -algebras (Theorem 8 in [33]), we have the following cutworthy property of -homomorphisms.
Proposition 6.
If the function from an Ω-ring to an Ω-ring is an Ω-homomorphism, then the mapping , such that is a classical homomorphism.
Let be an -homomorphism from to . Then, an -valued relation defined by
is called an -valued kernel of .
The following proposition are here formulated for rings and follow directly from the analogous result in general algebras that are proved in [33].
Proposition 7.
Let φ be an Ω-homomorphism from Ω-ring to Ω-ring . Then, the Ω-valued kernel of φ is an Ω-valued congruence on the Ω-ring .
3.2. Structure of -Ideals
Now we look at the family of all -ideals on an -ring and we prove that it is a complete lattice.
We define a natural ordering ⩽ on the family of all -ideals:
Given two -ideals and ,
if and only if for every , .
Proposition 8.
The family of all ideals on an Ω-ring is a complete lattice under ⩽.
Proof.
Let be an -ring. We can note that that the relation , defined by for all , is an -congruence. Hence, the mapping for all is an -ideal, and the family of all ideals on any -ring is nonempty. Moreover, it is obvious that is the greatest of all ideals under the ordering ⩽.
Now we have to prove that the infimum of every family of -ideals on the -ring is again an ideal.
Let be a family of -ideals on the -ring. Now, we prove that the intersection of fuzzy sets is an -ideal and it is the infimum of the family . Indeed, it is easy to check that for every where for every , is the corresponding congruence to . Since is also an -congruence on , we have that is an -ideal.
Hence, the family of all -ideals on is a complete lattice. □
It is easy to check that for two congruences and , such that and , and , and for two corresponding functions and and relations determining -ideals , respectively,
if and only if if and only if .
Keeping this in mind, and the fact that , we have the following corollary.
Corollary 1.
The smallest element of the family of all ideals on an Ω-ring is the ideal defined by
In the following, we prove that an -valued congruence on an -ring , such that , can be regarded as an -valued equality, and can generate another -ring.
Theorem 5.
Let be an Ω-valued congruence on an Ω-ring , such that . Then, is an Ω-ring as well. Moreover, for every , the mapping , defined by , is a surjective ring homomorphism.
Proof.
We prove that the ring identities in the sense of the -ring are fulfilled. For instance, to prove the distributivity on R, using and , we have
Analogously, we check all other -ring identities.
To prove that for , , defined by , is a homomorphism, let . Then,
Analogously, we check that f is compatible with all other operations. The homomorphism is surjective, since every class is the image of under f. □
Example 4.
Let be a commutative Ω-ring from [1], with lattice Ω given in Figure 2, where is an algebra with , operations + and presented in Table 3 and a unary operation − defined by . The Ω-valued equality is given in Table 4.
Figure 2.
Lattice .
Table 3.
(a) Binary operation + on R. (b) Binary operation on R.
Table 4.
-valued equality on R.
The function is determined by : .
| x | o | a | b | c |
| 1 | p | u | q |
We give a construction of an Ω-ideal starting from an Ω-valued congruence Θ on R in Table 5.
Table 5.
-valued congruence on R.
One could easily check that θ is an Ω-valued congruence on R satisfying for all .
Now, we define an Ω-ideal on R, by .
In the following, we give the table for (Table 6).
Table 6.
The equality relation determining -valued ideal.
Now, is an Ω-valued ideal.
The cuts of ν and are as follows:
Now we can check the results of Theorem 4, and we obtain that for every , is an ideal of the ring .
4. Systems of Linear Equations over -Fields
Systems of linear equations with several unknowns are usually considered and solved over fields. Here, we show that -fields can be used to deal with solutions of such systems over algebraic structures which are not necessarily fields. The technique we present in this section has the potential to expand the application of systems of linear equations to situations where specific data are organized in structures sharing the same type as a field. For this purpose, we use the following proposition, as a straightforward and obvious consequence of Proposition 2.
Proposition 9.
An Ω-algebra with identity is an Ω-field if and only if for every the factor is a field.
Let be an -field, where is the basic algebra as defined in Section 2.3. Also let
be a linear equation with n unknowns over . We say that an n-tuple is a solution of Equation (14) over if
Theorem 6.
Let be an Ω-field. Then, is a solution of a linear equation over with , if and only if is a classical solution of the linear equation over the cut-quotient field , where , is an arbitrary representative of the class replacing the unknown .
Proof.
Suppose that is a solution of a linear equation over the -field . Then, the formula (15) holds, i.e., for , . Hence, . The cut is a subalgebra of and is a congruence on . By Proposition 9, is an -field. Since , we have . Hence, , i.e., , which proves that is a solution of the corresponding linear equation over the cut-quotient field .
Conversely, assume that for a linear equation , the n-tuple of classes is a solution of the corresponding equation over the cut-quotient field , where ; , is an arbitrary representative of the class replacing the unknown . This means that , i.e., . Then, , i.e., . Since , we have that , and hence the formula (15) holds. This proves that every n-tuple of elements from the corresponding classes forming a solution over the field is a solution in the sense of (15). □
Analogously, as for the single equation, we can deal with solutions of the system of linear equations over an -field . The system is given by
where . We say that an n-tuple is a solution of the system (16) if for every ,
Dealing with systems of linear equations over an -field, we formulate the result analogously to the one presented in Theorem 6 (for one linear equation). We omit the proof, since it is very similar to the one of the mentioned theorem.
Theorem 7.
Let be an Ω-field. The n-tuple is a solution of a system of linear equations (16) over , where for , if and only if for , is a classical solution of the linear equation
over the cut-quotient field .
Remark 4.
Observe that the procedure presented in this section is a particular way of obtaining approximate solutions for systems of linear equations. Indeed, in real situations, data (numbers) often do not belong to the field of real or complex numbers, nor to some finite field. Such a structure may be a ring, or more generally, another algebraic structure of the same type. In these situations, a lattice Ω and the corresponding Ω-equality obtained from the properties of these data allow the construction of an Ω-field, as presented here. Then, we can obtain solutions of (systems of) linear equations. These solutions are approximate since the classical equality is replaced with an Ω-valued one. And this equality respects similarities in a collection of data.
Example 5.
Let be the ring of integers considered as an algebra with two binary, one unary and two nullary operations, and let Ω be a lattice in Figure 3. Let be defined as follows:
Figure 3.
A lattice .
One can easily check that E is an Ω-valued equality on Z.
The related Ω-set μ is defined as follows
Now, we look at the cuts:
is a trivial, one-element algebra. , , consists of three classes and it is isomorphic with a three-element field. is also a trivial one-element algebra.
Now, lets look at a system of equations on :
It does not have solutions in . However, we can find approximate solutions by solving it in the cut structure.
We see that the value of a function μ of all coefficients is either p or q, so we can look at the solution in -cut (the q-cut), which is a three-element field.
In this field, considering the congruence relation module 3, the system is transformed to
This system of equations has the following solution in the three-element field:
So, in this way, we obtain an approximate solution and we can take any element from these classes, so the solution can be, e.g., approximately and .
5. Conclusions
Continuing our research of -rings, here we have presented -ideals and their connection to homomorphisms. We have also shown that systems of linear equations could be solved with data (numbers) which do not necessarily form a field, constructing an -field over a basic structure which may be a ring, or some other structure of the same type.
-structures turn out to be suitable for applications of known algebraic structures (groups, rings, fields…) in real problems, when not all properties of these structures are fulfilled. As shown in our research, particular quotient structures of -algebras remain classical structures. Therefore, these quotients can be used as a tool for solving problems with corrupted or missing data. We shall continue our investigations in this direction, dealing particularly with real problems which could be solved in the framework of special -rings and polynomials over finite -fields.
Author Contributions
Conceptualization; methodology; validation; formal analysis; investigation; writing—original draft preparation; writing—review and editing; visualization; supervision: jointly all 4 co-authors J.J., M.L.S., B.Š. and A.T. All authors have read and agreed to the published version of the manuscript.
Funding
The fourth author’s research is supported by the Ministry of Science, Technological Development and Innovation, through the Mathematical Institute of the Serbian Academy of Sciences and Arts in Belgrade and Faculty of Science, University of Novi Sad.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Jimenez, J.; Serrano, M.L.; Šešelja, B.; Tepavčević, A. Omega-rings. Fuzzy Sets Syst. 2023, 455, 183–197. [Google Scholar] [CrossRef]
- Das, P.S. Fuzzy groups and level subgroups. J. Math. Anal. Appl. 1981, 84, 264–269. [Google Scholar] [CrossRef]
- Malik, D.S.; Mordeson, J.N.; Kuroki, N. Fuzzy Semigroups; Springer: Berlin/Heidelberg, Germany, 2003. [Google Scholar]
- Mordeson, J.N.; Bhutani, K.R.; Rosenfeld, A. Fuzzy Group Theory. In Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2005. [Google Scholar]
- Mordeson, J.N.; Malik, D.S. Fuzzy Commutative Algebra; World Scientific: Toh Tuck Link, Singapore, 1998. [Google Scholar]
- Rosenfeld, A. Fuzzy Groups. J. Math. Anal. Appl. 1971, 36, 512–517. [Google Scholar] [CrossRef]
- Dixit, V.N.; Kumar, R.; Ajmal, N. On fuzzy rings. Fuzzy Sets Syst. 1992, 49, 205–213. [Google Scholar] [CrossRef]
- Foka, S.V.T.; Tonga, M. Residuated lattice of L-fuzzy ideals of a ring. Soft Comput. 2020, 24, 8717–8724. [Google Scholar] [CrossRef]
- Kuraoka, T.; Kuroki, N. On fuzzy quotient rings induced by fuzzy ideals. Fuzzy Sets Syst. 1992, 47, 381–386. [Google Scholar] [CrossRef]
- Martínez, L. Prime and primary L-fuzzy ideals of L-fuzzy rings. Fuzzy Sets Syst. 1999, 101, 489–494. [Google Scholar] [CrossRef]
- Navarro, G.; Cortadellas, O.; Lobillo, F.J. Prime fuzzy ideals over noncommutative rings. Fuzzy Sets Syst. 2012, 199, 108–120. [Google Scholar] [CrossRef][Green Version]
- Di Nola, A.; Gerla, G. Lattice valued algebras. Stochastica 1987, 11, 137–150. [Google Scholar]
- Goguen, J.A. L-fuzzy Sets. J. Math. Anal. Appl. 1967, 18, 145–174. [Google Scholar] [CrossRef]
- Šešelja, B.; Tepavčević, A. Ω-groups in the language of Ω-groupoids. Fuzzy Sets Syst. 2020, 397, 152–167. [Google Scholar] [CrossRef]
- Bleblou, O.S.A.; Šešelja, B.; Tepavčević, A. Normal Ω-groups. Filomat 2018, 32, 6699–6711. [Google Scholar] [CrossRef]
- Krapež, A.; Šešelja, B.; Tepavčević, A. Solving linear equations by fuzzy quasigroups techniques. Inf. Sci. 2019, 491, 179–189. [Google Scholar] [CrossRef]
- Fourman, M.P.; Scott, D.S. Sheaves and logic. In Applications of Sheaves, Lecture Notes in Mathematics; Fourman, M.P., Mulvey, C.J., Scott, D.S., Eds.; Springer: Berlin/Heidelberg, Germany; New York, NY, USA, 1979; Volume 753, pp. 302–401. [Google Scholar]
- Höhle, U. Quotients with respect to similarity relations. Fuzzy Sets Syst. 1988, 27, 31–44. [Google Scholar] [CrossRef]
- Höhle, U. Fuzzy sets and sheaves. Part I: Basic concepts. Fuzzy Sets Syst. 2007, 158, 1143–1174. [Google Scholar] [CrossRef]
- Höhle, U.; Šostak, A.P. Axiomatic Foundations of Fixed-Basis Fuzzy Topology; Springer: Berlin/Heidelberg, Germany, 1999; pp. 123–272. [Google Scholar]
- Bělohlávek, R. Fuzzy equational logic. Arch. Math. Log. 2002, 41, 83–90. [Google Scholar] [CrossRef]
- Bělohlávek, R. Fuzzy Relational Systems: Foundations and Principles; Kluwer Academic/Plenum Publishers: New York, NY, USA, 2002. [Google Scholar]
- Bělohlávek, R. Birkhoff variety theorem and fuzzy logic. Arch. Math. Log. 2003, 42, 781–790. [Google Scholar] [CrossRef]
- Bělohlávek, R.; Vychodil, V. Fuzzy Equational Logic. In Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2005; Volume 186. [Google Scholar]
- Bělohlávek, R.; Vychodil, V. Algebras with fuzzy equalities. Fuzzy Sets Syst. 2006, 157, 161–201. [Google Scholar] [CrossRef]
- Demirci, M. Vague Groups. J. Math. Anal. Appl. 1999, 230, 142–156. [Google Scholar] [CrossRef]
- Demirci, M. Foundations of fuzzy functions and vague algebra based on many-valued equivalence relations part I: Fuzzy functions and their applications. Int. J. Gen. Syst. 2003, 32, 123–155. [Google Scholar] [CrossRef]
- Demirci, M. Foundations of fuzzy functions and vague algebra based on many-valued equivalence relations, part II: Vague algebraic notions. Int. J. Gen. Syst. 2003, 32, 157–175. [Google Scholar] [CrossRef]
- Demirci, M. Foundations of fuzzy functions and vague algebra based on many-valued equivalence relations, part III: Constructions of vague algebraic notions and vague arithmetic operations. Int. J. Gen. Syst. 2003, 32, 177–201. [Google Scholar] [CrossRef]
- Davey, B.A.; Priestley, H.A. Introduction to Lattices and Order; Cambridge University Press: Cambridge, UK, 1992. [Google Scholar]
- Burris, S.; Sankappanavar, H.P. A Course in Universal Algebra; Springer: Berlin/Heidelberg, Germany, 1981. [Google Scholar]
- Zimmermann, H.J. Fuzzy Set Theory and Its Applications; Springer: Berlin/Heidelberg, Germany, 2001. [Google Scholar]
- Edeghagba, E.E.; Seselja, B.; Tepavcevi, A. Congruences and homomorphisms on Omega-algebras. Kybernetika 2017, 53, 892–910. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).