Next Article in Journal
Multi-Vehicle Collision Avoidance by Vehicle Longitudinal Control Based on Optimal Collision Distance Estimation
Previous Article in Journal
Multiple Solutions for Double-Phase Elliptic Problem with NonLocal Interaction
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Fuzzy Sets in Strong Sheffer Stroke NMV-Algebra with Respect to a Triangular Norm

1
Department of Mathematics, School of Advanced Sciences, VIT-AP University, Amaravati 522237, Andhra Pradesh, India
2
Department of Mathematics, Faculty of Science, Ege University, 35100 Izmir, Turkey
3
Department of Mathematics, Rajah Serfoji Government College, Thanjavur 613005, Tamilnadu, India
4
Department of Mathematical Sciences, College of Science, Princess Nourah bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(8), 1282; https://doi.org/10.3390/math13081282
Submission received: 14 March 2025 / Revised: 9 April 2025 / Accepted: 12 April 2025 / Published: 14 April 2025
(This article belongs to the Special Issue Fuzzy Sets and Fuzzy Algebras)

Abstract

:
In this paper, we explore the application of fuzzy set theory in the context of triangular norms, with a focus on strong Sheffer stroke NMV-algebras. We introduce the concepts of T -fuzzy subalgebras and T -fuzzy filters, analyze their properties, and provide several illustrative examples. Our study demonstrates that T -fuzzy subalgebras and filters generalize classical subalgebras and filters, with level subsets preserving algebraic structures under t-norms. Notably, T -fuzzy sets exhibit strong closure properties, and homomorphisms between SSNMV-algebras extend naturally to fuzzy settings. Furthermore, we examine the relationships between T -fuzzy subalgebras (or filters) and their classical counterparts, as well as their corresponding level subsets and homomorphisms. These results contribute to refined uncertainty modeling in logical systems, with potential applications in fuzzy control and AI.

1. Introduction

Fuzzy set theory provides a robust framework for addressing uncertainty and imprecision across various domains. Fuzzy sets are employed to represent concepts that are inherently difficult to define precisely, capturing the degree to which elements belong to a set. Over time, this approach has been extended and refined through the integration of various logical systems and algebraic structures. One such system, the strong Sheffer stroke NMV-algebra, represents a generalization of classical Boolean algebra, offering a rich set of operations that are well-suited for modeling fuzzy relations and interactions.
The Sheffer operation, sometimes referred to as the Sheffer stroke or the NAND operator, was first introduced by H. M. Sheffer [1]. Its significance lies in its ability to operate independently, without reliance on any other logical operations, thereby forming a complete logical system. In other words, all the axioms of a logical framework can be expressed using solely the Sheffer operation, simplifying the analysis and manipulation of these systems. Furthermore, the axioms of Boolean algebra—the algebraic counterpart to classical propositional logic—can be fully articulated using only the Sheffer operation, thus emphasizing its flexibility and utility within logical systems.
The Sheffer stroke operation, due to its unique property of expressing all other logical connectives in Boolean logic, has numerous applications across diverse fields, including computer science, technology, and algebra. In the domain of mathematical logic and algebra, several significant applications have been explored. These include the use of Sheffer stroke operation reducts in basic algebras [2], an examination of state operators in Sheffer stroke basic algebras [3], and its role within orthoimplication algebras [4]. Moreover, the Sheffer stroke operation has been studied within the context of strong non-associative MV-algebras and their filters [5]. Recent research by Molkhasi et al. has explored representations of strongly algebraically closed algebras, Sheffer stroke algebras, and Visser algebras [6,7].
Triangular norms ( t -norms) are fundamental operators in fuzzy logic, utilized to model the intersection or conjunction of fuzzy sets. These norms play a critical role in combining degrees of membership within fuzzy set theory, providing a formal mechanism to represent the “and” operation in a fuzzy context. t -norms are defined as binary operations that are associative, commutative, and monotonic, with 1 as the identity element. These properties render t -norms essential in various applications, including decision making, probability theory, and fuzzy logic, where they serve as key tools for managing uncertainty and vagueness in a structured manner. In recent years, numerous studies have investigated the applications of triangular norms [8,9,10,11,12].
In this paper, we examine the behavior of fuzzy sets within the context of a strong Sheffer stroke NMV-algebra, with a particular focus on their interaction with t -norms. t -norms, which generalize the classical concept of intersection in set theory, are critical for understanding the interactions between fuzzy sets. Their application within the strong Sheffer stroke NMV-algebra provides new insights into fuzzy reasoning and logical systems. We investigate the algebraic properties of fuzzy sets under the influence of t -norms and explore how these interactions enhance our understanding of uncertainty management within non-classical logical frameworks.
This section reviews the foundational concepts of Sheffer stroke operations [1], SSNMV-algebras [13], and t-norms [14], which are pivotal to our study. The Sheffer stroke, a universal logical operator, facilitates algebraic axiomatization [2], while SSNMV-algebras generalize non-associative MV-algebras by incorporating strong Sheffer properties [5]. Triangular norms (t-norms), which model fuzzy intersections, are central to our framework [8,14]. Key properties, such as associativity and boundary conditions, are discussed in Lemma 1 [15]. These tools provide the foundation for our definitions of T -fuzzy subalgebras and filters, effectively bridging algebraic and fuzzy set theories.
The objective of this study is to contribute to the theoretical advancement of fuzzy set theory by examining it through the lens of non-classical algebraic structures. Specifically, we aim to demonstrate how fuzzy sets behave within the strong Sheffer stroke NMV-algebra and how t -norms can refine logic and reasoning processes in fuzzy systems. This research opens new avenues for enhanced applications in fields where uncertainty and imprecision are prevalent, such as decision making, artificial intelligence, and fuzzy control systems.

2. Preliminaries

Definition 1
([1]). Let ( H , ) represent a groupoid. The operationis classified as a Sheffer stroke operation if it satisfies the following conditions:
  • (S1) ζ η = η ζ ,
  • (S2) ( ζ ζ ) ( ζ η ) = ζ ,
  • (S3) ζ ( ( η ϱ ) ( η ϱ ) ) = ( ( ζ η ) ( ζ η ) ) ϱ ,
  • (S4) ( ζ ( ( ζ ζ ) ( η η ) ) ) ( ζ ( ( ζ ζ ) ( η η ) ) ) = ζ ,
for all ζ , η , ϱ H .
Definition 2
([13]). A strong Sheffer stroke NMV-algebra (abbreviated SSNMV-algebra) refers to an algebraic structure ( L , , 1 ) of type ( 2 , 0 ) , which satisfies the following identities for all elements ζ , η , ϱ L :
  • (n1) ζ η = η ζ ,
  • (n2) ζ 0 = 1 ,
  • (n3) ( ζ 1 ) 1 = ζ ,
  • (n4) ( ( ζ 1 ) η ) η = ( ( η 1 ) ζ ) ζ ,
  • (n5) ( ζ 1 ) ( ( ζ η ) 1 ) = 1 ,
  • (n6) ζ ( ( ( ( ( ζ η ) η ) ϱ ) ϱ ) 1 ) = 1 ,
