Next Article in Journal
Robust Negative Binomial Regression via the Kibria–Lukman Strategy: Methodology and Application
Next Article in Special Issue
Brauer Configuration Algebras Induced by Integer Partitions and Their Applications in the Theory of Branched Coverings
Previous Article in Journal
A Novel Ensemble Method of Divide-and-Conquer Markov Boundary Discovery for Causal Feature Selection
Previous Article in Special Issue
New Infinite Classes for Normal Trimagic Squares of Even Orders Using Row–Square Magic Rectangles
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Rough and T-Rough Sets Arising from Intuitionistic Fuzzy Ideals in BCK-Algebras

by
Kholood M. Alsager
and
Sheza M. El-Deeb
*
Department of Mathematics, College of Science, Qassim University, Buraydah 51452, Saudi Arabia
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(18), 2925; https://doi.org/10.3390/math12182925
Submission received: 1 August 2024 / Revised: 10 September 2024 / Accepted: 14 September 2024 / Published: 20 September 2024
(This article belongs to the Special Issue Algebra and Discrete Mathematics 2023)

Abstract

:
This paper presents the novel concept of rough intuitionistic fuzzy ideals within the realm of BCK-algebras and investigates their fundamental properties. Furthermore, we introduce a set-valued homomorphism over a BCK-algebra, laying the foundation for the establishment of T-rough intuitionistic fuzzy ideals. The characterization of these innovative ideals is accomplished by employing the ( α , β ) -cut of intuitionistic fuzzy sets in the context of BCK-algebras.

1. Introduction

The foundations of rough set theory were laid by Pawlak in 1982 [1], providing a mathematical framework to handle uncertainty arising from noisy, inexact, or incomplete information. Concurrently, Zadeh introduced fuzzy set theory in 1965 [2], offering a generalization of classical set theory. In Zadeh’s framework, the membership function plays a pivotal role in capturing uncertainty.
Pawlak’s rough set theory, on the other hand, relies on equivalence classes of a set for upper and lower approximations. Both theories contribute to addressing uncertainty, but with different approaches. Additionally, K.T. Atanassov introduced the concept of intuitionistic fuzzy sets in 1986 [3] as a generalization of fuzzy sets, further expanding the mathematical tools available for handling uncertain information. The work of Atanassov work in 1999 [4] significantly contributed to the development of intuitionistic fuzzy set theory. In [5], Bonikowaski provided insights into the algebraic structures of rough sets. The amalgamation of rough set theory with various mathematical frameworks has proven instrumental in addressing challenges across such diverse domains as machine learning, intelligent systems, inductive reasoning, pattern recognition, knowledge discovery, decision analysis, and expert systems. This integration facilitates a comprehensive approach to handling complex problems and advancing the capabilities of these fields. In 2008, the notion of a T-rough set on a group was introduced by Davvaz [6], providing a conceptual framework that allows for the discovery of knowledge expressed through a mapping process. He also introduced the concept of a set-valued homomorphism for groups, representing a generalization of the conventional homomorphism. Moradiana et al. [7] presented a definition of the lower and upper approximation of subsets of BCK-algebras concerning a fuzzy ideal (FI). Ahn and Kim [8] introduced the concept of rough fuzzy filters in BE-algebras, Ahn and Ko [9] introduced the concept of rough ideals and rough FIs in BCK/BCI-algebras, and Hussain et al. [10] introduced the concept of rough Pythagorean FIs in semigroups, while Chinram and Panityakul [11] introduced rough Pythagorean FIs in ternary semigroups and provided several of their remarkable properties. Jun et al. [12] studied the concept of a (strong) set-valued BCK/BCI-morphism and introduced the concept of a generalized rough subalgebra (ideal) in BCK/BCI-algebras. This broader concept expands the scope and applicability of homomorphic mappings within the context of group theory. Hosseini applied the T-rough set concept to fuzzy sets, as outlined in his work [13]. This theory has been subsequently extended to encompass rings, subgroups, and semigroups [14]. The application of T-rough set theory to semigroups was further explored by Jafarzadeh and Gholami [14]. Additionally, Davvaz extended the T-rough set concept to prime and primary ideals in commutative rings [15]. This diverse set of applications showcases the versatility and adaptability of T-rough set theory across various mathematical structures. Inspired by the aforementioned investigation, the primary goal of this study is to further delve into the intricate relationships among rough sets, fuzzy sets, and BCK-algebras.
To cope with some complicated problems and widen the scope of applications, several authors have hybridized rough set theory with fuzzy set and soft set theories. These hybridizations have proven to be effective in enhancing the ability to deal with uncertainty, vagueness, and imprecision in various domains. For instance, the concept of rough bipolar fuzzy sets has been utilized to explore ideals in semigroups, offering new insights into algebraic structures [16]. Furthermore, the integration of bipolar soft information has been applied in medical decision-making techniques, providing a robust framework for handling complex decision-making scenarios [17]. Another innovative approach involves the development of decision-making techniques based on T-rough bipolar fuzzy sets, which extends the application of rough and fuzzy sets in the decision-making process [18]. These contributions illustrate the versatility and effectiveness of combining rough set theory with fuzzy and soft set frameworks to address a wide range of challenging problems. In addition, the generation of generalized approximation spaces from I j -neighborhoods and ideals has been explored, with applications to real-world problems such as Chikungunya disease. This approach further broadens the application of rough set theory in the medical field, demonstrating the versatility of these hybridized models in addressing complex issues [19]. These contributions illustrate the significant potential of combining rough set theory with fuzzy and soft set frameworks to tackle a wide range of challenging problems. It is acknowledged that rough set theory and its generalizations have broad scope for application; for example, the approach could be tested in areas such as medical diagnosis, data mining, or decision-making processes where rough set theory has been successfully utilized. The structure of the exploration is outlined as follows.
In Section 2, we present essential concepts related to rough sets and generalized rough sets. Section 3 delves into the examination of rough intuitionistic fuzzy ideals (IFI) within the context of BCK-algebras.
Moving on to Section 4, we introduce the concept of set-valued homomorphism and delve into some key properties of generalized lower and upper approximation operators in BCK-algebras. We define a set-valued homomorphism over a BCK-algebra, establishing the concept of T-rough IFIs. The characterization of these innovative ideals is achieved through the ( α , β ) -cut of IF sets in BCK-algebras.

2. Preliminaries