where 0 denotes the algebraic constant 1 1 .
Proposition 1
([13]). Let ( L , ) be an SSNMV-algebra. Then, the binary relation ζ η is defined if and only if ζ ( η 1 ) = 1 , and this relation constitutes a partial order on L.
Definition 3
([13]). A nonempty subset G of an SSNMV-algebra L is said to be an SSNMV-subalgebra of L if ζ ( η 1 ) G for all ζ , η G .
Definition 4
([13]). A nonempty subset G of an SSNMV-algebra L is termed an SSNMV-filter of L if, for all ζ , η G , the following conditions hold:
1. 
1 G ,
2. 
ζ ( η 1 ) G and ζ G η G .
Definition 5
([13]). Let ( P , | P , 1 P ) and ( S , | S , 1 S ) be SSNMV-algebras. A mapping f : P S is called a homomorphism if, for all ζ , η P , it satisfies the condition f ( ζ P η ) = f ( ζ ) S f ( η ) and f ( 1 P ) = 1 S .
Theorem 1
([13]). Let ( P , | P , 1 P ) and ( S , | S , 1 S ) be SSNMV-algebras. The product ( P × S , | P × S ) forms an SSNMV-algebra, where P × S denotes the Cartesian product of P and S , and the operation | P × S is defined by
( p 1 , s 1 ) | P × S ( p 2 , s 2 ) = ( p 1 | P p 2 , s 1 | S s 2 )
for all ( p 1 , s 1 ) , ( p 2 , s 2 ) P × S . The identity element in this algebra is ( 1 P , 1 S ) .
Definition 6
([14]). A triangular norm (abbreviated as t -norm) is a binary operation T on the unit interval [ 0 , 1 ] , meaning that T : [ 0 , 1 ] × [ 0 , 1 ] [ 0 , 1 ] is a function that satisfies the following properties:
1. 
Boundary condition: ( ζ [ 0 , 1 ] ) ( T ( ζ , 1 ) = ζ ) ,
2. 
Commutativity: ( ζ , η [ 0 , 1 ] ) ( T ( ζ , η ) = T ( η , ζ ) ) ,
3. 
Associativity: ( ζ , η , ϱ [ 0 , 1 ] ) ( T ( ζ , T ( η , ϱ ) ) = T ( T ( ζ , η ) , ϱ ) ) ,
4. 
Monotonicity: ( ζ , η , ϱ [ 0 , 1 ] ) ( η ϱ T ( ζ , η ) T ( ζ , ϱ ) ) .
Definition 7
([16]). Let T be a t -norm. The subset Δ T of [ 0 , 1 ] is defined as
Δ T = { ζ [ 0 , 1 ] : T ( ζ , ζ ) = ζ } .
A fuzzy set A on a nonempty set X is said to satisfy the imaginable property with respect to T if I m ( ξ A ) Δ T , which means that for all ζ X , we have
( ζ X ) ( T ( ξ A ( ζ ) , ξ A ( ζ ) ) = ξ A ( ζ ) ) ,
where I m ( ξ A ) = { ρ [ 0 , 1 ] : ζ X , ξ A ( ζ ) = ρ } .
Lemma 1
([15]). Let T be a t -norm. Then, the following properties are satisfied:
1. 
( ζ , η [ 0 , 1 ] ) ( T ( ζ , η ) ζ a n d T ( ζ , η ) η ) ),
2. 
( ζ [ 0 , 1 ] ) ( T ( ζ , 0 ) = 0 ) ,
3. 
( , , ζ , η [ 0 , 1 ] ) ( ζ , η T ( ζ , η ) T ( , ) ) ,
4. 
( , ζ , η [ 0 , 1 ] ) ( ζ , η T ( ζ , η ) ) .

3. Fuzzy Sets with Respect to a t-Norm in Strong Sheffer Stroke NMV-Algebras

In the following sections, let X denote an SSNMV-algebra and T represent a t -norm, unless otherwise stated. We will introduce the concepts of T -fuzzy subalgebras and T -fuzzy filters, and explore their properties.
Definition 8.
A fuzzy set A in X is called a
  • T -fuzzy subalgebra (briefly, T F S ) of X if
    ( ζ , η X ) ξ A ( ζ ( η 1 ) ) T ( ξ A ( ζ ) , ξ A ( η ) ) .
  • T -fuzzy filter (briefly, T F F ) of X if
    ( ζ X ) ξ A ( 1 ) ξ A ( ζ ) ,
    ( ζ , η X ) ξ A ( η ) T ξ A ( ζ ( η 1 ) ) , ξ A ( ζ ) .
Example 1.
Consider the following SSNMV-algebra in Table 1.
(i) Let T prod be the product t -norm defined by
( ζ , η [ 0 , 1 ] ) T prod ( ζ , η ) = ζ η .
Let A be a fuzzy set in X given by Table 2:
Then, it can be easily verified that the fuzzy set A is a T prod -fuzzy subalgebra of X.
(ii) Let T uk denote the Łukasiewicz t -norm, which is defined by
( ζ , η [ 0 , 1 ] ) ( T uk ( ζ , η ) = max { ζ + η 1 , 0 } ) .
Let A be a fuzzy set in X given by Table 3:
Then, it can be easily verified that the fuzzy set A is T uk -fuzzy subalgebra of X.
(iii) Let T prod represent the product t -norm defined by
( ζ , η [ 0 , 1 ] ) ( T prod ( ζ , η ) = ζ η ) .
Let A be a fuzzy set in X given by Table 4:
Then, it can be easily verified that the fuzzy set A is T prod -fuzzy filter of X.
(iv) Let T uk be the Łukasiewicz t -norm defined by
( ζ , η [ 0 , 1 ] ) ( T uk ( ζ , η ) = max { ζ + η 1 , 0 } ) .
Let A be a fuzzy set in X given by Table 5:
Then, it can be easily verified that the fuzzy set A is T uk -fuzzy filter of X.
Definition 9.
Let A be a fuzzy set in X. Define the subset I ξ A of X by
I ξ A = { ζ X : ξ A ( ζ ) = ξ A ( 1 ) } .
Since ξ A ( 1 ) = ξ A ( 1 ) , we have 1 I ξ A ( ).
Definition 10.
A T -fuzzy subalgebra (resp. T -fuzzy filter) A of X is referred to as an imaginable T -fuzzy subalgebra (resp. imaginable T -fuzzy filter) of X if A satisfies the imaginable property with respect to T .
Example 2.
Consider the SSNMV-algebra given in Example 1 of Table 1.
(i) Let T uk be the Łukasiewicz t -norm defined by
( ζ , η [ 0 , 1 ] ) ( T uk ( ζ , η ) = max { ζ + η 1 , 0 } ) .
Let A be a fuzzy set in X given by Table 6:
Then, it can be easily verified that the fuzzy set A is imaginable T uk -fuzzy subalgebra of X.
(ii) Let T uk be the Łukasiewicz t -norm defined by
( ζ , η [ 0 , 1 ] ) ( T uk ( ζ , η ) = max { ζ + η 1 , 0 } ) .
Let A be a fuzzy set in X given by Table 7:
Then, it can be easily verified that the fuzzy set A is imaginable T uk -fuzzy filter of X.
Proposition 2.
If A is an imaginable T F S of X, then ( ζ X ) ( ξ A ( 1 ) ξ A ( ζ ) ) .
Proof. 
Assume that A is an imaginable T F S of X. Let x X . Then, we have ξ A ( 1 ) = ξ A ( ζ ( 1 1 ) ) T ( ξ A ( ζ ) , ξ A ( ζ ) ) = ξ A ( ζ ) . □
Theorem 2.
Let μ be a T F S of X. If there is a sequence { ζ n } in X such that lim n T ( μ ( ζ n ) , μ ( ζ n ) ) = 1 , then μ ( 1 ) = 1 .
Proof. 
Let ζ X . Then, we have
μ ( 1 ) = μ ( ζ ( 1 1 ) ) T ( μ ( ζ ) , μ ( ζ ) ) .
Hence, for any n N , we have
μ ( 1 ) T ( μ ( ζ n ) , μ ( ζ n ) ) .
Since 1 μ ( 1 ) lim n T ( μ ( ζ n ) , μ ( ζ n ) ) = 1 , we conclude that
μ ( 1 ) = 1 .
Theorem 3.
If A is an imaginable T F S of X, then I ξ A is an SSNMV-subalgebra of X.
Proof. 
Assume that A is an imaginable T F S of X. Let ζ , η I ξ A . Then, we have ξ A ( ζ ) = ξ A ( 1 ) and ξ A ( η ) = ξ A ( 1 ) . Thus, we obtain the following inequality:
ξ A ( ζ ( η 1 ) ) T ( ξ A ( ζ ) , ξ A ( η ) ) = T ( ξ A ( 1 ) , ξ A ( 1 ) ) = ξ A ( 1 ) ξ A ( ζ ( η 1 ) ) .
Thus, we conclude that
ξ A ( ζ ( η 1 ) ) = ξ A ( 1 ) ,
which implies that ζ ( η 1 ) I ξ A . Therefore, I ξ A is an SSNMV-subalgebra of X. □
Theorem 4.
If A is a T F F of X with T ( ξ A ( 1 ) , ξ A ( 1 ) ) = ξ A ( 1 ) , then I ξ A is an SSNMV-filter of X.
Proof. 
Assume that A is a T F F of X with T ( ξ A ( 1 ) , ξ A ( 1 ) ) = ξ A ( 1 ) . By Definition 9, we know that 1 I ξ A . Let ζ , η X be such that ζ ( η 1 ) I ξ A and ζ I ξ A . Then, by the definition of I ξ A , we have ξ A ( ζ ( η 1 ) ) = ξ A ( 1 ) and ξ A ( ζ ) = ξ A ( 1 ) . Thus, we can write:
ξ A ( η ) T ( ξ A ( ζ ( η 1 ) ) , ξ A ( ζ ( η 1 ) ) ) = T ( ξ A ( 1 ) , ξ A ( 1 ) ) = ξ A ( 1 ) ξ A ( η ) .
Thus, we conclude that ξ A ( η ) = ξ A ( 1 ) , which implies that η I ξ A . Therefore, I ξ A is an SSNMV-filter of X. □
Let S be a nonempty subset of X, and let ν , ϑ [ 0 , 1 ] with ν > ϑ . The ( ν , ϑ ) -characteristic function χ S ( ν , ϑ ) of X is a function from X into { ν , ϑ } , defined as follows:
( ζ X ) χ S ( ν , ϑ ) ( ζ ) = ν if ζ S , ϑ if ζ S .
By this definition, the ( ν , ϑ ) -characteristic function χ S ( ν , ϑ ) maps elements of X into { ν , ϑ } [ 0 , 1 ] . The fuzzy set A S ( ν , ϑ ) in X, associated with χ S ( ν , ϑ ) , is called the ( ν , ϑ ) -characteristic fuzzy set of S in X.
Lemma 2.
Let S be a nonempty subset of X. Then, the following statements hold:
1. 
If the constant 1 of X belongs to S, then for all ζ X , we have χ S ( ν , ϑ ) ( 1 ) χ S ( ν , ϑ ) ( ζ ) .
2. 
If there exists an element ζ S such that χ S ( ν , ϑ ) ( 1 ) χ S ( ν , ϑ ) ( ζ ) , then the constant 1 of X must be an element of S.
Proof. 
(1) If 1 S , then χ S ( ν , ϑ ) ( 1 ) = ν χ S ( ν , ϑ ) ( ζ ) for all ζ X .
(2) Assume that there exists an element ζ S such that χ S ( ν , ϑ ) ( 1 ) χ S ( ν , ϑ ) ( ζ ) . Then, χ S ( ν , ϑ ) ( 1 ) ν , so it follows that χ S ( ν , ϑ ) ( 1 ) = ν . Hence, the constant element 1 S . □
Theorem 5.
If S is an SSNMV-subalgebra of X, then χ S ( ν , ϑ ) is a T F S of X.
Proof. 
Assume that S is an SSNMV-subalgebra of X.
Case 1: Let ζ , η S . Then, χ S ( ν , ϑ ) ( ζ ) = ν = χ S ( ν , ϑ ) ( η ) . Since S is a subalgebra of X, we have ζ | ( η | 1 ) S , and consequently, χ S ( ν , ϑ ) ( ζ ( η 1 ) ) = ν . By Lemma 1 (1), we obtain
T ( χ S ( ν , ϑ ) ( ζ ) , χ S ( ν , ϑ ) ( η ) ) = T ( ν , ν ) ν = χ S ( ν , ϑ ) ( ζ ( η 1 ) ) .
Case 2: Let ζ S or η S . In this case, either χ S ( ν , ϑ ) ( ζ ) = ϑ or χ S ( ν , ϑ ) ( η ) = ϑ . By Lemma 1 (1), we have
T ( χ S ( ν , ϑ ) ( ζ ) , χ S ( ν , ϑ ) ( η ) ) ϑ χ S ( ν , ϑ ) ( ζ ( η 1 ) ) .
Therefore, χ S ( ν , ϑ ) is a T F S of X. □
Theorem 6.
Let S be a nonempty subset of X such that χ S ( ν , ϑ ) is a T F S of X and satisfies T ( ν , ν ) = ν . Then, S is an SSNMV-subalgebra of X.
Proof. 
Assume that S is a nonempty subset of X such that χ S ( ν , ϑ ) is a T F S of X with T ( ν , ν ) = ν . Let ζ , η S . Then, by the definition of the characteristic function, we have
χ S ( ν , ϑ ) ( ζ ) = ν = χ S ( ν , ϑ ) ( η ) .
By the properties of the T F S , specifically using (1), we obtain the following:
χ S ( ν , ϑ ) ( ζ ( η 1 ) ) T ( χ S ( ν , ϑ ) ( ζ ) , χ S ( ν , ϑ ) ( η ) ) = T ( ν , ν ) = ν χ S ( ν , ϑ ) ( ζ ( η 1 ) ) .
Therefore, we conclude that
χ S ( ν , ϑ ) ( ζ ( η 1 ) ) = ν ,
which implies that ζ ( η 1 ) S . Hence, S is an SSNMV-subalgebra of X. □
If T ( ν , ν ) ν , then Theorem 6 is not applicable, as demonstrated by the following example.
Example 3.
Consider the SSNMV-algebra defined in Example 1 of Table 1. Let S = { 0 , d } , and define a fuzzy set χ S ( 0.7 , 0.5 ) in X as given by the table in Table 8:
Let T Luk be the Łukasiewicz t -norm, defined as
( ζ , η [ 0 , 1 ] ) ( T Luk ( ζ , η ) = max { ζ + η 1 , 0 } ) .
Then, χ S ( 0.7 , 0.5 ) is a T Luk -fuzzy subalgebra of X. However, we observe that
T Luk ( 0.7 , 0.7 ) = 0.4 0.7 .
Therefore, the condition T Luk ( 0.7 , 0.7 ) = 0.7 does not hold, and Theorem 6 cannot be applied. Additionally, S is not an SSNMV-subalgebra of X because 0 , d S , but we have
0 ( d 1 ) = 0 c = 1 S .
Corollary 1.
A nonempty subset S of X is an SSNMV-subalgebra of X if and only if χ S ( 1 , ϑ ) is a T F S of X.
Proof. 
The result follows directly from Theorems 5 and 6. □
Theorem 7.
Let P be an SSNMV-subalgebra of X and A be a fuzzy set in X defined by
ξ A ( ζ ) = ν i f ζ P θ o t h e r w i s e
for all ν , θ [ 0 , 1 ] with ν θ . Then, A is a T m -FS of X, where T m is the t -norm defined by
( ζ , η [ 0 , 1 ] ) ( T m ( ζ , η ) = max { ζ + η 1 , 0 } ) .
In particular, if ν = 1 and θ = 0 , then A is an imaginable T m -fuzzy subalgebra of X. Moreover, I ξ A = P .
Proof. 
Let ζ , η X . We consider three cases:
  • Case i: If ζ , η P , then
    T m ( ξ A ( ζ ) , ξ A ( η ) ) = T m ( ν , ν ) = max ( 2 ν 1 , 0 ) = 2 ν 1 if ν 1 2 0 o t h e r w i s e ν = ξ A ( ζ ( η 1 ) ) .
  • Case ii: If ζ P and η P (or, ζ P and η P ), then
    T m ( ξ A ( ζ ) , ξ A ( η ) ) = T m ( ν , θ ) = max ( ν + θ 1 , 0 ) = ν + θ 1 if ν + θ 1 0 o t h e r w i s e θ = ξ A ( ζ ( η 1 ) ) .
  • Case iii: If ζ , η P , then
    T m ( ξ A ( ζ ) , ξ A ( η ) ) = T m ( θ , θ ) = max ( 2 θ 1 , 0 ) = 2 θ 1 if θ 1 2 0 o t h e r w i s e θ = ξ A ( ζ ( η 1 ) ) .
Hence, A is a T m -fuzzy subalgebra of X.
Assume that ν = 1 and θ = 0 . Then,
T m ( ν , ν ) = max ( ν + ν 1 , 0 ) = 1 = ν ,
and
T m ( θ , θ ) = max ( θ + θ 1 , 0 ) = 0 = θ .
Thus, ν , θ Δ T m , that is, I m ( ξ A ) Δ T m . Therefore, A is an imaginable T m -fuzzy subalgebra of X. Also,
I ξ A = { ζ X ξ A ( ζ ) = ξ A ( 1 ) } = { ζ X ξ A ( ζ ) = 1 } = P .
Hence, I ξ A = P . □
Theorem 8.
If S is an SSNMV-filter of X, then χ S ( ν , ϑ ) is a T F F of X.
Proof. 
Assume that S is an SSNMV-filter of X. Since 1 S , it follows from Lemma 2 (1) that χ S ( ν , ϑ ) ( 1 ) χ S ( ν , ϑ ) ( ζ ) for all ζ X . Next, let ζ , η X .
Case 1: If ζ ( η 1 ) S and ζ S , then
χ S ( ν , ϑ ) ( ζ ( η 1 ) ) = ν and χ S ( ν , ϑ ) ( ζ ) = ν .
Since S is an SSNMV-filter of X, we have η S and thus χ S ( ν , ϑ ) ( η ) = ν . By Lemma 1 (1), we have
T ( χ S ( ν , ϑ ) ( ζ ( η 1 ) ) , χ S ( ν , ϑ ) ( ζ ) ) = T ( ν , ν ) ν = χ S ( ν , ϑ ) ( η ) .
Case 2: If ζ ( η 1 ) S or ζ S , then
χ S ( ν , ϑ ) ( ζ ( η 1 ) ) = ϑ or χ S ( ν , ϑ ) ( ζ ) = ϑ .
By Lemma 1 (1), we have
T ( χ S ( ν , ϑ ) ( ζ ( η 1 ) ) , χ S ( ν , ϑ ) ( ζ ) ) ϑ χ S ( ν , ϑ ) ( η ) .
Therefore, χ S ( ν , ϑ ) is a T F F of X. □
Theorem 9.
If S is a nonempty subset of X such that χ S ( ν , ϑ ) is a T F F of X with T ( ν , ν ) = ν , then S is an SSNMV-filter of X.
Proof. 
Assume that S is a nonempty subset of X such that χ S ( ν , ϑ ) is a T F F of X with T ( ν , ν ) = ν . Then, by Lemma 2 (2), we have χ S ( ν , ϑ ) ( 1 ) χ S ( ν , ϑ ) ( ζ ) for all ζ X , which implies that 1 S .
Let ζ , η X be such that ζ ( η 1 ) S and ζ S . Then, we have
χ S ( ν , ϑ ) ( ζ ( η 1 ) ) = ν = χ S ( ν , ϑ ) ( ζ ) .
By Equation (3), we obtain
χ S ( ν , ϑ ) ( η ) T ( χ S ( ν , ϑ ) ( ζ ( η 1 ) ) , χ S ( ν , ϑ ) ( ζ ) ) = T ( ν , ν ) = ν χ S ( ν , ϑ ) ( η ) .
Therefore, χ S ( ν , ϑ ) ( η ) = ν , which implies that η S . Hence, S is an SSNMV-filter of X. □
If T ( ν , ν ) ν , then Theorem 9 is not applicable, as demonstrated in the following example:
Example 4.
Consider the SSNMV-algebra given in Example 1 of Table 1. Let S = { 1 , c , d , f } . Define a fuzzy set χ S ( 0.7 , 0.6 ) in X by the table in Table 9:
Let T uk be the Lukasiewicz t -norm defined by
( ζ , η [ 0 , 1 ] ) T uk ( ζ , η ) = max { ζ + η 1 , 0 } .
Then, χ S ( 0.7 , 0.6 ) is a T uk -fuzzy filter of X. However, T uk ( 0.7 , 0.7 ) = 0.4 0.7 . Furthermore, S is not an SSNMV-filter of X, since c ( b 1 ) = c a = 1 S , but b S while c S .
Corollary 2.
A nonempty subset S of X is an SSNMV-filter of X if and only if χ S ( 1 , ϑ ) is a T F F of X.
Proof. 
The result follows immediately from Theorems 8 and 9. □

4. Level Subsets of a Fuzzy Set with Respect to a t -Norm

Fuzzy sets have become a fundamental concept in various fields, and the analysis of their level subsets plays a crucial role in understanding their properties and applications. This section specifically focuses on the level subsets of a fuzzy set with respect to a t -norm, a mathematical framework that enables a more nuanced analysis of fuzzy relations and operations.
Definition 11.
Let A be a fuzzy set in a nonempty set X. For any s [ 0 , 1 ] , we define the following sets:
U ( A , s ) = { ζ X : ξ A ( ζ ) s } , L ( A , s ) = { ζ X : ξ A ( ζ ) s } , E ( A , s ) = { ζ X : ξ A ( ζ ) = s } .
These sets are referred to as the upper s -level subset, lower s -level subset, and equal s -level subset of A, respectively. For a fuzzy set A in X, it follows that U ( A , 1 ) = E ( A , 1 ) , L ( A , 1 ) = E ( A , 1 ) , and U ( A , 1 ) = L ( A , 1 ) = X .
Lemma 3.
Let A be a fuzzy set in X. The following statements hold:
1. 
If the constant element 1 of X belongs to E ( A , 1 ) , then ξ A ( 1 ) ξ A ( ζ ) for all ζ X .
2. 
For any s [ 0 , 1 ] , if there exists an element ζ U ( A , s ) such that ξ A ( 1 ) ξ A ( ζ ) , then the constant element 1 of X is in U ( A , s ) .
Proof. 
(1) If 1 E ( A , 1 ) , then ξ A ( 1 ) = 1 ξ A ( ζ ) for all ζ X .
(2) Suppose that ξ A ( 1 ) ξ A ( ζ ) for some ζ U ( A , s ) . Since ζ U ( A , s ) , it follows that ξ A ( ζ ) s . Therefore, we have ξ A ( 1 ) ξ A ( ζ ) s , which implies that 1 U ( A , s ) . □
Theorem 10.
If A is a T F S of X, then for every s [ 0 , 1 ] such that T ( s , s ) = s , the set U ( A , s ) is an SSNMV-subalgebra of X whenever it is nonempty. In particular, E ( A , 1 ) is an SSNMV-subalgebra of X if E ( A , 1 ) is nonempty.
Proof. 
Let A be a T F S of X. Consider any s [ 0 , 1 ] such that T ( s , s ) = s , and assume that U ( A , s ) . Let ζ , η U ( A , s ) . Then, by definition, we have ξ A ( ζ ) s and ξ A ( η ) s . Therefore,
ξ A ( ζ ( η 1 ) ) T ( ξ A ( ζ ) , ξ A ( η ) ) T ( s , s ) = s .
Hence, ζ ( η 1 ) U ( A , s ) , implying that U ( A , s ) is an SSNMV-subalgebra of X. □
Theorem 11.
If a fuzzy set A in X is such that for every s [ 0 , 1 ] , the set U ( A , s ) is an SSNMV-subalgebra of X whenever it is nonempty, then A is a T F S of X.
Proof. 
Suppose that for each s [ 0 , 1 ] , the set U ( A , s ) is an SSNMV-subalgebra of X whenever it is nonempty. We aim to show that A is a T F S of X.
Assume, for the sake of contradiction, that there exist ζ , η X such that
ξ A ( ζ ( η 1 ) ) < T ( ξ A ( ζ ) , ξ A ( η ) ) .
Define
s 0 = 1 2 ξ A ( ζ ( η 1 ) ) + T ( ξ A ( ζ ) , ξ A ( η ) ) .
Then, s 0 [ 0 , 1 ] , and we have the inequalities
ξ A ( ζ ( η 1 ) ) < s 0 < T ( ξ A ( ζ ) , ξ A ( η ) ) .
This implies that ζ ( η 1 ) U ( A , s 0 ) .
By Lemma 3 (1), since ξ A ( ζ ( η 1 ) ) < s 0 , we know that if ζ , η U ( A , s 0 ) , then U ( A , s 0 ) is nonempty.
Hence, the assumption that ζ , η U ( A , s 0 ) leads to a contradiction, as it implies that U ( A , s 0 ) cannot be an SSNMV-subalgebra of X, contradicting our assumption that all nonempty U ( A , s ) are SSNMV-subalgebras.
Therefore, we conclude that ξ A ( ζ ( η 1 ) ) T ( ξ A ( ζ ) , ξ A ( η ) ) for all ζ , η X , which implies that A is a T F S of X. □
The converse of Theorem 11 need not be true, as demonstrated in the following example.
Example 5.
Consider the SSNMV-algebra given in Example 1 of Table 1. Let T uk be the Łukasiewicz t -norm, defined by
ζ , η [ 0 , 1 ] , T uk ( ζ , η ) = max { ζ + η 1 , 0 } .
Let A be a fuzzy set in X, as specified in Table 10:
The fuzzy set A is a T uk -fuzzy subalgebra of X. Let s = 0.7 . Then, the upper level subset is
U ( A , 0.7 ) = { 0 , d , f } .
However, U ( A , 0.7 ) is not an SSNMV-subalgebra of X. This is because, while 0 , d U ( A , 0.7 ) , we have the following:
0 ( d 1 ) = 0 c = 1 U ( A , 0.7 ) .
Therefore, the set U ( A , 0.7 ) is not closed under the operations required for it to be an SSNMV-subalgebra of X, thereby illustrating that the converse of Theorem 11 does not hold in this case.
Theorem 12.
Let A be a T F F of X. For every s [ 0 , 1 ] such that T ( s , s ) = s , the set U ( A , s ) is an SSNMV-filter of X whenever it is nonempty. In particular, if U ( A , 1 ) is nonempty, then E ( A , 1 ) is an SSNMV-filter of X.
Proof. 
Assume that A is a T F F of X. Let s [ 0 , 1 ] such that T ( s , s ) = s , and suppose that U ( A , s ) . Since A is a T F F of X, we know that ξ A ( 1 ) ξ A ( ζ ) for all ζ X . By Lemma 3 (2), we conclude that 1 U ( A , s ) .
Next, let ζ , η X be such that ζ ( η 1 ) U ( A , s ) and ζ U ( A , s ) . From the assumption, we know that
ξ A ( ζ ( η 1 ) ) s and ξ A ( ζ ) s .
By the property of the t -norm, we have
ξ A ( η ) T ( ξ A ( ζ ( η 1 ) ) , ξ A ( ζ ) ) T ( s , s ) = s .
Therefore, η U ( A , s ) , which shows that U ( A , s ) is an SSNMV-filter of X. □
Theorem 13.
Let A be a fuzzy set in X. If for all s [ 0 , 1 ] , the set U ( A , s ) is an SSNMV-filter of X whenever it is nonempty, then A is a T F F of X.
Proof. 
Assume that for every s [ 0 , 1 ] , the set U ( A , s ) is an SSNMV-filter of X whenever it is nonempty. For any ζ X , let ξ A ( ζ ) = s . Then, ζ U ( A , s ) . By assumption, U ( A , s ) is an SSNMV-filter of X, so 1 U ( A , s ) . This implies that ξ A ( 1 ) s = ξ A ( ζ ) .
Now, assume that there exist a , b X such that
ξ A ( b ) < T ( ξ A ( a ( b 1 ) ) , ξ A ( a ) ) .
Define
s 0 = 1 2 ξ A ( b ) + T ( ξ A ( a ( b 1 ) ) , ξ A ( a ) ) .
Thus, s 0 [ 0 , 1 ] and we have
ξ A ( b ) < s 0 < T ( ξ A ( a ( b 1 ) ) , ξ A ( a ) ) .
This implies that b U ( A , s 0 ) . By Lemma 3 (1), we know that a ( b 1 ) , a U ( A , s 0 ) . Therefore, U ( A , s 0 ) cannot be an SSNMV-filter of X, which leads to a contradiction, since U ( A , s 0 ) was assumed to be an SSNMV-filter of X. Hence, we conclude that
ξ A ( η ) T ( ξ A ( ζ ( η 1 ) ) , ξ A ( ζ ) )
for all ζ , η X . Therefore, A is a T F F of X. □
The converse of Theorem 13 need not be true, as shown in the following example.
Example 6.
Consider the SSNMV-algebra given in Example 1 of Table 1. Let T uk be the Łukasiewicz t -norm defined by
( ζ , η [ 0 , 1 ] ) T uk ( ζ , η ) = max { ζ + η 1 , 0 } .
Let A be a fuzzy set in X given by the Table 11:
Then, the fuzzy set A is a T uk -fuzzy filter of X. If s = 0.7 , then U ( A , 0.7 ) = { 1 , c , f } . However, U ( A , 0.7 ) is not an SSNMV-filter of X since
c ( b 1 ) = c a = 1 U ( A , 0.7 ) ,
and
c U ( A , 0.7 ) b u t b U ( A , 0.7 ) .
Definition 12.
Let f : X Y be a function, where X and Y are nonempty sets. If B is a fuzzy set in Y, the inverse image of B under f is a fuzzy set in X, denoted by f 1 ( B ) . This fuzzy set is defined as follows:
ζ X , ξ f 1 ( B ) ( ζ ) = ξ B ( f ( ζ ) ) ,
where ξ B denotes the membership function of the fuzzy set B in Y.
Definition 13.
Let ( X , X , 1 X ) and ( Y , Y , 1 Y ) be SSNMV-algebras. A mapping f : X Y is called a homomorphism if
( ζ , η X ) ( f ( ζ X η ) = f ( ζ ) Y f ( η ) ) .
A homomorphism f : X Y is called an epimorphism if f is surjective.
In the following, let f represent a homomorphism from an SSNMV-algebra ( X , | X , 1 X ) to an SSNMV-algebra ( Y , | Y , 1 Y ) , unless stated otherwise. It is important to note that for every ζ X , the condition f ( 1 X ) f ( ζ ) holds.
Theorem 14.
Let f : ( X , X , 1 X ) ( Y , Y , 1 Y ) be a surjective homomorphism between SSNMV-algebras. If B is a T - F S in Y, then the inverse image of B under f , denoted by f 1 ( B ) , is a T F S in X.
Proof. 
Let f : ( X , X , 1 X ) ( Y , Y , 1 Y ) be a surjective homomorphism, and assume that B is a T F S in Y. For any ζ , η X , we observe the following:
ξ f 1 ( B ) ( ζ X ( η X 1 ) ) = ξ B ( f ( ζ X ( η X 1 ) ) ) = ξ B ( f ( ζ ) Y ( f ( η ) Y f ( 1 ) ) ) T ( ξ B ( f ( x ) ) , ξ B ( f ( η ) ) ) = T ( ξ f 1 ( B ) ( ζ ) , ξ f 1 ( B ) ( η ) ) .
Thus, f 1 ( B ) is a T F S in X. □
Theorem 15.
Let f : ( X , X , 1 X ) ( Y , Y , 1 Y ) be a surjective homomorphism between SSNMV-algebras. If B is a T F F in Y such that the mapping ξ B is order-preserving, then f 1 ( B ) is a T F F in X.
Proof. 
Let f : ( X , X , 1 X ) ( Y , Y , 1 Y ) be a surjective homomorphism, and suppose that B is a T F F in Y with ξ B being an order-preserving mapping. For every ζ X , we have
ξ f 1 ( B ) ( 1 X ) = ξ B ( f ( 1 X ) ) ξ B ( f ( ζ ) ) = ξ f 1 ( B ) ( ζ ) .
Now, for any ζ , η X , we observe
ξ f 1 ( B ) ( η ) = ξ B ( f ( η ) ) T ξ B ( f ( ζ X ( η X 1 ) ) ) , ξ B ( f ( ζ ) ) = T ξ f 1 ( B ) ( ζ X ( η X 1 ) ) , ξ f 1 ( B ) ( ζ ) .
Thus, f 1 ( B ) is a T F F in X. □
Definition 14
([17]). Let X and Y be nonempty sets, and let f : X Y be a function. A fuzzy set A in X is said to be invariant under f if the following condition holds for all ζ , η X :
ζ , η X , f ( ζ ) = f ( η ) ξ A ( ζ ) = ξ A ( η ) .
Definition 15.
Let f be a function from a nonempty set X to a nonempty set Y. For a fuzzy set A in X, the image of A under f , denoted f ( A ) , is a fuzzy set in Y defined as follows:
η Y , ξ f ( A ) ( η ) = sup ζ f 1 ( η ) { ξ A ( ζ ) } i f f 1 ( η ) , 0 i f f 1 ( η ) = .
Definition 16
([18]). A fuzzy set A in X has the sup property if for any nonempty subset S of X, there exists s 0 S such that
ξ A ( s 0 ) = sup s S { ξ A ( s ) } .
Lemma 4
([19]). Assume that f is surjective. Let A be a f -invariant fuzzy set in X with the sup property. For any ζ , η Y , there exist ζ 0 f 1 ( ζ ) and η 0 f 1 ( η ) such that ξ f ( A ) ( ζ ) = ξ A ( ζ 0 ) and ξ f ( A ) ( η ) = ξ A ( η 0 ) .
Theorem 16.
Let f be a surjective function. If A is a T F S in X that is invariant under f and satisfies the sup property, then the image of A under f , denoted by f ( A ) , in Y is also a T F S .
Proof. 
Let A be a f -invariant T F S in X that satisfies the sup property. Consider ζ , η Y . Since f is surjective, the inverse images f 1 ( ζ ) and f 1 ( η ) are nonempty subsets of X. By Lemma 4, there exist elements ζ 0 f 1 ( ζ ) and η 0 f 1 ( η ) such that ξ f ( A ) ( ζ ) = ξ A ( ζ 0 ) and ξ f ( A ) ( η ) = ξ A ( η 0 ) . Thus,
ξ f ( A ) ( ζ Y ( η Y 1 Y ) ) = ξ A ( ζ 0 X ( η 0 X 1 X ) ) T ( ξ A ( ζ 0 ) , ξ A ( η 0 ) ) = T ( ξ f ( A ) ( ζ ) , ξ f ( A ) ( η ) ) .
Hence, f ( A ) is a T F S in Y. □
Theorem 17.
Let f be a surjective function. If A is a T F F in X that is f -invariant and possesses the sup property, then the image of A under f , denoted f ( A ) , is a T F F in Y.
Proof. 
Let A be a f -invariant T F F in X that satisfies the sup property. Since A is a T F F , it follows that ξ A ( 1 X ) ξ A ( ζ ) for every ζ X . Given that f ( 1 X ) = 1 Y , we know that 1 X f 1 ( 1 Y ) , implying that f 1 ( 1 Y ) is nonempty. Therefore, we have
ξ A ( 1 X ) sup t f 1 ( 1 Y ) { ξ A ( t ) } = ξ f ( A ) ( 1 Y ) .
Thus, we obtain
ξ f ( A ) ( 1 Y ) ξ f ( A ) ( η ) .
Next, for ζ , η Y , by Lemma 4, there exist ζ f 1 ( ζ ) and η f 1 ( η ) such that ξ f ( A ) ( ζ ) = ξ A ( ζ ) and ξ f ( A ) ( η ) = ξ A ( η ) . Thus, we have
ξ f ( A ) ( η ) = ξ A ( η ) T ξ A ( ζ X ( η X 1 X ) ) , ξ A ( ζ ) = T ξ f ( A ) ( ζ Y ( η Y 1 Y ) ) , ξ f ( A ) ( ζ ) .
Hence, f ( A ) is a T F F in Y. □
Definition 17
([20]). Let A be a nonempty collection of fuzzy sets in a non-empty set X. The intersection of the family A in X is defined by the membership function ξ A as follows:
ζ X , ξ A ( ζ ) = inf { ξ A ( ζ ) A A } .
Similarly, the union of the family A in X is defined by its membership function ξ A as follows:
ζ X , ξ A ( ζ ) = sup { ξ A ( ζ ) A A } .
Theorem 18.
Let A be a nonempty collection of T -fuzzy subalgebras of X. Then, the intersection A is also a T F S of X.
Proof. 
Let ζ , η X . For each A A , we know that
ξ A ( ζ ( η 1 ) ) T ( ξ A ( ζ ) , ξ A ( η ) ) .
Since for each A A , the infimum of the membership functions satisfies
inf { ξ A ( ζ ) } ξ A ( ζ ) and inf { ξ A ( η ) } ξ A ( η ) ,
applying Lemma 1 (3) yields
T inf { ξ A ( ζ ) } A A , inf { ξ A ( η ) } A A T ( ξ A ( ζ ) , ξ A ( η ) ) ξ A ( ζ ( η 1 ) ) ,
for all A A . Therefore, we obtain the following inequality:
T ( ξ A ( ζ ) , ξ A ( η ) ) = T inf { ξ A ( ζ ) } A A , inf { ξ A ( η ) } A A inf { ξ A ( ζ ( η 1 ) ) } A A = ξ A ( ζ ( η 1 ) ) .
Thus, we conclude that A is a T F S of X. □
Theorem 19.
Let A = { ( ζ , ξ A ( ζ ) ) : ζ X } and B = { ( η , ξ B ( η ) ) : η Y } be T -fuzzy subalgebras of the sets X and Y, respectively. Then, the Cartesian product
A × B = { ( ( ζ , η ) , ξ A × B ( ζ , η ) ) : ( ζ , η ) X × Y } ,
where the membership function ξ A × B is defined as
ξ A × B ( ζ , η ) = T ( ξ A ( ζ ) , ξ B ( η ) ) ,
for all ( ζ , η ) X × Y is a T F S of X × Y .
Proof. 
Let ( ζ 1 , η 1 ) , ( ζ 2 , η 2 ) X × Y . Then,
ξ A × B ( ( ζ 1 , η 1 ) A × B ( ( ζ 2 , η 2 ) A × B ( 1 , 1 ) ) ) = ξ A × B ( ζ 1 A ( ζ 2 A 1 ) , η 1 B ( η 2 B 1 ) ) ) = T ( ξ A ( ζ 1 A ( ζ 2 A 1 ) , ξ B ( η 1 B ( η 2 B 1 ) ) ) ) T ( T ( ξ A ( ζ 1 ) , ξ A ( ζ 2 ) ) , T ( ξ B ( η 1 ) , ξ B ( η 2 ) ) ) = T k ( T ( ξ A ( ζ 1 ) , ξ B ( η 1 ) ) , T ( ξ A ( ζ 2 ) , ξ B ( η 2 ) ) ) = T ( ξ A × B ( ζ 1 , η 1 ) , ξ A × B ( ζ 2 , η 2 ) ) .
Hence, A × B is a T F S of X × Y . □
Theorem 20.
Let A = { ( ζ , ξ A ( ζ ) ) : ζ X } and B = { ( η , ξ B ( η ) ) : η Y } be T -fuzzy filters of the sets X and Y, respectively. Then, the product
A × B = { ( ( ζ , η ) , ξ A × B ( ζ , η ) ) : ( ζ , η ) X × Y }
is a T F F of X × Y , where the membership function ξ A × B ( ζ , η ) is given by
ξ A × B ( ζ , η ) = T ( ξ A ( ζ ) , ξ B ( η ) ) ,
for every pair ( ζ , η ) X × Y .
Proof. 
Let ( ζ , η ) X × Y . Then,
ξ A × B ( 1 , 1 ) = T ( ξ A ( 1 ) , ξ B ( 1 ) ) T ( ξ A ( ζ ) , ξ B ( η ) ) = ξ A × B ( ζ , η ) .
Let ( ζ 1 , η 1 ) , ( ζ 2 , η 2 ) X × Y . Then,
ξ A × B ( ζ 2 , η 2 )
= T ( ξ A ( ζ 2 ) , ξ B ( η 2 ) ) T ( T ( ξ A ( ζ 1 ) , ξ A ( ζ 1 ( ζ 2 1 ) ) ) , T ( ξ B ( η 1 ) , ξ B ( η 1 ( η 2 1 ) ) ) ) = T ( T ( ξ A ( ζ 1 ) , ξ B ( η 1 ) ) , T ( ξ A 1 ( ζ 1 ( ζ 2 1 ) ) , ξ A 2 ( η 1 ( η 2 1 ) ) ) ) = T ( ξ A × B ( ζ 1 , η 1 ) , ξ A × B ( ( ζ 1 , η 1 ) A × B ( ( ζ 2 , η 2 ) A × B ( 1 , 1 ) ) ) ) .
Hence, A × B is a T F F of X × Y . □
Theorem 21.
Consider a descending chain of SSNMV-filters S 1 S 2 S 3 on X that eventually terminates after a finite number of steps. Let A be a T F F on X. If the sequence of values in the image of ξ A is strictly increasing, then A must be finite-valued.
Proof. 
Assume, for the sake of contradiction, that A is infinite-valued. Let { ϑ n } denote a strictly increasing sequence of values from the image of ξ A , such that 0 ϑ 1 < ϑ 2 < < 1 . Consider the SSNMV-filter U ( ξ A : ψ T ) on X for each T = 1 , 2 , 3 , .
If ζ U ( ξ A : ϑ T ) for T = 2 , 3 , , it follows that ξ A ( ζ ) ϑ T > ϑ T 1 , which implies that ζ U ( ξ A : ϑ T 1 ) . Thus, we obtain the inclusion
U ( ξ A : ϑ T ) U ( ξ A : ϑ T 1 ) for T = 2 , 3 , .
Since ϑ T 1 is in the image of ξ A , there exists some ζ T 1 such that ξ A ( ζ T 1 ) = ϑ T 1 . Therefore, ζ T 1 U ( ξ A : ϑ T 1 ) , but ζ T 1 U ( ξ A : ϑ T ) . This implies the strict inclusion:
U ( ξ A : ϑ T ) U ( ξ A : ϑ T 1 ) for T = 2 , 3 , .
Consequently, we obtain a strictly descending chain of SSNMV-filters on X:
U ( ξ A : ϑ 1 ) U ( ξ A : ϑ 2 ) ,
which does not terminate. This is a contradiction to the assumption that the chain eventually terminates. Therefore, A must be finite-valued. □
Theorem 22.
If every T F F on X has a finite image, then any descending sequence of SSNMV-filters of X must eventually terminate after a finite number of steps.
Proof. 
Assume that there exists an infinite strictly descending chain of SSNMV-filters on X:
S 0 S 1 S 2 ,
which does not terminate after a finite number of steps. Now, define a fuzzy set ξ A on X as follows:
ξ A ( ζ ) = n n + 1 if ζ S n S n + 1 , 1 if ζ n = 0 S n ,
where n = 0 , 1 , 2 , , and S 0 = X . This construction defines ξ A as a fuzzy set on X where the membership values decrease as the SSNMV-filters decrease in the sequence.
Now, assume that ζ , η X . Suppose that ζ ( η 1 ) S n S n + 1 for some n { 0 , 1 , 2 , } and ζ S k S k + 1 for some k { 0 , 1 , 2 , } , with n k without loss of generality.
Clearly, since ζ ( η 1 ) S n , we have η S n because S n is an SSNMV-filter. Hence, we have:
ξ A ( η ) n n + 1 = T ( ξ A ( ζ ( η 1 ) ) , ξ A ( ζ ) ) .
If ζ ( η 1 ) n = 0 S n , then η n = 0 S n , and thus,
ξ A ( η ) = 1 = T ( ξ A ( ζ ( η 1 ) ) , ξ A ( ζ ) ) .
If ζ ( η 1 ) n = 0 S n but ζ n = 0 S n , there exists an integer r such that ζ ( η 1 ) S r S r + 1 . This implies that η S r , and therefore,
ξ A ( η ) r r + 1 = T ( ξ A ( ζ ( η 1 ) ) , ξ A ( ζ ) ) .
Lastly, if ζ ( η 1 ) n = 0 S n but ζ n = 0 S n , there exists an integer s such that η S s S s + 1 , leading to:
ξ A ( η ) s s + 1 = T ( ξ A ( ζ ( η 1 ) ) , ξ A ( ζ ) ) .
Therefore, we conclude that A is a T F F with an infinite number of distinct values, which contradicts the assumption that every T F F on X has a finite image. Hence, the assumption of an infinite strictly descending chain of SSNMV-filters must be incorrect, and the chain must eventually terminate after a finite number of steps. □
Theorem 23.
Let T be a t -norm defined on I, and let μ be a fuzzy set in an SSNMV-algebra X with the image of μ given by I m ( μ ) = { ξ 1 , ξ 2 , , ξ n } , where ξ i < ξ j for i > j . Assume that there exists a chain of SSNMV-subalgebras of X:
G 0 G 1 G n = X ,
such that for each k , μ ( G k ¯ ) = ξ k , where G k ¯ = G k G k 1 and G 1 = . Then, μ is a T F S on X.
Proof. 
Let ζ , η X . If both ζ and η are elements of the same G k ¯ , then we have μ ( ζ ) = μ ( η ) = ξ k and ζ ( η 1 ) G k . This leads to
μ ( ζ ( η 1 ) ) ξ k = min { μ ( ζ ) , μ ( η ) } T ( μ ( ζ ) , μ ( η ) ) .
Now, suppose that ζ G i ¯ and η G j ¯ for some i j . Without loss of generality, assume that i > j . In this case, μ ( ζ ) = ξ i and μ ( η ) = ξ j , where ξ i < ξ j . Since ζ ( η 1 ) G i , we have
μ ( ζ ( η 1 ) ) ξ i = min { μ ( ζ ) , μ ( η ) } T ( μ ( ζ ) , μ ( η ) ) .
Thus, we conclude that μ is a T F S on X. □

5. Conclusions

In this paper, we explore the concept of fuzzy sets in the context of triangular norms, specifically applied to strong Sheffer stroke NMV-algebras. We introduce the notions of T -fuzzy subalgebras and T -fuzzy filters, and investigate their properties, providing several illustrative examples. Additionally, we examine the relationships between T -fuzzy subalgebras (filters) and their classical counterparts, as well as their level subsets and homomorphisms.
The results presented contribute to a deeper understanding of fuzzy structures within NMV-algebras and their potential applications. The interplay between fuzzy subalgebras, filters, and classical counterparts opens new avenues for further research.
Theoretical Implications: This paper generalizes fuzzy set theory to non-classical algebraic structures, namely SSNMV-algebras, thereby enriching the mathematical foundation of fuzzy logic. The introduction of T -fuzzy subalgebras and T -fuzzy filters provides a unified framework for studying algebraic and logical properties under uncertainty.
Practical Implications: This work enhances tools for artificial intelligence (AI) and decision making by modeling imprecise logical operations (e.g., via Sheffer stroke and t -norms). It offers potential applications in areas such as control systems, database systems, and multi-valued logic design, where uncertainty management is crucial.
Future work could focus on extending the concepts introduced in this paper to more general classes of algebras, particularly those arising in other areas of mathematics and logic. Specifically, investigating the implications of T -fuzzy subalgebras and T -fuzzy filters in the context of multi-valued logic or lattice theory represents a promising direction. Furthermore, exploring the computational aspects of these structures—such as algorithms for constructing or analyzing T -fuzzy subalgebras and filters—could provide valuable practical insights. Additionally, the study of homomorphisms between fuzzy algebras and their applications in optimization or decision-making processes presents an exciting area for future research.

Author Contributions

The curent paper resulted from a long term collaboratin and some short communications. Conceptualization, T.O., N.R., R.B. and A.S.A.; supervision, T.O., N.R. and R.B.; writing—original draft preparation, T.O., N.R. and A.S.A.; resources, T.O., N.R. and A.S.A.; writing—review and editing, T.O., N.R., R.B. and A.S.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research is funded by Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia under Researchers Supporting Project Number (PNURSP2025R231).

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author(s).

Acknowledgments

The authors are very thankful to the anonymous referees for their valuable comments and suggestions which have improved the manuscript immensely. Moreover, the authors extend their appreciation to Princess Nourah Bint Abdulrahman University (PNU), Riyadh, Saudi Arabia for funding this research under Researchers Supporting Project Number (PNURSP2025R231).

Conflicts of Interest

The authors declare that they have no conflict of interests concerning the publication of this article.

Abbreviations

The following abbreviations are used in this manuscript:
SSNMV-algebrastrong Sheffer stroke NMV-algebra
t -normtriangular norm
T F S T -fuzzy subalgebra
T F F T -fuzzy filter

References

  1. Sheffer, H.M. A set of five independent postulates for Boolean algebras, with application to logical constants. Trans. Am. Math. Soc. 1913, 14, 481–488. [Google Scholar] [CrossRef]
  2. Oner, T.; Senturk, I. The Sheffer stroke operation reducts of basic algebras. Open Math. 2017, 15, 926–935. [Google Scholar] [CrossRef]
  3. Senturk, I. A view on state operators in Sheffer stroke basic algebras. Soft Comput. 2021, 25, 11471–11484. [Google Scholar] [CrossRef]
  4. Chajda, I. Sheffer operation in ortholattices. Acta Univ. Palacki. Olomucensis. Fac. Rerum Naturalium. Math. 2005, 44, 19–23. [Google Scholar]
  5. Oner, T.; Katican, T.; Saeid, A.B. Study strong Sheffer stroke non-associative MV-algebras by fuzzy filters. Commun. Fac. Sci. Univ. Ank. Ser. A1 Math. Stat. 2022, 71, 165–187. [Google Scholar] [CrossRef]
  6. Molkhasi, A.; Shum, K.M. Representations of strongly algebraically closed algebras. Algebra Discret. Math. 2019, 28, 130–143. [Google Scholar]
  7. Molkhasi, A. Representations of Sheffer stroke algebras and Visser algebras. Soft Comput. 2021, 25, 8533–8538. [Google Scholar] [CrossRef]
  8. Hernández-Varela, P.; Talavera, F.J.; Cubillo, S.; Torres-Blanc, C.; Elorza, J. Definition of Triangular Norms and Triangular Conorms on Subfamilies of Type-2 Fuzzy Sets. Axioms 2025, 14, 27. [Google Scholar] [CrossRef]
  9. Yılmaz, Ş.; İşçi, R. Triangular Norm-Based Elements on Bounded Lattices. Axioms 2024, 13, 23. [Google Scholar] [CrossRef]
  10. Wang, H.; Li, W.; Yang, B. An extension of several properties for fuzzy t-norm and vague t-norm. J. Intell. Fuzzy Syst. 2024, 46, 6881–6891. [Google Scholar] [CrossRef]
  11. Urbański, M.K.; Krawczyk, D.; Wójcick, K.M.; Wójcicki, P.M. On fuzzy order in fuzzy sets based on t-norm fuzzy arithmetic. Fuzzy Sets Syst. 2024, 487, 108992. [Google Scholar] [CrossRef]
  12. Pratama, D.; Yusoff, B.; Abdullah, L.; Kilicman, A.; Kamis, N.; Urbański, M.K.; Krawczyk, D.; Wójcick, K.M.; Wójcicki, P.M. Extension operators of circular intuitionistic fuzzy sets with triangular norms and conorms: Exploring a domain radius. AIMS Math. 2024, 9, 12259–12286. [Google Scholar] [CrossRef]
  13. Oner, T.; Katican, T.; Saeid, A.B.; Terziler, M. Filters of strong Sheffer stroke non-associative MV-algebras. Analele Stiintifice Univ. Ovidius Constanta 2021, 29, 143–164. [Google Scholar] [CrossRef]
  14. Klement, E.P.; Mesiar, R.; Pap, E. Triangular Norms; Trends in Logic; Springer: Berlin/Heidelberg, Germany, 2000; Volume 8. [Google Scholar]
  15. Burandate, P.; Thongarsa, S.; Iampan, A. Fuzzy Sets in UP-algebras with Respect to a Triangular Norm. Konuralp J. Math. 2019, 7, 410–432. [Google Scholar]
  16. Kim, K.H. On T-fuzzy ideals in Hilbert algebra. Sci. Math. Japon 2009, 70, 7–15. [Google Scholar]
  17. Mordeson, J.N.; Malik, D.S. Fuzzy Commutative Algebra; World Scientific: Singapore, 1998. [Google Scholar]
  18. Rosenfeld, A. Fuzzy groups. J. Math. Anal. Appl. 1971, 35, 512–517. [Google Scholar] [CrossRef]
  19. Poungsumpao, P.; Kaijae, W.; Arayarangsi, S.; Iampan, A. Fuzzy UP-ideals and fuzzy UP-subalgebras of UP-algebras in term of level subsets. Int. J. Math. Comput. Sci. 2019, 14, 647–674. [Google Scholar]
  20. Kesorn, B.; Maimun, K.; Ratbandan, W.; Iampan, A. Intuitionistic fuzzy sets in UP-algebras. Ital. J. Pure Appl. Math. 2015, 34, 339–364. [Google Scholar]
Table 1. Sheffer stroke NMV-algebra ( X , ) .
Table 1. Sheffer stroke NMV-algebra ( X , ) .
01 a b c d e f
011111111
110 b a d c f e
a 1 b 111 e d 1
b 1 a 1 b 1 d e 1
c 1 d 1111 d 1
d 1 c e d 1 b a e
e 1 f d e d a b 1
f 1 e 111 e 11
Table 2. Fuzzy set A of X.
Table 2. Fuzzy set A of X.
X01 a b c d e f
  ξ A ( ζ ) 0.8 0.7 0.7 0.8 0.7 0.7 0.7 0.7  
Table 3. Fuzzyset A of X.
Table 3. Fuzzyset A of X.
X01 a b c d e f
  ξ A ( ζ ) 0.7 0.6 0.5 0.5 0.5 0.7 0.2 0.5  
Table 4. Fuzzy set A of X.
Table 4. Fuzzy set A of X.
X01 a b c d e f
  ξ A ( ζ ) 0.7 0.8 0.7 0.8 0.7 0.8 0.7 0.8  
Table 5. Fuzzy set A of X.
Table 5. Fuzzy set A of X.
X01 a b c d e f
  ξ A ( ζ ) 0.6 0.7 0.6 0.6 0.7 0.7 0.5 0.7  
Table 6. Fuzzy set A of X.
Table 6. Fuzzy set A of X.
X01 a b c d e f
  ξ A ( ζ ) 0100000
Table 7. Fuzzy set A of X.
Table 7. Fuzzy set A of X.
X01 a b c d e f
  ξ A ( ζ ) 0101000
Table 8. Fuzzy set χ S ( 0.7 , 0.5 ) of X.
Table 8. Fuzzy set χ S ( 0.7 , 0.5 ) of X.
X01 a b c d e f
  χ S ( 0.7 , 0.5 ) ( ζ ) 0.7 0.5 0.5 0.5 0.5 0.7 0.5 0.5  
Table 9. Fuzzy set χ S ( 0.7 , 0.6 ) of X.
Table 9. Fuzzy set χ S ( 0.7 , 0.6 ) of X.
X01 a b c d e f
  χ S ( 0.7 , 0.6 ) ( ζ ) 0.6 0.7 0.6 0.6 0.7 0.7 0.6 0.7  
Table 10. Fuzzy set of A of X.
Table 10. Fuzzy set of A of X.
X01 a b c d e f
  ξ A ( ζ ) 0.7 0.6 0.6 0.5 0.5 0.7 0.4 0.7  
Table 11. Fuzzy set A of X.
Table 11. Fuzzy set A of X.
X01 a b c d e f
ξ A ( ζ ) 0.6 0.7 0.6 0.6 0.7 0.6 0.6 0.7
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

Bandaru, R.; Oner, T.; Rajesh, N.; Alali, A.S. Fuzzy Sets in Strong Sheffer Stroke NMV-Algebra with Respect to a Triangular Norm. Mathematics 2025, 13, 1282. https://doi.org/10.3390/math13081282

AMA Style

Bandaru R, Oner T, Rajesh N, Alali AS. Fuzzy Sets in Strong Sheffer Stroke NMV-Algebra with Respect to a Triangular Norm. Mathematics. 2025; 13(8):1282. https://doi.org/10.3390/math13081282

Chicago/Turabian Style

Bandaru, Ravikumar, Tahsin Oner, Neelamegarajan Rajesh, and Amal S. Alali. 2025. "Fuzzy Sets in Strong Sheffer Stroke NMV-Algebra with Respect to a Triangular Norm" Mathematics 13, no. 8: 1282. https://doi.org/10.3390/math13081282

APA Style

Bandaru, R., Oner, T., Rajesh, N., & Alali, A. S. (2025). Fuzzy Sets in Strong Sheffer Stroke NMV-Algebra with Respect to a Triangular Norm. Mathematics, 13(8), 1282. https://doi.org/10.3390/math13081282

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