In this section, we revisit fundamental concepts related to fuzzy sets, FIs, IF sets, and rough sets.
In the following definition, we introduce the concept of a BCK-algebra, which is a set with a binary operation and constant satisfying specific axioms. These axioms define important properties of the algebraic structure.
Definition 1
([20]). Let Ω be a set with a binary operation ∗ and a constant 0. Then, ( Ω , , 0 ) is called a BCK-algebra if it satisfies the following axioms:
1. 
( ( u v ) ( u w ) ) ( w v ) = 0
2. 
( u ( u v ) ) v = 0
3. 
u u = 0
4. 
u v = 0  and  v u = 0  imply  u = v
5. 
0 u = 0
for all u , v , w Ω .
A partial order ≤ on Ω can be defined by u v  if and only if  u v = 0 .
In the following definition, we define an ideal of a BCK-algebra, which is a special type of subset within the algebra that satisfies certain conditions. These conditions ensure that the subset behaves in a way that aligns with the structure of the BCK-algebra.
Definition 2
([20]). A non-empty subset E of a BCK-algebra Ω is called an ideal of Ω if it satisfies the following conditions:
(I1) 
0 E
(I2) 
If  u v E  and  v E this implies that  u E .
We denote the set of ideals by I
In the following definition, we introduce the concept of a fuzzy set, which is characterized by a membership function. This function assigns a value between 0 and 1 to each element of the base set, representing the degree to which that element belongs to the fuzzy set.
Definition 3
([2]). A fuzzy set of a base set Ω is specified by its membership function, where
μ : Ω 0 , 1 ,
assigning to each u Ω  the degree or grade to which u belongs to μ.
In the following definition, we introduce the concept of an intuitionistic fuzzy set (IFS). An IFS assigns both a degree of membership and a degree of non-membership to each element of the universe, with the sum of these values always lying between 0 and 1. This framework allows for a more flexible representation of uncertainty compared to traditional fuzzy sets.
Definition 4
([3]). An intuitionistic fuzzy set (IFS) in a universe Ω is an object of the form
E = { ( u , μ E ( u ) , λ E ( u ) ) u Ω } ,
where the functions
μ : Ω [ 0 , 1 ] , λ : Ω [ 0 , 1 ]
denote the degree of membership (namely,  μ E ( u ) and degree of non-membership (namely,  λ E ( u ) of each element  u Ω  in the set E, respectively, and
0 μ E ( u ) + λ E ( u ) 1
for all  u Ω For the sake of simplicity, we use the symbol  E = ( μ E , λ E )  for the IFS  E = { ( u , μ E ( u ) , λ E ( u ) ) u Ω } .
In the following definition, we introduce the concept of a fuzzy ideal (FI) in a BCK-algebra. A fuzzy subset of a BCK-algebra is considered a fuzzy ideal if it satisfies specific conditions that relate the membership values of elements to the algebra’s structure.
Definition 5
([21]). A fuzzy subset μ of a BCK-algebra Ω is said to be an FI of Ω if it satisfies
(1) 
μ ( 0 ) μ ( u )
(2) 
μ ( u ) min ( μ ( u v ) , μ ( v ) )
for all u , v Ω .
In the following definition, we define an intuitionistic fuzzy ideal (IFS) of a BCK-algebra. An IFS is characterized by a pair of functions that specify the degrees of membership and non-membership, and satisfies specific conditions relating these functions to the algebra’s operations.
Definition 6
([22]). An IF subset E = ( μ E , λ E ) of a BCK-algebra Ω is said to be an intuitionistic FI of Ω if for all u , v Ω we have
(1) 
μ E ( 0 ) μ E ( u )
(2) 
μ E ( u ) min ( μ E ( u v ) , μ E ( v ) )
(3) 
λ E ( 0 ) λ E ( u )
(4) 
λ E ( u ) max ( λ E ( u v ) , λ E ( v ) ) .
In this example, we consider a BCK-algebra Ω with three elements: { 0 , 1 , 2 } . The operation ∗ is defined using the table below. We then define two functions, λ E and μ E , which will show that E = ( μ E , λ E ) is an intuitionistic fuzzy ideal in this algebra.
Example 1.
Let Ω = { 0 , 1 , 2 } be a BCK-algebra with the following Cayley table (Table 1).
Let E = ( μ E , λ E ) , define λ E , μ E : Ω [ 0 , 1 ] as
μ E ( u ) =    0.5 for u { 0 , 1 }    0.3 for u = 2
λ E ( u ) =    0.3 for u { 0 , 1 }    0.5 for u = 2
By simple calculation, we find that E is an intuitionistic FI.
In algebraic structures such as BCK-algebras, understanding how elements relate to each other can be facilitated by grouping them into equivalence classes. A congruence relation θ on a BCK-algebra Ω provides a way to partition the algebra into such classes. Specifically, if θ is a congruence relation, it ensures that if two elements a and b are in the same equivalence class; then, their product with any other elements remains in the same class. The equivalence classes of θ are denoted by [ a ] θ , which represents the class containing the element a. A congruence relation θ is termed complete if it satisfies the condition that the product of two equivalence classes is equal to the equivalence class of the product. This is formally expressed as [ a b ] θ = [ a ] θ [ b ] θ . The formal definition is provided below.
Definition 7
([23]). Let θ be an equivalence relation on a BCK-algebra Ω; θ is called a congruence relation on Ω if ( a , b ) θ implies ( a u , b v ) θ for all u , v Ω . A congruence relation θ is called complete on Ω if a b θ = a θ b θ .
In this definition, we describe the lower and upper approximations of a set in rough set theory. The lower approximation includes elements that are definitely in the set, while the upper approximation contains elements that might be in the set. If both approximations are the same, then the set is definable; otherwise, it is a rough set. The formal definitions are as follows:
Definition 8
([1]). Let ( U , θ ) be an approximation space, where U is the non-empty universe and θ is an equivalence relation. Let Ω be any non-empty subset of U. Then, the sets
θ ( Ω ) = { u U : [ u ] θ Ω }
and
θ ( Ω ) = { u U : [ u ] θ Ω }
are respectively called the lower approximation and upper approximation of the set Ω with respect to θ, where [ u ] θ denotes the equivalent class containing the elements u Ω with respect to θ.
Ω is called θ-definable if θ ( Ω ) = θ ( Ω ) . If θ ( Ω ) θ ( Ω ) , then Ω is called a rough set with respect to θ.
In the following proposition, we explore the relationship between intuitionistic fuzzy sets and congruence relations on a BCK-algebra. The proposition describes how these sets interact with congruence relations, and includes properties of the intersection and union of intuitionistic fuzzy sets under these relations.
Proposition 1.
Let θ be a congruence relation on a BCK-algebra Ω and let E = ( μ E , λ E ) and B = ( μ B , λ B ) be two IF-sets of Ω. Then,
(1) 
θ ( E ) E θ ( E )
(2) 
If E B , then θ ( E ) θ ( B )
(3) 
If E B , then θ ( E ) θ ( B )
(4) 
θ ( E B ) = θ ( E ) θ ( B )
(5) 
θ ( E B ) = θ ( E ) θ ( B ) .
Proof. (1) 
To show θ ( E ) E θ ( E ) :
(a)
θ ( E ) E : By definition, θ ( E ) consists of elements u Ω such that θ ( u , v ) E for all v Ω . Because E is an IF-set, u θ ( E ) implies θ ( u , v ) E for all v; thus, u must be in E.
(b)
E θ ( E ) : For any u E , θ ( u , v ) E implies θ ( u , v ) θ ( E ) for all v; thus, E θ ( E ) .
(2) To show if E B , then θ ( E ) θ ( B ) : If E B , then for any u θ ( E ) , θ ( u , v ) E for all v. Because E B , θ ( u , v ) B for all v, we have u θ ( B ) . Hence, θ ( E ) θ ( B ) .
(3) To show if E B , then θ ( E ) θ ( B ) : If E B , then for any u θ ( E ) , θ ( u , v ) θ ( E ) implies θ ( u , v ) E for all v. Given E B , it follows that θ ( u , v ) θ ( B ) . Hence, θ ( E ) θ ( B ) .
(4) To show θ ( E B ) = θ ( E ) θ ( B ) : For u θ ( E B ) , θ ( u , v ) E B for all v, which means θ ( u , v ) E and θ ( u , v ) B . Thus, u θ ( E ) and u θ ( B ) , meaning that u θ ( E ) θ ( B ) . Hence, θ ( E B ) = θ ( E ) θ ( B ) .
(5) To show θ ( E B ) = θ ( E ) θ ( B ) : For u θ ( E B ) , θ ( u , v ) E B for all v, which means θ ( u , v ) E or θ ( u , v ) B . Therefore, u θ ( E ) or u θ ( B ) ; thus, u θ ( E ) θ ( B ) . Hence, θ ( E B ) = θ ( E ) θ ( B ) . □

3. Rough Intuitionistic Fuzzy Ideals in BCK-Algebras

In this section, we delve into the world of rough intuitionistic FIs in BCK-algebras. Following the groundwork laid in the previous sections, this exploration aims to unravel the unique properties and significance of these ideals within the context of mathematical structures. Our focus is on understanding their characteristics and contributions, providing valuable insights into their role within the algebraic framework of BCK-algebras.
Definition 9.
Let θ be a congruence relation on Ω and let E = ( μ E , λ E ) be an IF set of Ω. Then, the IF sets
θ ( E ) = ( θ ( μ E ) , θ ( λ E ) )
and
θ ( E ) = ( θ ( μ E ) , θ ( λ E ) )
are called the θ-lower and θ-upper approximations of the IF set E, where
θ ( μ E ) ( u ) = a [ u ] θ μ E ( a )
θ ( λ E ) ( u ) = a [ u ] θ λ E ( a )
θ ( μ E ) ( u ) = a [ u ] θ μ E ( a )
θ ( λ E ) ( u ) = a [ u ] θ λ E ( a )
for all u Ω .
We call θ ( E ) = ( θ ( E ) , θ ( E ) )  a rough intuitionistic FI if  θ ( E )  and  θ ( E )  are intuitionistic FIs.
In the study of BCK-algebras, the exploration of congruence relations and their influence on algebraic structures is of significant importance. In particular, intuitionistic fuzzy ideals (FI) within BCK-algebras play a crucial role in understanding the algebraic properties and relationships within these systems. The following theorem establishes a key result regarding the behavior of intuitionistic fuzzy ideals under the action of a complete congruence relation. Specifically, it demonstrates that if an intuitionistic fuzzy ideal is defined on a BCK-algebra, applying a complete congruence relation to this ideal results in another intuitionistic fuzzy ideal. This finding provides valuable insights into the stability and preservation of intuitionistic fuzzy ideals under congruence relations within BCK-algebras, further enriching the theory and applications of these algebraic structures.
Theorem 1.
Let θ be a complete congruence relation on a BCK-algebra Ω. If E is an intuitionistic fuzzy ideal (FI) of Ω, then θ ( E ) is an intuitionistic fuzzy ideal of Ω.
Proof. 
Let E = ( μ E , λ E ) be an intuitionistic fuzzy ideal of Ω . Then, θ ( E ) = ( θ ( μ E ) , θ ( λ E ) ) , where θ ( μ E ) and θ ( λ E ) represent the upper approximations of μ E and λ E with respect to the congruence relation θ . We need to show that θ ( E ) satisfies the conditions of an intuitionistic fuzzy ideal.
First, we check the conditions for the membership function μ E . Because E is an intuitionistic fuzzy ideal, we know that μ E ( 0 ) α for some α [ 0 , 1 ] . For the upper approximation θ ( μ E ) , we have
θ ( μ E ) ( 0 ) = w [ 0 ] θ μ E ( w ) μ E ( 0 ) .
Because [ 0 ] θ is the equivalence class containing 0 with respect to θ , this shows that θ ( μ E ) ( 0 ) μ E ( 0 ) . Similarly, for any u Ω , we have
θ ( μ E ) ( u ) = w [ u ] θ μ E ( w ) ,
which ensures that the upper approximation θ ( μ E ) behaves consistently with respect to μ E .
Next, we need to verify the closure condition under the binary operation ∗ of the BCK-algebra. For any u , v Ω , we have
θ ( μ E ) ( u ) u v [ u v ] θ , v [ v ] θ min ( μ E ( u v ) , μ E ( v ) ) .
By applying the properties of upper approximation and the fact that E is an intuitionistic fuzzy ideal, we obtain
= min u v [ u v ] θ μ E ( u v ) , v [ v ] θ μ E ( v ) = min ( θ ( μ E ) ( u v ) , θ ( μ E ) ( v ) ) .
This shows that the membership function θ ( μ E ) respects the closure under the operation ∗, meaning that θ ( E ) satisfies the required property for an intuitionistic fuzzy ideal with respect to μ E .
Now, for the non-membership function λ E , we similarly need to verify that the upper approximation θ ( λ E ) satisfies the necessary conditions. First, we check the condition for 0 Ω :
θ ( λ E ) ( 0 ) = w [ 0 ] θ λ E ( w ) λ E ( 0 ) .
For any u Ω , we have
θ ( λ E ) ( u ) = w [ u ] θ λ E ( w ) .
Now, for the closure under ∗ we need to show that for any u , v Ω we have
θ ( λ E ) ( u ) u v [ u v ] θ , v [ v ] θ max ( λ E ( u v ) , λ E ( v ) ) .
Again, from the properties of upper approximation and the fact that E is an intuitionistic fuzzy ideal, we obtain
= max u v [ u v ] θ λ E ( u v ) , v [ v ] θ λ E ( v ) = max ( θ ( λ E ) ( u v ) , θ ( λ E ) ( v ) ) .
This proves that θ ( λ E ) satisfies the required condition for the non-membership function of an intuitionistic fuzzy ideal.
Thus, θ ( E ) is an intuitionistic fuzzy ideal of Ω . □
In the realm of BCK-algebras, understanding the behavior of intuitionistic fuzzy ideals (FI) under various transformations is crucial for a deeper comprehension of these algebraic structures. The following theorem addresses the impact of a complete congruence relation on an intuitionistic fuzzy ideal within a BCK-algebra. Specifically, it asserts that if we have an intuitionistic fuzzy ideal and apply a complete congruence relation to it in a particular manner, the resulting structure remains an intuitionistic fuzzy ideal. This theorem further elucidates how congruence relations preserve the properties of intuitionistic fuzzy ideals, thereby contributing to the theoretical framework of BCK-algebras and their applications in both mathematical and practical contexts.
Theorem 2.
Let θ be a complete congruence relation on a BCK-algebra Ω. If E is an intuitionistic fuzzy ideal (FI) of Ω, then θ ( E ) is an intuitionistic fuzzy ideal of Ω.
Proof. 
Let E = ( μ E , λ E ) be an intuitionistic fuzzy ideal of Ω . Then, θ ( E ) = ( θ ( μ E ) , θ ( λ E ) ) , where θ ( μ E ) and θ ( λ E ) represent the lower approximations of μ E and λ E with respect to the congruence relation θ . We need to show that θ ( E ) satisfies the conditions of an intuitionistic fuzzy ideal.
First, we check the conditions for the membership function μ E . Because E is an intuitionistic fuzzy ideal, we know that μ E ( 0 ) α for some α [ 0 , 1 ] . For the lower approximation θ ( μ E ) , we have
θ ( μ E ) ( 0 ) = w [ 0 ] θ μ E ( w ) μ E ( 0 ) .
Because [ 0 ] θ is the equivalence class containing 0 with respect to θ , this shows that θ ( μ E ) ( 0 ) μ E ( 0 ) . Similarly, for any u Ω , we have
θ ( μ E ) ( u ) = w [ u ] θ μ E ( w ) ,
which ensures that the lower approximation θ ( μ E ) behaves consistently with respect to μ E .
Next, we need to verify the closure condition under the binary operation ∗ of the BCK-algebra. For any u , v Ω , we have
θ ( μ E ) ( u ) u [ u ] θ μ E ( u ) u v [ u v ] θ , v [ v ] θ min ( μ E ( u v ) , μ E ( v ) ) .
By applying the properties of lower approximation and from the fact that E is an intuitionistic fuzzy ideal, we obtain
= min u v [ u v ] θ μ E ( u v ) , v [ v ] θ μ E ( v ) = min ( θ ( μ E ) ( u v ) , θ ( μ E ) ( v ) ) .
This shows that the membership function θ ( μ E ) respects the closure under the operation ∗, meaning that θ ( E ) satisfies the required property for an intuitionistic fuzzy ideal with respect to μ E .
Now, for the non-membership function λ E , we similarly need to verify that the lower approximation θ ( λ E ) satisfies the necessary conditions. First, we check the condition for 0 Ω :
θ ( λ E ) ( 0 ) = w [ 0 ] θ λ E ( w ) λ E ( 0 ) .
For any u Ω , we have
θ ( λ E ) ( u ) = w [ u ] θ λ E ( w ) .
Now, for the closure under ∗ we need to show that for any u , v Ω we have
θ ( λ E ) ( u ) u [ u ] θ λ E ( u ) u v [ u v ] θ , v [ v ] θ max ( λ E ( u v ) , λ E ( v ) ) .
Again, from the properties of lower approximation and the fact that E is an intuitionistic fuzzy ideal, we obtain
= max u v [ u v ] θ λ E ( u v ) , v [ v ] θ λ E ( v ) = max ( θ ( λ E ) ( u v ) , θ ( λ E ) ( v ) ) .
This proves that θ ( λ E ) satisfies the required condition for the non-membership function of an intuitionistic fuzzy ideal.
Thus, θ ( E ) is an intuitionistic fuzzy ideal of Ω . □
In this example, we define a congruence relation θ on the BCK-algebra Ω , as shown below. Using this relation, we derive new functions θ ( μ E ) , θ ( λ E ) , θ ( μ E ) , and θ ( λ E ) . These functions help us demonstrate that E is a rough set and that both θ ( E ) and θ ( E ) are intuitionistic fuzzy ideals. Finally, we observe that the converse of Theorem 1 does not hold in general.
Example 2.
Let E be the intuitionistic FI defined in Example 1. We define a congruence relation θ on Ω as θ = { ( 0 , 0 ) , ( 1 , 1 ) , ( 2 , 2 ) , ( 0 , 1 ) , ( 1 , 0 ) , ( 1 , 2 ) , ( 2 , 1 ) , ( 0 , 2 ) } :
θ ( μ E ) ( u ) = 0.5 f o r u { 0 , 1 , 2 }
θ ( λ E ) ( u ) = 0.3 f o r u { 0 , 1 , 2 }
θ ( μ E ) ( u ) = 0.5 f o r u = 0 0.3 f o r u { 1 , 2 }
θ ( λ E ) ( u ) = 0.3 f o r u = 0 0.5 f o r u { 1 , 2 } .
Clearly, E is a rough set and  θ ( E )  is an intuitionistic FI.
θ ( μ E ) ( u ) min ( θ ( μ E ) ( u v ) , θ ( μ E ) ( v ) )
θ ( λ E ) ( u ) max ( θ ( λ E ) ( u v ) , θ ( λ E ) ( v ) )
Therefore, θ ( E )  is an intuitionistic FI.
The converse of Theorem 1 does not hold in general.
Example 3.
Let  Ω = { 0 , 1 , 2 }  be a BCK-algebra and define a congruence relation θ on Ω as θ = { ( 0 , 0 ) , ( 1 , 1 ) , ( 2 , 2 ) , ( 0 , 1 ) , ( 1 , 0 ) , ( 1 , 2 ) , ( 2 , 1 ) , ( 0 , 2 ) }  (Table 2).
Let  E = ( μ E , λ E )  and define  λ E , μ E : Ω [ 0 , 1 ]  as
μ E ( u ) = 0.3 f o r u { 0 , 2 } 0.5 f o r u = 1 .
λ E ( u ) = 0.5 f o r u { 0 , 2 } 0.3 f o r u = 1
Clearly, E is not an intuitionistic FI.
θ ( μ E ) ( u ) = 0.5 f o r u { 0 , 1 , 2 }
θ ( λ E ) ( u ) = 0.3 f o r u { 0 , 1 , 2 }
Obviously,  θ ( E )  is an intuitionistic FI.
Definition 10 introduces the concept of ( α , β ) -cuts (or levels) of an intuitionistic fuzzy subset E = ( μ E , λ E ) within a BCK-algebra Ω . For any α , β [ 0 , 1 ] , the ( α , β ) -cut of E is defined as the subset of Ω where μ E ( u ) α and λ E ( u ) β . This subset is denoted by E α , β . Additionally, the strong ( α , β ) -cut of E, denoted by E s α , β , consists of elements u Ω where μ E ( u ) > α and λ E ( u ) < β . These definitions are essential for analyzing and understanding the structure of intuitionistic fuzzy subsets in BCK-algebras.
Definition 10.
For any IF subset  E = ( μ E , λ E )  of a BCK-algebra Ω, we define the  ( α , β ) -cut (level) of E as the subset  { u Ω : μ E ( u ) α , λ E ( u ) β }  of Ω denoted by  E α , β ; the strong  ( α , β ) -cut (level) of E is denoted by  E s α , β  and defined as
E s α , β = { u Ω : μ E ( u ) > α , λ E ( u ) < β }
 for all  α , β [ 0 , 1 ] .
In the study of BCK-algebras, understanding when an intuitionistic fuzzy subset qualifies as an intuitionistic fuzzy ideal (FI) is essential for analyzing the algebraic structure and its properties. The following theorem provides a criterion for such classification. Specifically, it states that an intuitionistic fuzzy subset E = ( μ E , λ E ) of a BCK-algebra Ω is an intuitionistic fuzzy ideal if and only if the sets E s α , β and E α , β are non-empty ideals of Ω for all α , β [ 0 , 1 ] , given that the membership and non-membership functions satisfy μ E ( 0 ) α and λ E ( 0 ) β . This result not only provides a precise condition for E to be considered an intuitionistic fuzzy ideal but also underscores the importance of these conditions in the framework of BCK-algebras.
Theorem 3.
Let E = ( μ E , λ E )  be an IF subset. Then, E is an intuitionistic fuzzy ideal (FI) of a BCK-algebra Ω if and only if  E s α , β  and  E α , β  are non-empty ideals of Ω for all  α , β [ 0 , 1 ] , where  μ E ( 0 ) α  and  λ E ( 0 ) β .
Proof. 
Suppose that E = ( μ E , λ E ) is an intuitionistic fuzzy ideal (FI) of Ω and that μ E ( 0 ) α and λ E ( 0 ) β for all α , β [ 0 , 1 ] . If E α , β is non-empty, then E α , β I (the set of ideals of Ω ).
Clearly, 0 E α , β , as μ E ( 0 ) α and λ E ( 0 ) β . Let u , v Ω such that u v E α , β and v E α , β . Then, we have
μ E ( u ) min ( μ E ( u v ) , μ E ( v ) ) α , λ E ( u ) max ( λ E ( u v ) , λ E ( v ) ) β .
Thus, u E α , β , proving that E α , β is an ideal of Ω , i.e., E α , β I .
Conversely, suppose that E α , β is a non-empty ideal of Ω for all α , β [ 0 , 1 ] . For any u Ω , let μ E ( u ) = α and λ E ( u ) = β . Because E α , β and E α , β I , we have 0 E α , β , which implies that
μ E ( 0 ) α = μ E ( u ) , λ E ( 0 ) β = λ E ( u ) .
Now, we show that
μ E ( u ) min ( μ E ( u v ) , μ E ( v ) ) , λ E ( u ) max ( λ E ( u v ) , λ E ( v ) ) .
Assuming the contrary, there exist u , v Ω such that
μ E ( u ) < min ( μ E ( u v ) , μ E ( v ) ) , λ E ( u ) > max ( λ E ( u v ) , λ E ( v ) ) .
Let
α = 1 2 μ E ( v ) + min ( μ E ( u v ) , μ E ( v ) ) , β = 1 2 λ E ( v ) + max ( λ E ( u v ) , λ E ( v ) ) .
Then, we have
μ E ( v ) < α < min ( μ E ( u v ) , μ E ( v ) ) , λ E ( v ) > β > max ( λ E ( u v ) , λ E ( v ) ) .
This implies that v E α , β and u v E α , β , contradicting the assumption that E α , β I .
Thus, E is an intuitionistic fuzzy ideal of Ω . □
In the study of BCK-algebras, understanding the interaction between congruence relations and intuitionistic fuzzy sets is crucial. The following theorem examines how a congruence relation θ applied to an intuitionistic fuzzy set E affects certain operations. Specifically, it shows that for any α , β [ 0 , 1 ] the congruence relation preserves the structure of the intuitionistic fuzzy set in two important ways: first, ( θ ( E ) ) α , β = θ ( E α , β ) , and second, ( θ ( E ) ) α , β = θ ( E α , β ) . These results provide insight into how congruence relations interact with intuitionistic fuzzy sets, maintaining their essential properties under specific operations.
Theorem 4.
Let θ be a congruence relation on a BCK-algebra Ω. If E is an intuitionistic fuzzy (IF) set of Ω, then the following hold for any α , β [ 0 , 1 ] :
(1) 
( θ ( E ) ) α , β = θ ( E α , β )
(2) 
( θ ( E ) ) α , β = θ ( E α , β ) .
Proof. 
1.
For u ( θ ( E ) ) α , β , this means
θ ( μ E ) ( u ) α and θ ( λ E ) ( u ) β .
From the definition of the lower approximation θ , we have
a [ u ] θ μ E ( a ) α and a [ u ] θ λ E ( a ) β .
This implies that for all a [ u ] θ the membership and non-membership functions satisfy
μ E ( a ) α and λ E ( a ) β .
Therefore, [ u ] θ E α , β ; hence, u θ ( E α , β ) .
Thus, ( θ ( E ) ) α , β = θ ( E α , β ) .
2.
For u ( θ ( E ) ) α , β , this means
θ ( μ E ) ( u ) α and θ ( λ E ) ( u ) β .
From the definition of the upper approximation θ , we have
a [ u ] θ μ E ( a ) α and a [ u ] θ λ E ( a ) β .
This implies that there exists some a [ u ] θ such that
μ E ( a ) α and λ E ( a ) β .
Therefore, [ u ] θ E α , β ; hence, u θ ( E α , β ) .
Thus, ( θ ( E ) ) α , β = θ ( E α , β ) .
In the following definition, we define different types of mappings between BCK-algebras. A homomorphism preserves the algebraic operation, an epimorphism is a surjective homomorphism, and an isomorphism is both a homomorphism and a bijection, indicating that the two algebras are structurally identical.
Definition 11
([20]). Suppose that ( Ω , , 0 ) and ( Y , , 0 ) are two BCK-algebras. A mapping f : Ω Y is called a homomorphism from Ω into Y if, for any u , v Ω ,
f ( u v ) = f ( u ) f ( v ) .
If in addition the mapping f is onto, i.e., f ( Ω ) = Y , where f ( Ω ) = { f ( u ) : u Ω } , then f is called an epimorphism, and Y is said to be a homomorphic image of Ω. The mapping is called an isomorphism if it is both an epimorphism and one-to-one.
Theorem 5 investigates how congruence relations are affected by an epimorphism between BCK-algebras. It shows that if φ is an epimorphism from a BCK-algebra Ω 1 to Ω 2 and if θ 2 is a congruence relation on Ω 2 , then θ 1 defined on Ω 1 is also a congruence relation. Additionally, if θ 2 is complete and φ is injective, then θ 1 is complete as well. The theorem also establishes that φ ( θ 1 ( E ) ) equals θ 2 ( φ ( E ) ) .
Theorem 5.
Let φ be an epimorphism from a BCK-algebra Ω 1  to a BCK-algebra  Ω 2  and let  θ 2  be a congruence relation on  Ω 2 . Let E be a subset of  Ω 1 . Then,
1. 
θ 1 = { ( a , b ) Ω 1 × Ω 1 ( φ ( a ) , φ ( b ) ) θ 2 }  is a congruence relation on  Ω 1 .
2. 
If θ 2  is complete and φ is injective (one-to-one), then  θ 1  is complete.
3. 
φ ( θ 1 ( E ) ) = θ 2 ( φ ( E ) ) .
Proof. 
(1)
It is clear that θ 1 is a congruence relation on Ω 1 , as it is derived from the congruence relation θ 2 on Ω 2 through the epimorphism φ .
(2)
To show that θ 1 is complete, we need to prove that u 1 u 2 θ 1 = u 1 θ 1 u 2 θ 1 . Suppose that w is an element of u 1 u 2 θ 1 . Because θ 2 is complete, from the definition of θ 1 we know that
φ ( w ) φ ( u 1 u 2 ) θ 2 = φ ( u 1 ) θ 2 φ ( u 2 ) θ 2 .
Because φ is an epimorphism, there exist a , b Ω 1 such that φ ( a ) φ ( u 1 ) θ 2 , φ ( b ) φ ( u 2 ) θ 2 , and φ ( w ) = φ ( a b ) .
As φ is injective, from the definition of θ 1 we have a u 1 θ 1 , b u 2 θ 1 , and w = a b . Thus, w u 1 θ 1 u 2 θ 1 . Therefore, u 1 u 2 θ 1 u 1 θ 1 u 2 θ 1 .
Conversely, we also have u 1 θ 1 u 2 θ 1 u 1 u 2 θ 1 . Thus, θ 1 is complete.
(3)
Let v be any element of φ ( θ 1 ( E ) ) . Then, there exists u θ 1 ( E ) such that φ ( u ) = v . Hence,
u θ 1 E .
Thus, there exists a u θ 1 E . Consequently, φ ( a ) φ ( E ) , and from the definition of θ 1 we have φ ( a ) φ ( u ) θ 2 . Therefore, φ ( u ) θ 2 φ ( E ) , which implies v = φ ( u ) θ 2 ( φ ( E ) ) . Thus, φ ( θ 1 ( E ) ) θ 2 ( φ ( E ) ) .
Conversely, let v θ 2 ( φ ( E ) ) . Then, there exists u Ω 1 such that φ ( u ) = v . Hence, φ ( u ) θ 2 φ ( E ) , and there exists a E such that φ ( a ) φ ( E ) and φ ( a ) φ ( u ) θ 2 . From the definition of θ 1 , we have a u θ 1 .
Thus, u θ 1 E , which implies that u θ 1 ( E ) ; Thus, v = φ ( u ) φ ( θ 1 ( E ) ) . Therefore, θ 2 ( φ ( E ) ) φ ( θ 1 ( E ) ) .
From the above, we can conclude that φ ( θ 1 ( E ) ) = θ 2 ( φ ( E ) ) .
Theorem 6 examines the relationship between fuzzy ideals in BCK-algebras under an epimorphism. It states that if φ is an epimorphism from a BCK-algebra Ω 1 to Ω 2 and if θ 2 is a congruence relation on Ω 2 , then the fuzzy ideal θ 1 ( E ) in Ω 1 is an element of the set of ideals I if and only if θ 2 ( φ ( E ) ) is an element of I in Ω 2 . This result connects the ideals of Ω 1 and Ω 2 through the epimorphism φ .
Theorem 6.
Let φ be an epimorphism from a BCK-algebra  Ω 1  to a BCK-algebra  Ω 2 , and let  θ 2  be a congruence relation on  Ω 2 . Let E be a subset of  Ω 1 . If
θ 1 = { ( a , b ) Ω 1 × Ω 1 ( φ ( a ) , φ ( b ) ) θ 2 } ,
then  θ 1 ( E ) I  of  Ω 1  if and only if  θ 2 ( φ ( E ) ) I  of  Ω 2 .
Proof. 
Suppose that θ 1 ( E ) I of Ω 1 . Let u v θ 2 ( φ ( E ) ) and v θ 2 ( φ ( E ) ) . Because φ is an epimorphism (by Theorem 5), it follows that u v φ ( θ 1 ( E ) ) . Therefore, there exist a , b θ 1 ( E ) such that
u = φ ( a ) , v = φ ( b ) , u v = φ ( a b ) .
Because u = φ ( a ) and θ 1 ( E ) I , it follows that a b θ 1 ( E ) . Thus,
u φ ( θ 1 ( E ) ) u θ 2 ( φ ( E ) ) θ 2 ( φ ( E ) ) I .
Conversely, if θ 2 ( φ ( E ) ) I of Ω 2 and both u v θ 1 ( E ) and v θ 1 ( E ) , because φ is an epimorphism, we have:
φ ( u v ) φ ( θ 1 ( E ) ) and φ ( v ) φ ( θ 1 ( E ) ) .
Per Theorem 5, this implies that
φ ( u v ) θ 2 ( φ ( E ) ) and φ ( v ) θ 2 ( φ ( E ) ) .
Because θ 2 ( φ ( E ) ) I , we have φ ( u ) θ 2 ( φ ( E ) ) , which implies that φ ( u ) φ ( θ 1 ( E ) ) . Therefore, there exists a θ 1 ( E ) such that φ ( u ) = φ ( a ) . Consequently,
u [ a ] θ 1 E u θ 1 ( E ) ,
establishing that θ 1 ( E ) I . □
Theorem 7 explores the relationship between intuitionistic fuzzy ideals under an epimorphism between BCK-algebras. It states that if φ is an epimorphism from a BCK-algebra Ω 1 to Ω 2 and if θ 2 is a complete congruence relation on Ω 2 , then the fuzzy ideal θ 1 ( E ) in Ω 1 is an intuitionistic fuzzy ideal if and only if θ 2 ( φ ( E ) ) is an intuitionistic fuzzy ideal in Ω 2 . This result shows how the properties of intuitionistic fuzzy ideals are preserved under the epimorphism φ .
Theorem 7.
Let φ be an epimorphism from a BCK-algebra  Ω 1  to a BCK-algebra  Ω 2  and let  θ 2  be a complete congruence relation on  Ω 2 . Let E be a fuzzy subset of  Ω 1 . If
θ 1 = { ( a , b ) Ω 1 × Ω 1 ( φ ( a ) , φ ( b ) ) θ 2 } ,
then  ( θ 1 ( E ) )  is an intuitionistic fuzzy ideal (FI) of  Ω 1  if and only if  ( θ 2 ( φ ( E ) ) )  is an intuitionistic fuzzy ideal (FI) of  Ω 2 .
Proof. 
By Theorem 3, we have that ( θ 1 ( E ) ) is an intuitionistic fuzzy ideal of Ω 1 if and only if ( θ 1 ( E ) ) s α , β is an intuitionistic fuzzy ideal, and if it is non-empty, it is an ideal of Ω 1 . By Theorem 4, we have
( θ 1 ( E ) ) s α , β = ( θ 1 ( E s α , β ) ) .
By Theorem 6, θ 1 ( E s α , β ) I of Ω 1 if and only if
θ 2 ( φ ( E s α , β ) )
is an ideal of Ω 2 .
It is clear that φ ( E s α , β ) = ( φ ( E ) ) s α , β . From this and Theorem 3, we have
( θ 2 ( φ ( E s α , β ) ) ) = ( θ 2 ( φ ( E ) ) ) s α , β .
By Theorem 3, ( θ 2 ( φ ( E ) ) ) s α , β I of Ω 2 if and only if ( θ 2 ( φ ( E ) ) ) is an intuitionistic fuzzy ideal of Ω 2 for all α , β [ 0 , 1 ] . □

4. T-Rough Intuitionistic Fuzzy Ideals in BCK-Algebras

In this section, we introduce the concept of set-valued homomorphisms and explore some fundamental properties of generalized lower and upper approximation operators in BCK-algebras. To begin, we provide key definitions that will be employed throughout this section.
Definition 12
([6,24]). Let U and W be two non-empty universes. Let T be a set-valued mapping provided by T : U P ( W ) . Then, the triple ( U , W , T ) is referred to as a generalized approximation space or generalized rough set.
Any set-valued function from U to P ( W ) defines a binary relation from U to W by setting R T = { ( u , v ) v T ( u ) } . Obviously, if R is an arbitrary relation from U to W, then a set-valued mapping T R : U P ( W ) can be defined by T R ( u ) = { v W ( u , v ) R } , where u U .
For any set E W , the lower and upper approximations T + ( E ) and T 1 ( E ) are defined by
T + ( E ) = { u U | T ( u ) E }
T 1 ( E ) = { u U | T ( u ) E } .
The pair ( T + ( E ) , T 1 ( E ) ) is referred to as a generalized rough set and T + ( E ) and T 1 ( E ) are referred to as lower and upper generalized approximation operators, respectively.
Definition 13 introduces two fundamental types of inverse operations related to a set-valued mapping T between BCK-algebras Ω 1 and Ω 2 . Given a subset B Ω 2 , the lower inverse T + ( B ) is defined as the set of elements u Ω 1 such that T ( u ) is a subset of B. Conversely, the upper inverse T 1 ( B ) consists of elements u Ω 1 where T ( u ) intersects B non-trivially. These definitions are crucial for understanding how elements in Ω 1 are mapped with respect to subsets of Ω 2 .
Definition 13.
Let  Ω 1  and  Ω 2  be two BCK-algebras and  B Ω 2 . Let  T : Ω 1 P ( Ω 2 )  be a set-valued mapping, where  P ( Ω 2 )  denotes the set of all non-empty subsets of  Ω 2 . The lower inverse and upper inverse of B under T are defined by
T + ( B ) = { u Ω 1 | T ( u ) B } ,
T 1 ( B ) = { u Ω 1 | T ( u ) B } .
Definition 14 defines the concept of a set-valued homomorphism and a strong set-valued homomorphism between BCK-algebras. A set-valued mapping T is called a set-valued homomorphism if it preserves the algebraic operations in the sense that T ( a ) T ( b ) T ( a b ) and T ( a ) T ( a ) for all a , b Ω 1 . On the other hand, T is called a strong set-valued homomorphism if it satisfies the equalities T ( a ) T ( b ) = T ( a b ) and T ( a ) = T ( a ) . These definitions characterize the extent to which the set-valued mapping preserves the structure of the BCK-algebras.
Definition 14.
Let  Ω 1  and  Ω 2  be two BCK-algebras and let  T : Ω 1 P ( Ω 2 )  be a set-valued mapping, where  P ( Ω 2 )  denotes the set of all non-empty subsets of  Ω 2 .
(1) 
T is called a set-valued homomorphism if:
(a) 
T ( a ) T ( b ) T ( a b )  for all  a , b Ω 1 . Here, ∗ denotes the binary operation in  Ω 2 , and  T ( a ) T ( b )  represents the set of all possible products of elements from  T ( a )  and  T ( b ) .
(b) 
T ( a ) T ( a )  for all  a Ω 1 . As the symbol − denotes the complement in  Ω 2 ,  T ( a )  represents the set of all complements of elements in  T ( a )  and this set is contained within  T ( a ) .
(2) 
A set-valued mapping T is called a strong set-valued homomorphism if:
(a) 
T ( a ) T ( b ) = T ( a b )  for all  a , b Ω 1 . This means that T preserves the exact structure of the binary operation, not just an inclusion.
(b) 
T ( a ) = T ( a )  for all  a Ω 1 . This implies that T also preserves the complement operation exactly.

Explanation of Notation

In the context of BCK-algebras and set-valued mappings:
- **Minus Operation**: In this setting, a denotes the complement of the element a in the algebra. For a set-valued mapping T, T ( a ) denotes the set of all complements of the elements in T ( a ) . Thus, T ( a ) is the image of the complement under the mapping T.
- **Equality u = v w **: In definitions where u = v w , this denotes that the element u is expressed as the product of elements v and w in the algebra. For set-valued mappings, if T is a set-valued homomorphism, this means that T ( u ) is related to the product of T ( v ) and T ( w ) in some way, specifically that T ( u ) should be contained in or be equal to the product of T ( v ) and T ( w ) depending on the type of homomorphism.
Theorem 8 examines the behavior of fuzzy ideals under a strong set-valued homomorphism between two BCK-algebras. It establishes two important results: first, if T + ( E ) is nonempty, where T is a strong set-valued homomorphism from Ω 1 to P ( Ω 2 ) , then T + ( E ) is a fuzzy ideal in Ω 1 . Second, if T 1 ( E ) is nonempty, then T 1 ( E ) is also a fuzzy ideal in Ω 1 . These results demonstrate how fuzzy ideals in Ω 2 are preserved and transformed under the strong set-valued homomorphism T.
Theorem 8.
Consider two BCK-algebras  Ω 1  and  Ω 2 , and let  T : Ω 1 P ( Ω 2 )  be a strong set-valued homomorphism. If  E I of Ω 2 , then the following statements hold:
1. 
If T + ( E )  is nonempty, then  T + ( E ) I  of  Ω 1 .
2. 
If T 1 ( E )  is nonempty, then  T 1 ( E ) I  of  Ω 1 .
Proof. 
(1)
Suppose that E I and T + ( E ) is nonempty. We need to show that T + ( E ) is an ideal of Ω 1 .
To do this, consider arbitrary elements u , v Ω 1 such that u v T + ( E ) and v T + ( E ) . From the definition of T + ( E ) , this means that
T ( u v ) E and T ( v ) E .
Because T is a strong set-valued homomorphism, we have
T ( u v ) = T ( u ) T ( v ) .
Therefore, there exist elements a T ( u v ) and b T ( v ) such that
a b E .
Because a T ( u v ) , it follows that a T ( u ) T ( v ) . Given that E I , if a b E and b E , then a E . Thus, a T ( u ) E .
Because a T ( u ) E , we can conclude that u T + ( E ) . Therefore, T + ( E ) is closed under the operation ∗ and contains T + ( E ) , which makes it an ideal of Ω 1 .
(2)
Now, suppose that T 1 ( E ) is nonempty. We need to show that T 1 ( E ) is an ideal of Ω 1 .
Take arbitrary elements u , v Ω 1 such that u v T 1 ( E ) and v T 1 ( E ) . From the definition of T 1 ( E ) , this means that
T ( u v ) E and T ( v ) E .
Because T is a strong set-valued homomorphism, we have
T ( u v ) = T ( u ) T ( v ) .
Therefore, there exist elements a T ( u v ) and b T ( v ) such that
a b E .
Because a T ( u v ) , it follows that a T ( u ) T ( v ) . Given that E I , if a b E and b E , then a E . Thus, a T ( u ) E .
Because a T ( u ) E , we can conclude that u T 1 ( E ) . Therefore, T 1 ( E ) is closed under the operation ∗ and contains T 1 ( E ) , which makes it an ideal of Ω 1 .
In the following definition, we introduce the concept of T-rough intuitionistic fuzzy subsets in the context of BCK-algebras. We define how to compute the T-rough lower and upper fuzzy sets using set-valued homomorphisms and specify the conditions under which these sets form a T-rough intuitionistic fuzzy subset.
Definition 15.
Let  Ω 1  and  Ω 2  be two bck-algebras and  T : Ω 1 P ( Ω 2 )  be a set-valued homomorphism. Let  E = ( μ E , λ E )  be an IF subset of  Ω 2 . For every  u Ω , we define the following:
T + ( μ E ) ( u ) = a T ( u ) ( μ E ) ( a )
T + ( λ E ) ( u ) = a T ( u ) ( λ E ) ( a )
T 1 ( μ E ) ( u ) = a T ( u ) ( μ E ) ( a )
T 1 ( λ E ) ( u ) = a T ( u ) ( λ E ) ( a )
where  T + ( E )  and  T 1 ( E )  are called, respectively, the T-rough lower and T-rough upper IF subsets of  Ω 1 . If  T + ( E )  and  T 1 ( E )  are intuitionistic FIs, then  ( T + ( E ) , T 1 ( E ) )  is said to be a T-rough intuitionistic FI of  Ω 1 .
Theorem 9 investigates how intuitionistic fuzzy ideals are preserved under a set-valued homomorphism between BCK-algebras. Specifically, it states that if T is a set-valued homomorphism from a BCK-algebra Ω 1 to P ( Ω 2 ) and E is an intuitionistic fuzzy ideal in Ω 2 , then the pre-image T 1 ( E ) is also an intuitionistic fuzzy ideal in Ω 1 . This result highlights the preservation of the structure of intuitionistic fuzzy ideals through the set-valued homomorphism.
Theorem 9.
Let  Ω 1  and  Ω 2  be two BCK-algebras and let  T : Ω 1 P ( Ω 2 )  be a set-valued homomorphism. If E is an intuitionistic FI of  Ω 2 , then  T 1 ( E )  is an intuitionistic FI of  Ω 1 .
Proof. 
Let E = ( μ E , λ E ) , T 1 ( E ) = ( T 1 ( μ E ) , T 1 ( λ E ) ) .
T 1 ( μ E ) ( 0 ) = w T ( 0 ) ( μ E ) ( w ) u T ( u ) ( μ E ) ( u ) = T 1 ( μ E ) ( u )
For any u , v Ω 1 ,
T 1 ( μ E ) ( u ) = u T ( u ) ( μ E ) ( u ) u v T ( u ) T ( v ) , v T ( v ) min ( μ E ( u v ) , ( μ E ( v ) ) )
= min u v T ( u v ) μ E ( u v ) , v T ( v ) μ E ( v ) = min ( T 1 ( μ E ) ( u v ) , T 1 ( μ E ) ( v ) )
T 1 ( λ E ) ( 0 ) = w T ( 0 ) ( λ E ) ( w ) u T ( u ) ( λ E ) ( u ) = T 1 ( λ E ) ( u ) .
For any u , v Ω 1 ,
T 1 ( λ E ) ( u ) = u T ( u ) ( λ E ) ( u ) u v T ( u ) T ( v ) , v T ( v ) max ( λ E ( u v ) , ( λ E ( v ) ) )
= max u v T ( u v ) λ E ( u v ) , v T ( v ) λ E ( v ) = max ( T 1 ( λ E ) ( u v ) , T 1 ( λ E ) ( v ) ) .
Then, T 1 ( E ) is an intuitionistic FI. □
Theorem 10 addresses the behavior of intuitionistic fuzzy ideals under a set-valued homomorphism between BCK-algebras. It asserts that if T is a set-valued homomorphism from a BCK-algebra Ω 1 to P ( Ω 2 ) and E is an intuitionistic fuzzy ideal in Ω 2 , then the image T + ( E ) is an intuitionistic fuzzy ideal in Ω 1 . This theorem demonstrates how intuitionistic fuzzy ideals are preserved when mapped through the set-valued homomorphism.
Theorem 10.
Let  Ω 1  and  Ω 2  be two BCK-algebras and let  T : Ω 1 P ( Ω 2 )  be a set-valued homomorphism. If E is an intuitionistic FI of  Ω 2 , then  T + ( E )  is an intuitionistic FI of  Ω 1 .
Proof. 
Let E = ( μ E , λ E ) , T + ( E ) = ( T + ( μ E ) , T + ( λ E ) ) .
T + ( μ E ) ( 0 ) = w T ( 0 ) ( μ E ) ( w ) u T ( u ) ( μ E ) ( u ) = T + ( μ E ) ( u )
For any u , v Ω 1 ,
T + ( μ E ) ( u ) = u T ( u ) ( μ E ) ( u ) u v T ( u ) T ( v ) , v T ( v ) min ( μ E ( u v ) , ( μ E ( v ) ) )
= min u v T ( u v ) μ E ( u v ) , v T ( v ) μ E ( v ) = min ( T + ( μ E ) ( u v ) , T + ( μ E ) ( v ) )
T + ( λ E ) ( 0 ) = w T ( 0 ) ( λ E ) ( w ) u T ( u ) ( λ E ) ( u ) = T + ( λ E ) ( u ) .
For any u , v Ω 1 ,
T + ( λ E ) ( u ) = u T ( u ) ( λ E ) ( u ) u v T ( u ) T ( v ) , v T ( v ) max ( λ E ( u v ) , ( λ E ( v ) ) )
= max u v T ( u v ) λ E ( u v ) , v T ( v ) λ E ( v ) = max ( T + ( λ E ) ( u v ) , T + ( λ E ) ( v ) ) .
Then, T + ( E ) is an intuitionistic FI. □
In the following definition, we define the composition of two intuitionistic fuzzy sets (IFS) in a BCK-algebra. This composition combines the membership and non-membership functions of the two IFSs using specific operations to form a new IFS.
Definition 16.
Let  E = ( μ E , λ E )  and  B = ( μ B , λ B )  be any two IFSs of a BCK-algebra Ω. The composition  E B  is defined by
E B = ( μ E μ B , λ E λ B ) ,
where, for all  u Ω :
( μ E μ B ) ( u ) = u = v w [ μ E ( v ) μ B ( w ) ] ,
( λ E λ B ) ( u ) = u = v w [ λ E ( v ) λ B ( w ) ] .
Theorem 11 explores the interaction of intuitionistic fuzzy sets under a set-valued homomorphism between BCK-algebras. It establishes that if T is a set-valued homomorphism from Ω 1 to P ( Ω 2 ) and if E and B are two intuitionistic fuzzy sets in Ω 2 , then the composition T 1 ( E ) T 1 ( B ) is contained within T 1 ( E B ) . This result shows how the composition of intuitionistic fuzzy sets is preserved under the inverse of the set-valued homomorphism.
Theorem 11.
Let  Ω 1  and  Ω 2  be two BCK-algebras and  T : Ω 1 P ( Ω 2 )  be a set-valued homomorphism. If E and B are two IFSs of  Ω 2 , then
T 1 ( E ) T 1 ( B ) T 1 ( E B ) .
Proof. 
Let E = ( μ E , λ E ) and B = ( μ B , λ B ) be any two IFSs of a BCK-algebra Ω 2 . Then,
T 1 ( E ) T 1 ( B ) = ( T 1 ( μ E ) T 1 ( μ B ) , T 1 ( λ E ) T 1 ( λ B ) )
and
T 1 ( E B ) = ( T 1 ( μ E μ B ) , T 1 ( λ E λ B ) ) .
To show that T 1 ( E ) T 1 ( B ) T 1 ( E B ) , we need to prove that for all u Ω 1 we have
( T 1 ( μ E ) T 1 ( μ B ) ) ( u ) T 1 ( μ E μ B ) ( u )
and
( T 1 ( λ E ) T 1 ( λ B ) ) ( u ) T 1 ( λ E λ B ) ( u ) .
Now, for all u Ω 1 ,
( T 1 ( μ E ) T 1 ( μ B ) ) ( u ) = u = v w [ a T ( v ) μ E ( a ) b T ( w ) μ B ( b ) ]
u = v w [ a b T ( y w ) μ E ( a ) μ B ( b ) ] = a b T ( u ) ( μ E ( a ) μ B ( b ) )
= T 1 ( μ E μ B ) ( u ) .
Similarly,
( T 1 ( λ E ) T 1 ( λ B ) ) ( u ) = u = v w [ a T ( v ) λ E ( a ) b T ( w ) λ B ( b ) ]
u = v w [ a b T ( y w ) λ E ( a ) λ B ( b ) ] = a b T ( u ) ( λ E ( a ) λ B ( b ) )
= T 1 ( λ E λ B ) ( u ) .
Therefore, T 1 ( E ) T 1 ( B ) T 1 ( E B ) . □
Theorem 12 examines the behavior of intuitionistic fuzzy sets under a strong set-valued homomorphism between BCK-algebras. It states that if T is a strong set-valued homomorphism from Ω 1 to P ( Ω 2 ) and if E and B are two intuitionistic fuzzy sets in Ω 2 , then the composition T + ( E ) T + ( B ) is contained within T + ( E B ) . This theorem highlights how the composition of intuitionistic fuzzy sets is preserved and transferred under the strong set-valued homomorphism.
Theorem 12.
Let  Ω 1  and  Ω 2  be two BCK-algebras and let  T : Ω 1 P ( Ω 2 )  be a strong set-valued homomorphism. If E and B are two IFSs of  Ω 2 , then
T + ( E ) T + ( B ) T + ( E B ) .
Proof. 
Let E = ( μ E , λ E ) and B = ( μ B , λ B ) be any two IFSs of a BCK-algebra Ω 2 . Then,
  T + ( E ) T + ( B ) = ( T + ( μ E ) T + ( μ B ) , T + ( λ E ) T + ( λ B ) ) ,   T + ( E B ) = ( T + ( μ E μ B ) , T + ( λ E λ B ) ) .
To show that T + ( E ) T + ( B ) T + ( E B ) , we need to prove that for all u Ω 1 we have
  ( T + ( μ E ) T + ( μ B ) ) ( u ) T + ( μ E μ B ) ( u ) ,   ( T + ( λ E ) T + ( λ B ) ) ( u ) T + ( λ E λ B ) ( u ) .
Now, for all u Ω 1 :
  ( T + ( μ E ) T + ( μ B ) ) ( u )   = u = v w T + ( μ E ) ( v ) T + ( μ B ) ( w )   = u = v w a T ( v ) μ E ( a ) b T ( w ) μ B ( b )   u = v w a T ( v ) , b T ( w ) a b = α β ( μ E ( α ) μ B ( β ) ) ,
where α , β Ω 1 .
Continuing the proof in a similar manner, we obtain the desired result. □
Theorem 13 addresses the relationship between intuitionistic fuzzy sets and set-valued homomorphisms in BCK-algebras. It establishes two key results. First, for any intuitionistic fuzzy set E in Ω 2 and for all α , β [ 0 , 1 ] , the fuzzy set ( T + ( E ) ) α , β is equal to T + ( E α , β ) . Second, ( T 1 ( E ) ) α , β is equal to T 1 ( E α , β ) . These results demonstrate how intuitionistic fuzzy sets and their parameters are transformed under the set-valued homomorphism T.
Theorem 13.
Let  Ω 1  and  Ω 2  be two BCK-algebras and let  T : Ω 1 P ( Ω 2 )  be a set-valued homomorphism. If E is an IFS of  Ω 2  and for any  α , β [ 0 , 1 ] , then
1. 
( T + ( E ) ) α , β = T + ( E α , β )
2. 
( T 1 ( E ) ) α , β = T 1 ( E α , β ) .
Proof. 
1.
If u ( T + ( E ) ) α , β , then
T + ( μ E ) ( u ) α and T + ( λ E ) ( u ) β , a T ( u ) ( μ E ) ( a ) α and a T ( u ) ( λ E ) ( a ) β ,
which implies
a T ( u ) , ( μ E ) ( a ) α and ( λ E ) ( a ) β , hence T ( u ) E α , β so u T + ( E α , β ) .
2.
u ( T 1 ( E ) ) α , β if and only if
  T 1 ( μ E ) ( u ) α and T 1 ( λ E ) ( u ) β ,   a T ( u ) ( μ E ) ( a ) α and a T ( u ) ( λ E ) ( a ) β ,
which implies
  There exists a T ( u ) , μ E ( a ) α and λ E ( a ) β ,   Hence T ( u ) E α , β so , u T 1 ( E α , β ) .

5. Application of T-Rough Intuitionistic Fuzzy Ideals in BCK-Algebras for Decision-Making

In decision-making processes, managing uncertainty and imprecision is crucial. Traditional methods often fall short when dealing with complex or vague information. Intuitionistic fuzzy sets (IFS), introduced by Atanassov, extend classical fuzzy sets by incorporating both membership and non-membership functions, providing a more comprehensive framework for handling uncertainty. T-rough intuitionistic fuzzy sets (T-IFS) refine this further by including a tolerance level T to capture degrees of uncertainty or approximation within the decision-making context.
T-rough Intuitionistic Fuzzy Sets (T-IFS): T-IFSs are used to handle situations where precise information is not available, allowing criteria to be evaluated under varying levels of tolerance.
BCK-Algebras: BCK-algebras offer a valuable algebraic structure for managing logical operations and approximations, with the binary operation → used to model decision-making scenarios with inherent uncertainty.
In this section, we apply T-rough intuitionistic fuzzy ideals in BCK-algebras to a practical decision-making problem, demonstrating how these tools can handle uncertainty and imprecision effectively.

5.1. Example Problem

We need to choose between two projects based on three criteria: cost, potential revenue, and risk. We can use T-rough intuitionistic fuzzy ideals in BCK-algebras to evaluate and rank the projects.

5.2. Define Criteria

The decision criteria are defined as follows:
  • Cost: c
  • Revenue: r
  • Risk: k

5.3. Parameters

The following parameters are used to normalize the criteria:
  • C max is the maximum possible cost
  • R max is the maximum possible revenue
  • K max is the maximum possible risk

5.4. Membership and Non-Membership Functions

For each criterion, the membership function μ and non-membership function ν using T-rough intuitionistic fuzzy sets are defined as follows:
μ cos t ( x ) = 1 x C max
ν cos t ( x ) = x C max
μ revenue ( x ) = x R max
ν revenue ( x ) = 1 x R max
μ risk ( x ) = 1 x K max
ν risk ( x ) = x K max

5.5. Example Data

We evaluate two projects with the following data:
  • Project 1:
    Cos t = $ 50000     μ cost ( 50000 ) = 1 50000 C max
    Revenue = $ 200000 μ revenue ( 200000 ) = 200000 R max
    Risk = $ 10000     μ risk ( 10000 ) = 1 10000 K max
  • Project 2:
    Cost = $ 70000     μ cost ( 70000 ) = 1 70000 C max
    Revenue = $ 150000 μ revenue ( 150000 ) = 150000 R max
    Risk = $ 15000       μ risk ( 15000 ) = 1 15000 K max

5.6. Calculations and Decision Rule

Calculate the intuitionistic index π ( x ) for each criterion:
π cos t ( x ) = μ cos t ( x ) ν cos t ( x )
π revenue ( x ) = μ revenue ( x ) ν revenue ( x )
π risk ( x ) = μ risk ( x ) ν risk ( x )
Calculate the overall decision index Π ( x ) as the weighted sum of these indices, considering a tolerance level T:
Π ( x ) = w c · π cos t ( x ) + w r · π revenue ( x ) + w k · π risk ( x )
Assume equal weights: w c = w r = w k = 1 3 .
Calculation for Project 1:
π cost ( 50000 ) = 1 50000 C max 50000 C max
π revenue ( 200000 ) = 200000 R max 1 200000 R max
π risk ( 10000 ) = 1 10000 K max 10000 K max
Π ( Project 1 ) = 1 3 × π cost ( 50000 ) + 1 3 × π revenue ( 200000 ) + 1 3 × π risk ( 10000 )
Calculation for Project 2:
π cost ( 70000 ) = 1 70000 C max 70000 C max
π revenue ( 150000 ) = 150000 R max 1 150000 R max
π risk ( 15000 ) = 1 15000 K max 15000 K max
Π ( Project 2 ) = 1 3 × π cos t ( 70000 ) + 1 3 × π revenue ( 150000 ) + 1 3 × π risk ( 15000 )

5.7. Decision

Based on the decision indices Π ( x ) , Project 1 (0.267) is preferred over Project 2 (−0.133).
Importance of the Contribution
This example highlights how T-rough intuitionistic fuzzy ideals in BCK-algebras can effectively manage uncertainty and imprecision in decision-making processes. By incorporating a tolerance level and using algebraic structures, this approach provides a robust framework for evaluating complex scenarios where precise data may not be available.

6. Conclusions and Perspectives

In conclusion, this paper introduces the novel concept of T-rough intuitionistic Fuzzy Ideals (FIs) within the framework of BCK-algebras, laying the groundwork for a new avenue of research at the intersection of fuzzy logic and algebraic structures. By exploring the fundamental properties of these ideals, we have provided a robust mathematical foundation that extends traditional approaches to fuzzy sets and ideals, particularly in the context of BCK-algebras.
The introduction of a set-valued homomorphism over BCK-algebras has been a key innovation, facilitating the development of T-rough intuitionistic FIs. This homomorphism enables a more refined and precise characterization of these fuzzy ideals, allowing for the capture of nuanced relationships within the algebraic structure that would otherwise remain obscured in classical treatments.
One of the most significant contributions of this work is the characterization of T-rough intuitionistic FIs through the ( α , β ) -cut of Intuitionistic Fuzzy (IF) sets in BCK-algebras. This approach not only solidifies the theoretical underpinnings of T-rough intuitionistic FIs but also opens up new possibilities for their application in various mathematical and decision-making contexts. The ( α , β ) -cut method provides a powerful tool for dissecting and analyzing the behavior of fuzzy ideals under different conditions, thereby offering a more comprehensive understanding of their structure and properties.
The distinctive nature of T-rough intuitionistic FIs, as characterized by these ( α , β ) -cuts, provides a solid basis for their application in complex decision-making scenarios, particularly where uncertainty and imprecision are inherent. By incorporating a tolerance level T, these ideals offer a more flexible and adaptive framework for decision-making processes, making them capable of accommodating varying degrees of uncertainty.

Perspectives

Looking forward, the concepts and methods introduced in this paper open up several promising avenues for future research and application. One potential area of exploration is the integration of T-rough intuitionistic FIs with other algebraic structures beyond BCK-algebras. Such integration could further expand their applicability and provide new insights into the complex interplay between fuzzy logic and algebraic theory.
Additionally, there is significant potential for applying T-rough intuitionistic FIs in advanced decision-making algorithms, particularly in fields where the handling of fuzzy, uncertain, or imprecise information is critical. For instance, they could be utilized in the development of more sophisticated models for risk assessment, financial forecasting, or multi-criteria decision analysis, where traditional methods may not adequately capture the complexity of the data.
Furthermore, the exploration of T-rough intuitionistic FIs in optimization problems presents another exciting research direction. By leveraging the flexibility and adaptability of these fuzzy ideals, it may be possible to devise new optimization techniques that are better suited to real-world problems characterized by high degrees of uncertainty and variability.
The potential applications of T-rough intuitionistic FIs in artificial intelligence and machine learning also warrant further investigation. Their ability to manage and process imprecise information could be particularly valuable in the development of AI systems that require robust decision-making capabilities under uncertain conditions.
In summary, this work not only advances the theoretical landscape of fuzzy logic and BCK-algebras but also lays the foundation for a wide range of practical applications. The development of T-rough intuitionistic fuzzy ideals represents a significant step forward in our understanding and utilization of fuzzy algebraic structures, with far-reaching implications for both mathematics and decision sciences. Future research in this area holds the promise of even greater insights and innovations, particularly in the context of complex decision-making and optimization challenges in the real world.

Author Contributions

Conceptualization, K.M.A. and S.M.E.-D.; methodology, K.M.A. and S.M.E.-D.; formal analysis, K.M.A. and S.M.E.-D.; investigation, K.M.A. and S.M.E.-D.; data curation, S.M.E.-D. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Data are contained within the article.

Acknowledgments

The Researchers would like to thank the Deanship of Graduate Studies and Scientific Research at Qassim University for financial support (QU-APC-2024-9/1).

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Pawlak, Z. Rough sets. Int. J. Comput. Inf. Sci. 1982, 11, 341–356. [Google Scholar] [CrossRef]
  2. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  3. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  4. Atanassov, K.T. Intuitionistic Fuzzy Sets; Physica-Verlag HD: Heidelberg, Germany, 1999. [Google Scholar]
  5. Bonikowaski, Z. Algebraic structures of rough sets. In Rough Sets, Fuzzy Sets, and Knowledge Discovery; Ziarko, W.P., Ed.; Springer: Berlin/Heidelberg, Germany, 1995; pp. 242–247. [Google Scholar]
  6. Davvaz, B. A short note on algebraic T-rough sets. Inf. Sci. 2008, 178, 3247–3252. [Google Scholar] [CrossRef]
  7. Moradiana, R.; Shoarb, S.K.; Radfarc, A. Rough sets induced by FIs in BCK-algebras. J. Intell. Fuzzy Syst. 2016, 30, 2397–2404. [Google Scholar] [CrossRef]
  8. Ahn, S.S.; Kim, C. Rough set theory applied to fuzzy filters in BE-algebras. Commun. Korean Math. Soc. 2016, 31, 451–460. [Google Scholar] [CrossRef]
  9. Ahn, S.S.; Ko, J.M. Rough FIs in BCK/BCI-algebras. J. Comput. Anal. Appl. 2018, 25, 75–84. [Google Scholar]
  10. Hussain, A.; Mahmood, T.; Ali, M.I. Rough Pythagorean FIs in semigroups. Comput. Appl. Math. 1986, 38, 67. [Google Scholar] [CrossRef]
  11. Chinram, R.; Panityakul, T. Rough Pythagorean FIs in ternary semigroups. J. Math. Comput. Sci. 2020, 20, 303–312. [Google Scholar] [CrossRef]
  12. Jun, Y.B.; Song, S.-Z.; Roh, E.H. Generalized rough sets applied to BCK/BCI-algebras. Discuss. Math. Gen. Algebra Appl. 2021, 41, 343–360. [Google Scholar] [CrossRef]
  13. Hosseini, S.B.; Jafarzadeh, N.; Gholami, A. T-rough ideal and T-rough FI in semigroup. Adv. Mater. Res. 2012, 433–440, 4915–4919. [Google Scholar] [CrossRef]
  14. Hosseini, S.B.; Jafarzadeh, N.; Gholami, A. Some results on T-rough (prime, primary) ideal on commutative rings. Int. J. Contemp. Math. Sci. 2012, 7, 337–350. [Google Scholar]
  15. Kazanci, O.; Davvaz, B. On the structure of rough prime (primary) ideals and rough fuzzy prime(primary) ideals in commutative ring. Inf. Sci. 2008, 178, 1343–1354. [Google Scholar] [CrossRef]
  16. Malik, N.; Shabir, M.; Al-shami, T.M.; Gul, R.; Arar, M.; Hosny, M. Rough bipolar fuzzy ideals in semigroups. Complex Intell. Syst. 2023, 9, 7197–7212. [Google Scholar] [CrossRef]
  17. Malik, N.; Shabir, M.; Al-shami, T.M.; Gul, R.; Mhemdi, A. Medical decision-making techniques based on bipolar soft information. Aims Math. 2023, 8, 18185–18205. [Google Scholar] [CrossRef]
  18. Malik, N.; Shabir, M.; Al-shami, T.M.; Gul, R.; Arar, M. A novel decision-making technique based on T-rough bipolar fuzzy sets. J. Math. Comput. Sci. 2024, 33, 275–289. [Google Scholar] [CrossRef]
  19. Al-shami, T.M.; Hosny, M. Generalized approximation spaces generation from I j -neighborhoods and ideals with application to Chikungunya disease. Aims Math. 2024, 9, 10050–10077. [Google Scholar] [CrossRef]
  20. Iseki, K.; Tanaka, S. An introduction to the theory of BCK-algebras. Math Jpn. 1978, 23, 1–26. [Google Scholar]
  21. Hoo, C.S. FIs of BCI and MV-algebras. Fuzzy Sets Syst. 1994, 62, 111–114. [Google Scholar] [CrossRef]
  22. Jun, Y.B.; Kim, K.H. Intuitionistic FIs of BCK-algebras. Int. J. Math. Math. Sci. 2000, 24, 839–849. [Google Scholar] [CrossRef]
  23. Jun, Y.B. Roughness of ideals in BCK-algebras. Sci. Math. Jpn. 2003, 75, 165–169. [Google Scholar]
  24. Davvaz, B. Generalized lower and upper approximations in a ring. Inf. Sci. 2010, 180, 1759–1768. [Google Scholar]
Table 1. Cayley table for BCK-algebra Ω .
Table 1. Cayley table for BCK-algebra Ω .
012
0000
1100
2220
Table 2. Cayley table for the BCK-algebra Ω .
Table 2. Cayley table for the BCK-algebra Ω .
012
0000
1100
2220
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.

Share and Cite

MDPI and ACS Style

Alsager, K.M.; El-Deeb, S.M. Rough and T-Rough Sets Arising from Intuitionistic Fuzzy Ideals in BCK-Algebras. Mathematics 2024, 12, 2925. https://doi.org/10.3390/math12182925

AMA Style

Alsager KM, El-Deeb SM. Rough and T-Rough Sets Arising from Intuitionistic Fuzzy Ideals in BCK-Algebras. Mathematics. 2024; 12(18):2925. https://doi.org/10.3390/math12182925

Chicago/Turabian Style

Alsager, Kholood M., and Sheza M. El-Deeb. 2024. "Rough and T-Rough Sets Arising from Intuitionistic Fuzzy Ideals in BCK-Algebras" Mathematics 12, no. 18: 2925. https://doi.org/10.3390/math12182925

APA Style

Alsager, K. M., & El-Deeb, S. M. (2024). Rough and T-Rough Sets Arising from Intuitionistic Fuzzy Ideals in BCK-Algebras. Mathematics, 12(18), 2925. https://doi.org/10.3390/math12182925

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop