Next Article in Journal
CBAM-BiLSTM-DDQN: A Novel Adaptive Quantitative Trading Model for Financial Data Analysis
Previous Article in Journal
Boundedness and Applications of Fractional Integral Operators in Nonlocal Problems with Fractional Laplacians
Previous Article in Special Issue
Sheffer Stroke BCK-Algebras via Linear Diophantine Fuzzy Structures
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Interval-Valued Intuitionistic Fuzzy n-Fold Implicative Filters in Hoop Algebra

by
Amal S. Alali
1,†,
Tahsin Oner
2,*,†,
Ravi Kumar Bandaru
3,*,†,
Rajesh Neelamegarajan
4,† and
Ibrahim Senturk
2,†
1
Department of Mathematical Sciences, College of Science, Princess Nourah bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia
2
Department of Mathematics, Faculty of Science, Ege University, 35100 Izmir, Türkiye
3
Department of Mathematics, School of Advanced Sciences, VIT-AP University, Amaravati 522237, Andhra Pradesh, India
4
Department of Mathematics, Rajah Serfoji Government College, Thanjavur 613005, Tamil Nadu, India
*
Authors to whom correspondence should be addressed.
These authors contributed equally to this work.
Axioms 2026, 15(3), 221; https://doi.org/10.3390/axioms15030221
Submission received: 2 February 2026 / Revised: 12 March 2026 / Accepted: 13 March 2026 / Published: 16 March 2026
(This article belongs to the Special Issue New Perspectives in Fuzzy Sets and Their Applications, 2nd Edition)

Abstract

This paper introduces the concept of interval-valued intuitionistic fuzzy n-fold implicative filters in hoop algebras and explores their fundamental properties. We establish several new and equivalent characterizations, investigate their closure properties, and provide explicit algorithms for their construction and verification. Furthermore, we examine the relationships between interval-valued intuitionistic fuzzy n-fold implicative filters, interval-valued intuitionistic fuzzy filters, and classical n-fold implicative filters. The results presented here extend beyond straightforward generalizations, offering both practical tools and theoretical insights that are not previously available in the literature. The results presented here build upon earlier studies by systematically characterizing interval-valued intuitionistic fuzzy n-fold implicative filters in hoop algebras. Several new equivalent conditions and computational methods are introduced, and relationships with existing filter concepts are clarified.

1. Introduction

Non-classical logic has become a fundamental framework in computer science for managing uncertain and imprecise information. Many non-classical logical systems, such as Hájek’s basic logic (BL) [1], Łukasiewicz many-valued logic (MV) [2], and monoidal t-norm based logic (MTL) [3], possess algebraic semantics founded on residuation and are analyzed within the context of residuated structures [4]. Their algebraic counterparts—BL-algebras, MV-algebras, and MTL-algebras—are constructed on lattices equipped with a residuated implication, highlighting the central role of residuation in algebraic logic. Accordingly, the study of algebraic structures with residuation is of great importance.
Hoop algebras, introduced by Bosbach as naturally ordered commutative residuated integral monoids [5,6], represent a significant class among residuated structures. They provide a unifying algebraic framework that encompasses several well-known logical and algebraic systems. Investigations, including unpublished work by Büchi and Owens and subsequent contributions, have revealed rich structural properties of hoops, with recent advances in hoop theory yielding deep structural results [7,8,9,10] and direct applications in fuzzy logic and its algebraic semantics [11]. Notably, BL-algebras, which are the algebraic semantics of Hájek’s basic logic, are special cases of hoop algebras.
Hoop algebras distinguish themselves from related structures such as BL-algebras, MV-algebras, and MTL-algebras by their naturally ordered, commutative, and integral monoid structure with a residuated implication [5,6]. This general and flexible framework allows for a unified treatment of various logical systems and does not require a lattice structure, enabling the investigation of filters and fuzzy substructures where order-theoretic constraints are relaxed. Recent structural results in hoop theory [7,8,9,10] have uncovered algebraic properties and closure behaviors—particularly regarding implicative filters—that are not always present in MV- or MTL-algebras. The technical simplicity and generality of hoops also facilitate algorithmic verification and structural analysis, making them suitable for the development of interval-valued intuitionistic fuzzy n-fold implicative filters, which offer both theoretical depth and practical applicability beyond more restrictive frameworks.
Fuzzy set theory and its generalizations have become essential for modeling uncertainty and vagueness in algebraic systems. Intuitionistic fuzzy sets, which incorporate degrees of membership and non-membership, have led to extensive studies of fuzzy substructures such as fuzzy ideals and fuzzy filters. Interval-valued intuitionistic fuzzy sets extend this by representing membership and non-membership degrees as intervals, providing a more expressive approach to uncertainty.
The interplay between hoop algebras and fuzzy logic has motivated the exploration of fuzzy filter theory in this context. Higher-order concepts such as implicative, positive implicative, and n-fold implicative filters are increasingly studied for their algebraic and logical significance. While these notions have been examined in various algebraic structures, a systematic study of interval-valued intuitionistic fuzzy n-fold implicative filters in hoop algebras remains undeveloped.
The n-fold condition within the interval-valued intuitionistic fuzzy filter framework introduces structural and logical consequences by refining the classification of filters based on stability under repeated implication operations. Filters satisfying the n-fold implicative property but not the ( n 1 ) -fold condition demonstrate new layers of complexity, with unique behaviors in their membership and non-membership intervals. This enables identification of filter classes with enhanced closure properties and distinct equivalence relations, absent in the standard IVIF setting. Explicit examples illustrate how the n-fold condition shapes the hierarchy and structure of filters in hoop algebras, providing substantive extensions to the IVIF framework and revealing novel phenomena in fuzzy algebraic systems.
This paper aims to fill this gap by introducing interval-valued intuitionistic fuzzy n-fold implicative filters in hoop algebras and examining their fundamental properties. Equivalent characterizations are established, relationships with interval-valued intuitionistic fuzzy filters and classical n-fold implicative filters are clarified, and closure properties are investigated. The results systematically characterize these filters, presenting new equivalence theorems, computational algorithms, and structural results. Examples and closure properties further demonstrate the novelty and nontriviality of the proposed structures.

2. Preliminaries

In this section, we recall essential concepts and definitions that will be used throughout the paper. We begin by reviewing the basic properties of hoop algebras, followed by the notions of fuzzy sets and interval-valued intuitionistic fuzzy sets. These preliminaries provide the foundational framework necessary for the subsequent development of interval-valued intuitionistic fuzzy n-fold implicative filters in hoop algebras.
Definition 1
([12]). An algebra ( H , , , 1 ) is said to be a hoop if ( H , , 1 ) is a commutative monoid and the binary operation → fulfills the following conditions.
(H1) 
h x h x = 1 ,
(H2) 
h x ( h x h y ) = h y ( h y h x ) ,
(H3) 
h x ( h y h z ) = ( h x h y ) h z for all h x , h y , h z H .
Remark 1.
It is worth noting that the operations in hoop algebras often correspond to familiar logical connectors. For example, if we take H = { 0 , 1 } , representing logical values “false” and “true” and define ⊙ as logical conjunction (∧), i.e., h x h y = min { h x , h y } , and → as classical implication, i.e., h x h y = max { 1 h x , h y } , then ( H , , , 1 ) forms a hoop algebra. In this case, the hoop axioms are satisfied, and the structure captures the essence of classical propositional logic within the hoop framework. This illustrates that hoop algebras generalize familiar logical operations, making the abstract theory accessible and relevant to readers accustomed to classical logic.
Let H be a hoop. Define a relation ≤ on H by
h x h y h x h y = 1 , for all h x , h y H .
Then the structure ( H , ) is a partially ordered set.
Definition 2
([13]). Let H be a hoop algebra. A nonempty subset S H is said to be a sub-hoop of H provided that it is closed under the operations ⊙ and →, that is,
( h x , h y H ) h x h y S , h x h y S .
In particular, every sub-hoop necessarily contains the unit element 1.
Proposition 1
([13]). Let ( H , , , 1 ) be a hoop algebra. Then, for arbitrary elements h x , h y , h z H , the following identities are satisfied:
1. 
( H , ) is a meet-semilattice with h x h y = h x ( h x h y ) ,
2. 
h x ( h x h y ) h y , h x h y h x , h x ( h y h x ) h x ,
3. 
1 h x = h x , h x h y h x , h y , h x h x = 1 ,
4. 
if h x h y , then h z h x h z h y , h y h z h x h z and h x h y = 1 ,
5. 
h x h y ( h z h x ) ( h z h y ) , h x h y ( h y h z ) ( h x h z ) ,
6. 
h x ( h y h z ) = h y ( h x h z ) ,
7. 
h x h y h z if and only if h y h x h z ,
8. 
( h x h y ) ( h y h z ) ( h x h z ) .
Definition 3
([13]). Let H be a hoop algebra. A nonempty subset F of H is a filter if the following requirements are satisfied.
( h x , h y H ) h x , h y F h x h y F .
( h x , h y H ) h x F , h x h y h y F .
Definition 4
([14]). Let H be a hoop algebra. A nonempty subset F H is said to be an implicative filter of H whenever the following conditions are satisfied:
1 F
( h x , h y , h z F ) h x ( ( h y h z ) h y ) F , h x F h y F .
It follows from (3) and (4) that F is closed with respect to ⊙ and is upward closed, respectively. Furthermore, a subset F of a hoop algebra H constitutes a filter of H precisely when condition (5) and
( h x , h y F ) h x h y F , h x F h y F
are satisfied.
Definition 5
([15]). Let A be a nonempty set. The intuitionistic fuzzy set on A is defined as a structure
A : = { h x , μ A ( h x ) , γ A ( h x ) h x A } ,
where μ A : A [ 0 , 1 ] is the degree of membership of h x to C and γ A : A [ 0 , 1 ] is the degree of non-membership of h x to C such that 0 μ A ( h x ) + γ A ( h x ) 1 , and the intuitionistic fuzzy set in (8) is simply denoted by A = ( μ A , γ A ) j.
Let D [ 0 , 1 ] denote the collection of all closed subintervals of the unit interval [ 0 , 1 ] . For any two elements D 1 , D 2 D [ 0 , 1 ] with D 1 = [ u 1 , v 1 ] and D 2 = [ u 2 , v 2 ] , define
r min ( D 1 , D 2 ) = [ min { u 1 , u 2 } , min { v 1 , v 2 } ] ,
and
r max ( D 1 , D 2 ) = [ max { u 1 , u 2 } , max { v 1 , v 2 } ] .
More generally, for a family { D i = [ u i , v i ] i I } D [ 0 , 1 ] , we set
r sup i I D i = sup i I u i , sup i I v i , r inf i I D i = inf i I u i , inf i I v i .
Furthermore, an order relation on D [ 0 , 1 ] is introduced by declaring that D 1 D 2 if and only if u 1 u 2 and v 1 v 2 . The relations D 1 D 2 and D 1 = D 2 are defined analogously.
Definition 6.
An interval-valued intuitionistic fuzzy set (IVIFS) on a nonempty set X is defined as an ordered pair A = ( μ A , γ A ) , where the mappings μ A , γ A : X D [ 0 , 1 ] assign to each element h x X an interval-valued degree of membership and non-membership, respectively. For every h x X , these intervals are given by
μ A ( h x ) = [ μ A l ( h x ) , μ A u ( h x ) ] , γ A ( h x ) = [ γ A l ( h x ) , γ A u ( h x ) ] ,
and satisfy the consistency condition
0 μ A l ( h x ) + γ A u ( h x ) 1 .
For convenience, the IVIFS A may also be represented in set-theoretic form as
A = { h x , μ A ( h x ) , γ A ( h x ) h x X } .
The complement of an element h x in A is defined by
μ A ¯ ( h x ) = [ 1 μ A u ( h x ) , 1 μ A l ( h x ) ] , γ A ¯ ( h x ) = [ 1 γ A u ( h x ) , 1 γ A l ( h x ) ] .
Definition 7.
An IVIFS A = ( μ A , γ A ) defined on a hoop H is said to be an IVIF filter of H whenever the conditions listed below hold for { , } :
( h x , h y H ) μ A ( h x h y ) r min { μ A ( h x ) , μ A ( h y ) } γ A ( h x h y ) r max { γ A ( h x ) , γ A ( h y ) } ,
( h x , h y H ) h x h y μ A ( h x ) μ A ( h y ) γ A ( h x ) γ A ( h y ) .
Theorem 1.
A IVIFS A = ( μ A , γ A ) is an IVIF filter of H if and only if
( h x H ) μ A ( 1 ) μ A ( h x ) γ A ( 1 ) γ A ( h x ) .
( h x , h y H ) μ A ( h y ) r min { μ A ( h x ) , μ A ( h x h y ) } γ A ( h y ) r max { γ A ( h x ) , γ A ( h x h y ) } .
Definition 8
([16]). A nonempty subset F of a hoop algebra H with 1 F is called an n-fold implicative filter if
h x ( h y n h z ) h y F and h x F h y F
for all h x , h y , h z H .
Definition 9
([17]). A fuzzy set μ : H [ 0 , 1 ] is said to be a fuzzy n-fold implicative filter of a hoop algebra H if it satisfies
μ ( 1 ) μ ( h x ) for all h x H ,
and
μ h x ( h y n h z ) y μ ( h x ) μ ( h y ) , for all h x , h y , h z H .

3. IVIF n -Fold Implicative Filters in Hoop Algebra

Interval-valued intuitionistic fuzzy sets (IVIFS) have become a central topic in fuzzy algebra, evolving through multiple definitions and applications across the literature. The foundational work of Atanassov and Gargov [18] introduced IVIFS as a generalization of fuzzy sets, paving the way for further developments and refinements. Subsequent studies, such as those by Gomathi Nayagam et al. [19,20], expanded the theory by exploring ranking and aggregation methods, highlighting the versatility of IVIFS in decision-making and data analysis. However, the interpretation and formalization of IVIFS have varied, leading to subtle distinctions in how membership and non-membership intervals are handled within algebraic contexts.
Our approach offers several advantages and clarifications in the study of IVIFS. Firstly, the definition we adopt is constructed to align naturally with algebraic operations and ideals, facilitating the integration of interval-valued fuzzy concepts into broader algebraic frameworks. This generalization extends classical ideal theory, providing new perspectives on structures such as Artinian and Noetherian algebras [21]. By rigorously considering both interval-valued membership and non-membership functions, our framework ensures mathematical consistency while enhancing applicability to a wider range of algebraic systems. Although our methodology is rooted in prior literature [18,19,20], it also adapts and clarifies these concepts for advanced algebraic applications, contributing to the ongoing development of IVIFS theory.
Having established the necessary preliminaries and basic properties, we now turn to the main focus of this paper. In the following section, we introduce and investigate interval-valued intuitionistic fuzzy n-fold implicative filters in hoop algebras.
Let H be a hoop algebra. For the sake of readability, throughout this paper we use the notation Δ n ( u , v ) instead of ( u n v ) u and Δ w n ( u , v ) instead of w ( ( u n v ) u ) for arbitrary elements u , v , w H .
Lemma 1.
Let ( H , , , 1 ) be a hoop algebra, and let Δ n ( x , y ) : = ( x n y ) x for x , y H . The following order-related properties hold:
1. 
x Δ n ( x , y ) for all x , y H .
2. 
If x y , then Δ n ( x , y ) Δ n ( y , x ) .
3. 
Δ n ( x , y ) is monotone in y.
4. 
For all x , y H , x ( x n y ) x (see Proposition 1(4)).
Proof. 
1.
By Proposition 1(4), for all x , y H , x ( x n y ) x = Δ n ( x , y ) .
2.
Suppose x y . Then x n y n , and since the implication operation is order-reversing in the antecedent, x n y y n x . Thus, ( x n y ) x ( y n x ) y .
3.
Monotonicity in y follows since for y y , x n y x n y , and thus Δ n ( x , y ) Δ n ( x , y ) .
4.
This follows directly from the definition and Proposition 1(4).
   □
We have included Lemma 1 to summarize and justify all order-related properties of the Δ n operation used in our proofs. By doing so, we aim to make the logical flow of the arguments transparent and facilitate easier verification and understanding for the reader.
Definition 10.
Let H be a hoop algebra. An IVIFS A = ( μ A , γ A ) on H is called an IVIF n-fold implicative filter of H if it satisfies condition (11) together with the following condition:
( h x , h y , h z H ) μ A ( h y ) r min { μ A ( Δ h x n ( h y , h z ) ) , μ A ( h x ) } γ A ( h y ) r max { γ A ( Δ h x n ( h y , h z ) ) , γ A ( h x ) } .
To ensure the robust verification of interval-valued intuitionistic fuzzy n-fold implicative filters (IVIF n-fold implicative filters) within hoop algebras, we present a pseudocode that systematically checks whether an IVIFS A = ( μ A , γ A ) meets the criteria specified in Definition 10. This algorithm evaluates the required inequalities involving the n-fold implicative operation for all relevant triples of elements in H and provides a reliable decision procedure.
Algorithm 1 is designed to verify whether a given interval-valued intuitionistic fuzzy set A = ( μ A , γ A ) forms an IVIF n-fold implicative filter of a hoop algebra H according to Definition 10. The procedure iterates over all triples of elements h x , h y , h z H , computes the n-fold implicative operation Δ h x n ( h y , h z ) , and checks the prescribed inequalities for the membership and non-membership intervals under the scaling parameter r.
Algorithm 1: Verification of IVIF n-Fold Implicative Filter in Hoop Algebras
Axioms 15 00221 i001
For each triple, the algorithm verifies the following requirements:
μ A ( h y ) r min { μ A ( Δ h x n ( h y , h z ) ) , μ A ( h x ) } ,
and
γ A ( h y ) r max { γ A ( Δ h x n ( h y , h z ) ) , γ A ( h x ) } .
If any of these conditions fails for any triple, the algorithm immediately returns False, indicating that A does not satisfy the definition. If all conditions hold for every triple, the algorithm returns True, confirming that A is an IVIF n-fold implicative filter of H . This systematic approach guarantees thorough and reliable verification in accordance with Definition 10.
Example 1.
The binary operations → and ⊙ on the set H = { 0 , 1 , 2 , 3 , 4 , 5 , 6 } are defined by their Cayley tables shown in Table 1 and Table 2, respectively.
Let n be a positive integer and define an interval-valued intuitionistic fuzzy set A = ( μ A , γ A ) on H by
μ A ( h x ) = [ 0.7 , 0.8 ] , γ A ( h x ) = [ 0.1 , 0.2 ] , h x H .
Consider the element
Δ h x n ( h y , h z ) = h x ( h y n h z ) h y
for all h x , h y , h z H , where h y n denotes the n-fold product of h y under ⊙.
According to Definition 10, we must verify
r min { μ A ( Δ h x n ( h y , h z ) ) , μ A ( h x ) } μ A ( h y )
and
r max { γ A ( Δ h x n ( h y , h z ) ) , γ A ( h x ) } γ A ( h y )
for all h x , h y , h z H , where
r min ( [ a l , a u ] , [ b l , b u ] ) = [ min { a l , b l } , min { a u , b u } ]
and
r max ( [ a l , a u ] , [ b l , b u ] ) = [ max { a l , b l } , max { a u , b u } ]
Since μ A and γ A are constant for all elements,
r min { μ A ( Δ h x n ( h y , h z ) ) , μ A ( h x ) } = r min ( [ 0.7 , 0.8 ] , [ 0.7 , 0.8 ] ) = [ 0.7 , 0.8 ]
r max { γ A ( Δ h x n ( h y , h z ) ) , γ A ( h x ) } = r max ( [ 0.1 , 0.2 ] , [ 0.1 , 0.2 ] ) = [ 0.1 , 0.2 ]
and
μ A ( h y ) = [ 0.7 , 0.8 ] , γ A ( h y ) = [ 0.1 , 0.2 ]
Thus, the inequalities
[ 0.7 , 0.8 ] [ 0.7 , 0.8 ] , [ 0.1 , 0.2 ] [ 0.1 , 0.2 ]
hold for every choice of h x , h y , h z H .
The code provided in the Appendix A Section demonstrates that all conditions required by Definition 10 are satisfied for every ( h x , h y , h z ) H . Consequently, ( A ) is an interval-valued intuitionistic fuzzy n-fold implicative filter of the hoop algebra ( H ) .
Proposition 2.
Every IVIF n-fold implicative filter of a hoop algebra H is an IVIF filter of H .
Proof. 
Let A = ( μ A , γ A ) be an IVIF n-fold implicative filter of H and let h x , h y , h z H . By assumption, condition (11) is satisfied. Taking h z = 1 , we obtain
r min μ A x Δ n ( h y , 1 ) , μ A ( h x ) μ A ( h y ) ,
and
r max γ A h x Δ n ( h y , 1 ) , γ A ( h x ) γ A ( h y ) .
Since Δ n ( h y , 1 ) = y , the above inequalities reduce to
r min { μ A ( h x h y ) , μ A ( h x ) } μ A ( h y ) ,
and
r max { γ A ( h x h y ) , γ A ( h x ) } γ A ( h y ) .
Hence, A satisfies the defining conditions of an IVIF filter of H , which completes the proof.    □
Theorem 2.
Let A = ( μ A , γ A ) be an IVIF filter of a hoop algebra H . Then, for all h x , h y H , the following statements are equivalent:
1. 
A = ( μ A , γ A ) is an IVIF n-fold implicative filter of H ;
2. 
μ A Δ n ( h x , h y ) μ A ( h x ) and γ A Δ n ( h x , h y ) γ A ( h x ) ;
3. 
μ A Δ n ( h x , h y ) h x = μ A ( 1 ) and γ A Δ n ( h x , h y ) h x = γ A ( 1 ) ;
4. 
μ A ( ( h x n ) h x ) h x = μ A ( 1 ) and γ A ( ( h x n ) h x ) h x = γ A ( 1 ) .
Proof. 
  • (1) ⇒ (2). Assume that A = ( μ A , γ A ) is an IVIF n-fold implicative filter of H . Then, condition (11) holds. By Proposition 1(3), we have Δ n ( h x , h y ) = 1 Δ n ( h x , h y ) . Hence,
    μ A ( Δ n ( h x , h y ) ) = r min { μ A ( 1 Δ n ( h x , h y ) ) , μ A ( 1 ) } μ A ( h x ) ,
    and
    γ A ( Δ n ( h x , h y ) ) = r max { γ A ( 1 Δ n ( h x , h y ) ) , γ A ( 1 ) } γ A ( h x ) ,
    which proves (2).
  • (2) ⇒ (1). Let A = ( μ A , γ A ) be an IVIF filter of H satisfying (2). For arbitrary h x , h y , h z H , since A is an IVIF filter, we have
    r min { μ A ( h z ) , μ A ( h z Δ n ( h x , h y ) ) } μ A ( Δ n ( h x , h y ) ) ,
    and
    r max { γ A ( z ) , γ A ( z Δ n ( h x , h y ) ) } γ A ( Δ n ( h x , h y ) ) .
    By Proposition 1(5), h x Δ n ( h x , h y ) , which implies
    μ A ( h x ) μ A ( Δ n ( h x , h y ) ) , γ A ( h x ) γ A ( Δ n ( h x , h y ) ) .
    Combining these inequalities with assumption (2), we obtain
    r min { μ A ( z ) , μ A ( z Δ n ( h x , h y ) ) } μ A ( h x ) ,
    and
    r max { γ A ( h z ) , γ A ( h z Δ n ( h x , h y ) ) } γ A ( h x ) .
    Therefore, A is an IVIF n-fold implicative filter of H .
  • (3) ⇒ (1). Assume that A = ( μ A , γ A ) is an IVIF filter of H satisfying (3). Then
    r min { μ A ( Δ n ( h y , h z ) ) , μ A ( Δ n ( h y , h z ) h y ) } μ A ( h y ) ,
    and
    r max { γ A ( Δ n ( h y , h z ) ) , γ A ( Δ n ( h y , h z ) h y ) } γ A ( y ) .
    Using the assumption μ A ( Δ n ( h y , h z ) h y ) = μ A ( 1 ) and γ A ( Δ n ( h y , h z ) h y ) = γ A ( 1 ) , we obtain
    r min { μ A ( 1 ) , μ A ( ( h y n h z ) h y ) } μ A ( h y ) ,
    and
    r max { γ A ( 1 ) , γ A ( ( h y n h z ) h y ) } γ A ( h y ) .
    Consequently,
    r min { μ A ( h x ) , μ A ( h x Δ n ( h y , h z ) ) } μ A ( h y ) ,
    and
    r max { γ A ( h x ) , γ A ( h x Δ n ( h y , h z ) ) } γ A ( h y ) ,
    which shows that A is an IVIF n-fold implicative filter.
  • (3) ⇒ (4). Taking h y = 0 in (3), we get
    μ A ( ( ( h x n ) h x ) h x ) = μ A ( 1 ) , γ A ( ( ( h x n ) h x ) h x ) = γ A ( 1 ) ,
    which proves (4).
  • (4) ⇒ (3). By Proposition 1(3) and (4), we have
    Δ n ( h x , h y ) ( h x n ) h x and ( ( h x n ) h x ) h x ( Δ n ( h x , h y ) ) h x .
    Thus,
    μ A ( ( Δ n ( h x , h y ) ) h x ) = μ A ( 1 ) , γ A ( ( Δ n ( h x , h y ) ) h x ) = γ A ( 1 ) ,
    and (3) follows.
  • (3) ⇒ (2). For any h x , h y H , using (3), we obtain
    μ A ( Δ n ( h x , h y ) ) = r min { μ A ( Δ n ( h x , h y ) ) , μ A ( 1 ) } μ A ( h x ) ,
    and
    γ A ( Δ n ( h x , h y ) ) = r max { γ A ( Δ n ( h x , h y ) ) , γ A ( 1 ) } γ A ( h x ) .
    This completes the proof.    □
The following schematic roadmap illustrates the logical equivalence between the four statements in Theorem 2:
Axioms 15 00221 i002
The schematic roadmap above not only clarifies the logical equivalence between the four statements in Theorem 2 but also underscores the technical depth and unified perspective achieved in the context of interval-valued intuitionistic fuzzy n-fold implicative filters on hoop algebras. It should be noted that these equivalences are established specifically within the framework of hoop algebras. While the methods and structural insights presented here may inspire analogous developments in related algebraic structures—such as residuated lattices, BL-algebras, or MV-algebras—direct generalization is not guaranteed and may require additional assumptions or modifications. Therefore, the scope of the results is confined to hoop algebras equipped with interval-valued intuitionistic fuzzy sets, and their applicability to broader classes remains an open avenue for future research.
Remark 2.
Let [ u 1 , v 1 ] , [ u 2 , v 2 ] D [ 0 , 1 ] be two intervals, and recall that the order relation [ u 1 , v 1 ] [ u 2 , v 2 ] holds if and only if u 1 u 2 and v 1 v 2 . The r min and r max operators are defined as follows:
r min ( [ u 1 , v 1 ] , [ u 2 , v 2 ] ) = [ min { u 1 , u 2 } , min { v 1 , v 2 } ] ,
r max ( [ u 1 , v 1 ] , [ u 2 , v 2 ] ) = [ max { u 1 , u 2 } , max { v 1 , v 2 } ] .
The compatibility between the interval order and these operators is established as follows: - If [ u 1 , v 1 ] [ u 2 , v 2 ] , then r min ( [ u 1 , v 1 ] , [ u 2 , v 2 ] ) = [ u 1 , v 1 ] and r max ( [ u 1 , v 1 ] , [ u 2 , v 2 ] ) = [ u 2 , v 2 ] . - More generally, for any intervals A , B , r min ( A , B ) A and r min ( A , B ) B , while A r max ( A , B ) and B r max ( A , B ) . These properties ensure that the interval order is preserved under r min and r max , and justify the inequalities used in the proofs, such as
r min { [ μ A l ( η ) , μ A u ( η ) ] , [ μ A l ( h x ) , μ A u ( h x ) ] } [ μ A l ( h y ) , μ A u ( h y ) ] ,
whenever [ μ A l ( h y ) , μ A u ( h y ) ] is greater than or equal to both intervals involved. By explicitly stating these compatibility properties, we clarify the logical steps in the transition from item one to item two, and ensure that the reasoning is transparent and rigorous.
Theorem 3.
Let A = ( μ A , γ A ) be an IVIFS of a hoop H . Then the following statements hold:
1. 
A is an IVIF n-fold implicative filter of H if and only if
( h x H ) μ A ( Δ n ( h x , 0 ) ) μ A ( h x ) , γ A ( Δ n ( h x , 0 ) ) γ A ( h x ) .
2. 
A is an IVIF n-fold implicative filter of H if and only if
( h x , h y H ) μ A ( Δ n ( h x , h y ) ) = μ A ( h x ) , γ A ( Δ n ( h x , h y ) ) = γ A ( h x ) .
Proof. 
(1) Suppose that A = ( μ A , γ A ) is an IVIF n-fold implicative filter of H . Then, by Theorem 2(2), for all h x , h y H ,
μ A ( Δ n ( h x , h y ) ) μ A ( h x ) and γ A ( Δ n ( h x , h y ) ) γ A ( h x ) .
Taking h y = 0 , we immediately obtain
μ A ( Δ n ( h x , 0 ) ) μ A ( h x ) and γ A ( Δ n ( h x , 0 ) ) γ A ( h x ) ,
which proves the necessity.
Conversely, assume that
μ A ( Δ n ( h x , 0 ) ) μ A ( h x ) and γ A ( Δ n ( h x , 0 ) ) γ A ( h x ) for all h x H .
Since Δ n ( h x , 0 ) = ( h x n ) h x , it follows that
μ A ( ( ( h x n ) h x ) h x ) = μ A ( 1 ) and γ A ( ( ( h x n ) h x ) h x ) = γ A ( 1 ) .
Hence, by Theorem 2(4), A is an IVIF n-fold implicative filter of H .
(2) Let A = ( μ A , γ A ) be an IVIF n-fold implicative filter of H . By Theorem 2(2), we have
μ A ( Δ n ( h x , h y ) ) μ A ( h x ) and γ A ( Δ n ( h x , h y ) ) γ A ( h x ) for all x , y H .
On the other hand, by Proposition 1(5), x Δ n ( h x , h y ) , which implies
μ A ( h x ) μ A ( Δ n ( h x , h y ) ) and γ A ( h x ) γ A ( Δ n ( h x , h y ) ) .
Therefore,
μ A ( Δ n ( h x , h y ) ) = μ A ( h x ) and γ A ( Δ n ( h x , h y ) ) = γ A ( h x ) .
Conversely, the sufficiency follows directly from Theorem 2.    □
Proposition 3.
If A = ( μ A , γ A ) is an IVIF n-fold implicative filter of H , then it is an IVIF ( n + 1 ) -fold implicative filter of H .
Proof. 
Let A = ( μ A , γ A ) be an IVIF n-fold implicative filter of H . By Proposition 1(3), we have h x n + 1 h x n for all h x H . Hence,
h x n 0 h x n + 1 0 ,
which implies
( h x n + 1 0 ) h x ( h x n 0 ) h x = Δ n ( h x , 0 ) .
Consequently,
Δ n ( h x , 0 ) h x ( ( x n + 1 0 ) h x ) h x .
Since A is an IVIF n-fold implicative filter, by Theorem 2(4),
μ A ( Δ n ( h x , 0 ) h x ) = μ A ( 1 ) and γ A ( Δ n ( h x , 0 ) h x ) = γ A ( 1 ) .
Thus,
μ A ( ( ( x n + 1 0 ) x ) x ) = μ A ( 1 ) and γ A ( ( ( x n + 1 0 ) x ) x ) = γ A ( 1 ) .
Again by Theorem 2(4), A is an IVIF ( n + 1 ) -fold implicative filter of H .    □
Proposition 4.
If A = ( μ A , γ A ) is an IVIF filter of H such that μ A ( h x ) < μ A ( x ) and γ A ( h x ) > γ A ( x ) for all h x H , then A is an IVIF n-fold implicative filter of H .
Proof. 
Let h x H . By Proposition 1(3), h x n h x , and by Proposition 1(4), h x ( h x n ) . Hence,
μ A ( h x ) μ A ( x ) μ A ( ( x n ) ) , γ A ( h x ) γ A ( x ) γ A ( ( x n ) ) .
Since A = ( μ A , γ A ) is an IVIF filter, we have
r min { μ A ( ( h x n ) h x ) , μ A ( ( h x n ) ) } μ A ( h x ) ,
r max { γ A ( ( h x n ) h x ) , γ A ( ( h x n ) ) } γ A ( h x ) .
Therefore,
μ A ( ( h x n ) h x ) μ A ( h x ) and γ A ( ( h x n ) h x ) γ A ( h x ) .
By Theorem 3(1), A is an IVIF n-fold implicative filter of H .    □
Theorem 4.
An IVIFS A = { [ μ A l , μ A u ] , [ γ A l , γ A u ] } in H is an IVIF n-fold implicative filter of H if and only if μ A l , μ A u , γ A l and γ A u are fuzzy n-fold implicative filters of H .
Proof. 
Since μ A l ( 1 ) μ A l ( h x ) , μ A u ( 1 ) μ A u ( x ) , γ A l ( 1 ) γ A l ( h x ) and γ A u ( 1 ) γ A u ( h x ) , μ A ( 1 ) μ A ( h x ) and γ A ( 1 ) γ A ( h x ) .
  • Let h x , h y H . Then we have
    μ A ( h y ) = [ μ A l ( h y ) , μ A u ( h y ) ] [ min { μ A l ( Δ x n ( h y , h z ) ) , μ A l ( h x ) } , min { μ A u ( Δ x n ( h y , h z ) ) , μ A u ( h x ) } ] = r min { [ μ A l ( Δ h x n ( h y , h z ) ) , μ A u ( Δ h x n ( h y , h z ) ) ] , [ μ A l ( h x ) , μ A u ( h x ) ] } = r min { μ A ( Δ h x n ( h y , h z ) ) , μ A ( h x ) } ,
    and
    γ A ( h y ) = [ γ A l ( h y ) , γ A u ( h y ) ] [ max { γ A l ( Δ h x n ( h y , h z ) ) , γ A l ( h x ) } , max { γ A u ( h x ( Δ n ( h y , h z ) ) , γ A u ( x ) } ] = r max { [ γ A l ( Δ h x n ( h y , h z ) ) , γ A u ( Δ h x n ( h y , h z ) ) ] , [ γ A l ( h x ) , γ A u ( h x ) ] } = r max { γ A ( Δ h x n ( h y , h z ) ) , γ A ( h x ) } .
    Hence A = { [ μ A l , μ A u ] , [ γ A l , γ A u ] } is an IVIF n-fold implicative filter of H . Conversely, assume that A = { [ μ A l , μ A u ] , [ γ A l , γ A u ] } is an IVIF n-fold implicative filter of H . Let h x H . Then [ μ A l ( 1 ) , μ A u ( 1 ) ] = μ A ( 1 ) μ A ( h x ) = [ μ A l ( h x ) , μ A u ( h x ) ] ; hence μ A l ( 1 ) μ A l ( h x ) and γ A l ( 1 ) γ A l ( h x ) . Let h x , h y , h z H . Then
    [ μ A l ( h y ) , μ A u ( h y ) ] = μ A ( h y ) r min { μ A ( Δ h x n ( h y , h z ) ) , μ A ( h y ) } = r min { [ μ A l ( Δ h x n ( h y , h z ) ) , μ A u ( Δ h x n ( h y , h z ) ) ] , [ μ A l ( h y ) , μ A u ( h y ) ] } = [ min { μ A l ( Δ h x n ( h y , h z ) ) , μ A l ( h y ) } , min { μ A u ( Δ h x n ( h y , h z ) ) , μ A u ( h y ) } ] .
    Hence, μ A l ( h y ) min { μ A l ( Δ h x n ( h y , h z ) ) , μ A l ( h x ) } and μ A u ( y ) min { μ A u ( Δ h x n ( h y , h z ) ) , μ A u ( h x ) } . Also
    [ γ A l ( y ) , γ A u ( h y ) ] = γ A ( h y ) r max { γ A ( Δ h x n ( h y , h z ) ) , γ A ( h x ) } = r max { [ γ A l ( Δ h x n ( h y , h z ) ) , γ A u ( Δ h x n ( h y , h z ) ) ] , [ γ A l ( x ) , γ A u ( h x ) ] } = [ max { γ A l ( Δ h x n ( h y , h z ) ) , γ A l ( h x ) } , max { γ A u ( Δ h x n ( h y , h z ) ) , γ A u ( h x ) } ] .
    Hence γ A l ( h y ) max { γ A l ( h x ( Δ n ( h y , h z ) ) , γ A l ( h x ) } and γ A u ( h y ) max { γ A u ( x ( Δ n ( h y , h z ) ) ) , γ A u ( x ) } . Therefore, μ A l , μ A u , γ A l and γ A u are fuzzy n-fold implicative filters of H .    □
Proposition 5.
If A = ( μ A , γ A ) and B = ( μ B , γ B ) are IVIF n-fold implicative filters of H , then A B is an IVIF n-fold implicative filter of H .
Proof. 
Let A = ( μ A , γ A ) and B = ( μ B , γ B ) be IVIF n-fold implicative filters of H . Define A B = ( μ A B , γ A B ) by
μ A B ( h x ) = r min { μ A ( h x ) , μ B ( h x ) } , γ A B ( h x ) = r max { γ A ( h x ) , γ B ( h x ) } .
Since μ A ( 1 ) μ A ( h x ) and μ B ( 1 ) μ B ( h x ) , we have
μ A B ( 1 ) μ k A B ( h x ) .
Similarly,
γ A B ( 1 ) γ A B ( h x ) .
Let h x , h y , h z H . Since A and B are IVIF n-fold implicative filters of H , we have
r min { μ A ( Δ h x n ( h y , h z ) ) , μ A ( h x ) } μ A ( h y ) ,
and
r min { μ B ( Δ h x n ( h y , h z ) ) , μ B ( h x ) } μ B ( h y ) .
Since μ A B ( x ) = min { μ A ( x ) , μ B ( x ) } for all x H , it follows that
r min { μ A B ( Δ h x n ( h y , h z ) ) , μ A B ( h x ) } = min { r min { μ A ( Δ h x n ( h y , h z ) ) , μ A ( h x ) } , r min { μ B ( Δ h x n ( h y , h z ) ) , μ B ( h x ) } } min { μ A ( h y ) , μ B ( h y ) } = μ A B ( h y ) .
Similarly, since γ A B ( x ) = max { γ A ( x ) , γ B ( x ) } for all x H , we obtain
r max { γ A B ( Δ h x n ( h y , h z ) ) , γ A B ( h x ) } γ A B ( h y ) .
Hence, A B is an IVIF n-fold implicative filter of H .   □
Corollary 1.
If A = ( μ A , γ A ) is an IVIF n-fold implicative filter of H , then its complement A ¯ = ( μ A ¯ , γ A ¯ ) is also an IVIF n-fold implicative filter of H .
Definition 11.
Let A = { h x , μ A ( h x ) , γ A ( h x ) : h x H } be an IVIFS on H . The operators A and A are defined by
A = { h x , μ A ( h x ) , μ A ¯ ( h x ) : h x H } ,
and
A = { h x , γ A ¯ ( h x ) , γ A ( h x ) : h x H } .
To facilitate the construction and verification of derived interval-valued intuitionistic fuzzy sets (IVIFS) through the operators ⊕ and ⊗, we provide a pseudocode that systematically generates the sets A and A from a given IVIFS A = { h x , μ A ( h x ) , γ A ( h x ) : h x H } on a hoop H . This procedure computes the respective complements of the membership and non-membership intervals for each element and assembles the resulting sets in accordance with Definition 11.
Algorithm 2 describes the process for constructing the sets A and A from an interval-valued intuitionistic fuzzy set A on a hoop H . For each element h x H , the algorithm computes the complement intervals μ A ¯ ( h x ) and γ A ¯ ( h x ) as specified in Definition 11 and assembles the resulting ordered pairs into the sets A and A .
This systematic approach ensures that the operators ⊕ and ⊗ are applied consistently, yielding derived IVIFS that reflect the intended structure and properties as defined.
Algorithm 2: Construction of A and A for an IVIFS on a Hoop
Axioms 15 00221 i003
Example 2.
Consider the hoop algebra ( H , , , 1 ) given in Example 1 together with the interval-valued intuitionistic fuzzy set A = ( μ A , γ A ) defined therein.
Since A is an interval-valued intuitionistic fuzzy n-fold implicative filter of H (see Example 1), it satisfies condition (11) as well as inequality (13). By Definition 11, the IVIFS’s A and A are obtained by interchanging the membership and non-membership functions. Consequently, the defining inequalities in Definition 10 remain valid for both A and A .
Therefore, A and A satisfy condition (13) of Definition 10, and hence they are interval-valued intuitionistic fuzzy n-fold implicative filters of the hoop algebra H .
Theorem 5.
Let A = { h x , μ A ( h x ) , γ A ( h x ) h x H } be an IVIF n-fold implicative filter of a hoop algebra H . Then both A and A are IVIF n-fold implicative filters of H .
Proof. 
Assume that A = ( μ A , γ A ) is an IVIF n-fold implicative filter of H .
(i)    The case of A . For any h x H , since μ A ( 1 ) μ A ( h x ) , we have
μ A ¯ ( 1 ) = 1 μ A ( 1 ) 1 μ A ( h x ) = μ A ¯ ( h x ) .
Let h x , h y , h z H . Then
μ A ¯ ( h y ) = 1 μ A ( h y ) 1 r min { μ A ( Δ h x n ( h y , h z ) ) , μ A ( h x ) } = max { 1 r μ A ( Δ h x n ( h y , h z ) ) , 1 r μ A ( h x ) } .
Hence A satisfies the defining conditions of an IVIF n-fold implicative filter.
(ii)    The case of A . For any h x H , since γ A ( 1 ) γ A ( h x ) , we obtain
γ A ¯ ( 1 ) = 1 γ A ( 1 ) 1 γ A ( h x ) = γ A ¯ ( h x ) .
Let h x , h y , h z H . Then
γ A ¯ ( h y ) = 1 γ A ( h y ) 1 r max { γ A ( Δ h x n ( h y , h z ) ) , γ A ( h x ) } = min { 1 r γ A ( Δ h x n ( h y , h z ) ) , 1 r γ A ( h x ) } .
Thus A is also an IVIF n-fold implicative filter of H .    □
Example 3.
Let H = { 0 , 1 , 2 , 3 , 4 , 5 , 6 } be the hoop algebra with operations ⊙ and → as in Example 1. Define the interval-valued intuitionistic fuzzy set A = ( μ A , γ A ) by
μ A ( h x ) = [ 0.7 , 0.8 ] , γ A ( h x ) = [ 0.1 , 0.2 ] , h x H .
As shown in Example 1, A is an IVIF n-fold implicative filter of H .
Now, consider the fuzzy complement sets:
A = ( μ A ¯ , γ A ) , where μ A ¯ ( h x ) = [ 1 0.8 , 1 0.7 ] = [ 0.2 , 0.3 ] ,
A = ( μ A , γ A ¯ ) , where γ A ¯ ( h x ) = [ 1 0.2 , 1 0.1 ] = [ 0.8 , 0.9 ] ,
for all h x H .
Let us verify that A and A are IVIF n-fold implicative filters of H .
  • Case 1: A . Since μ A ¯ is constant, for any h x , h y , h z H ,
    μ A ¯ ( h x ) = [ 0.2 , 0.3 ] , μ A ¯ ( h y ) = [ 0.2 , 0.3 ] .
    For any interval-valued operation,
    r min { μ A ¯ ( Δ h x n ( h y , h z ) ) , μ A ¯ ( h x ) } = [ 0.2 , 0.3 ] ,
    so
    [ 0.2 , 0.3 ] [ 0.2 , 0.3 ]
    holds for all h x , h y , h z .
  • Case 2: A . Since γ A ¯ is constant,
    γ A ¯ ( h x ) = [ 0.8 , 0.9 ] , γ A ¯ ( h y ) = [ 0.8 , 0.9 ] .
    For any interval-valued operation,
    r max { γ A ¯ ( Δ h x n ( h y , h z ) ) , γ A ¯ ( h x ) } = [ 0.8 , 0.9 ] ,
    so
    [ 0.8 , 0.9 ] [ 0.8 , 0.9 ]
    holds for all h x , h y , h z .
  • Thus, both A and A are IVIF n-fold implicative filters of H , as required by the theorem.
Theorem 6.
An IVIFS A = { x , μ A ( h x ) , γ A ( h x ) : h x H } is an IVIF n-fold implicative filter of H if and only if for every [ e 1 , e 2 ] , [ f 1 , f 2 ] D [ 0 , 1 ] , the sets U ( μ A , [ e 1 , e 2 ] ) and L ( γ A , [ f 1 , f 2 ] ) are either empty or n-fold implicative filters of H .
Proof. 
(⇒) Let A = ( μ A , γ A ) be an IVIF n-fold implicative filter of H and let [ f 1 , f 2 ] , [ e 1 , e 2 ] D [ 0 , 1 ] such that U ( μ A , [ e 1 , e 2 ] ) and L ( γ A , [ f 1 , f 2 ] ) .
Since μ A ( 1 ) [ e 1 , e 2 ] and γ A ( 1 ) [ f 1 , f 2 ] , we have
1 U ( μ A , [ e 1 , e 2 ] ) L ( γ A , [ f 1 , f 2 ] ) .
Let h x , h y , h z H such that Δ h x n ( h y , h z ) , h x U ( μ A , [ e 1 , e 2 ] ) .
Then
μ A ( Δ h x n ( h y , h z ) ) e 1 and μ A ( h x ) e 1 .
Since A is an IVIF n-fold implicative filter, we have
μ A ( h y ) min { μ A ( Δ h x n ( h y , h z ) ) , μ A ( h x ) } [ e 1 , e 2 ] ,
which implies that h y U ( μ A , [ e 1 , e 2 ] ) . Hence, U ( μ A , [ e 1 , e 2 ] ) is an n-fold implicative filter of H .
Similarly, let Δ h x n ( h y , h z ) , h x L ( γ A , [ f 1 , f 2 ] ) . Then
γ A ( Δ h x n ( h y , h z ) ) [ f 1 , f 2 ] and γ A ( h x ) [ f 1 , f 2 ] .
Since A is an IVIF n-fold implicative filter, we obtain
γ A ( h y ) max { γ A ( Δ h x n ( h y , h z ) ) , γ A ( h x ) } [ f 1 , f 2 ] .
Therefore, h y L ( γ A , [ f 1 , f 2 ] ) , and hence L ( γ A , [ f 1 , f 2 ] ) is an n-fold implicative filter of H .
(⇐) Assume that every nonempty set U ( μ A , [ e 1 , e 2 ] ) and L ( γ A , [ f 1 , f 2 ] ) is an n-fold implicative filter of H .
If μ A ( 1 ) μ A ( h x ) does not hold for some h x H , then there exists h x 0 H such that μ A ( 1 ) < μ A ( h x 0 ) . Choose
[ e 1 , e 2 ] = 1 2 μ A ( 1 ) + μ A ( h x 0 ) .
Then h x 0 U ( μ A , [ t 1 , t 2 ] ) , so U ( μ A , [ e 1 , e 2 ] ) . Since it is a filter, 1 U ( μ A , [ t 1 , t 2 ] ) , which yields μ A ( 1 ) [ e 1 , e 2 ] , a contradiction. Hence μ A ( 1 ) μ A ( h x ) for all h x H .
A similar argument shows that γ A ( 1 ) γ A ( h x ) for all h x H .
Now suppose that
μ A ( h y ) r min { μ A ( Δ h x n ( h y , h z ) ) , μ A ( h x ) } .
does not hold for some h x , h y , h z H . Then there exist u 0 , v 0 , w 0 H such that
μ A ( v 0 ) < r min { μ A ( Δ u 0 n ( v 0 , w 0 ) ) , μ A ( u 0 ) } .
Choose
[ p 1 , p 2 ] = 1 2 μ A ( v 0 ) + r min { μ A ( Δ u 0 n ( v 0 , w 0 ) ) , μ A ( u 0 ) } .
Then Δ u 0 n ( v 0 , w 0 ) , u 0 U ( μ A , [ p 1 , p 2 ] ) but v 0 U ( μ A , [ p 1 , p 2 ] ) , contradicting the filter property. Hence the inequality holds.
An analogous argument shows that
γ A ( y ) r max { γ A ( Δ x n ( y , z ) ) , γ A ( h x ) }
for all h x , h y , h z H . Therefore, A is an IVIF n-fold implicative filter of H .    □
Theorem 7.
Let A = ( μ A , γ A ) be an IVIF n-fold implicative filter of H . Then the following equalities hold:
( h x , h y H ) μ A ( ( h x n h y ) h y ) = μ A ( ( h y n h x ) h x ) γ A ( ( h x n h y ) h y ) = γ A ( ( h y n h x ) h x ) .
Proof. 
Let A = ( μ A , γ A ) be an IVIF n-fold implicative filter of H . By Theorem 6, for any [ f 1 , f 2 ] , [ e 1 , e 2 ] D [ 0 , 1 ] , the nonempty sets U ( μ A , [ e 1 , e 2 ] ) and L ( γ A , [ f 1 , f 2 ] ) are n-fold implicative filters of H .
Let
[ e 1 , e 2 ] = μ A ( h x n h y ) h y and [ f 1 , f 2 ] = γ A ( h x n h y ) h y .
Then
( h x n h y ) h y U ( μ A , [ e 1 , e 2 ] ) L ( γ A , [ f 1 , f 2 ] ) .
By Proposition 1(2), we have h y n ( h y n h x ) h x . Moreover, by Proposition 1(4),
( h x n h y ) h y ( h x n h y ) ( h y n h x ) .
Hence,
( h x n h y ) ( h y n h x ) h x U ( μ A , [ e 1 , e 2 ] ) L ( γ A , [ f 1 , f 2 ] ) .
Similarly, since h x ( h y n h x ) h x , Proposition 1(4) yields
( ( h y n h x ) h x ) h y h x h y ,
and consequently,
( h x h y ) ( ( h y n h x ) h x ) ( ( ( h y n h x ) h x ) h y ) ( ( h y n h x ) h x ) .
Thus,
( ( ( h y n h x ) h x ) h y ) ( ( h y n h x ) h x ) U ( μ A , [ e 1 , e 2 ] ) L ( γ A , [ f 1 , f 2 ] ) .
Since U ( μ A , [ e 1 , e 2 ] ) and L ( γ A , [ f 1 , f 2 ] ) are n-fold implicative filters, Proposition 1(3) implies
1 ( ( ( h y n h x ) h x ) h y ) ( ( h y n h x ) h x ) U ( μ A , [ e 1 , e 2 ] ) L ( γ A , [ f 1 , f 2 ] ) .
Furthermore, 1 U ( μ A , [ e 1 , e 2 ] ) L ( γ A , [ f 1 , f 2 ] ) and ( h y n h x ) h x U ( μ A , [ e 1 , e 2 ] ) L ( γ A , [ f 1 , f 2 ] ) . Hence,
[ e 1 , e 2 ] μ A ( h y n h x ) h x and [ f 1 , f 2 ] γ A ( h y n h x ) h x .
Therefore,
μ A ( h x n h y ) h y μ A ( h y n h x ) h x μ A ( h y n h x ) h x ,
and
γ A ( h x n h y ) h y γ A ( h y n h x ) h x .
By symmetry, the reverse inequalities also hold, and hence
μ A ( h x n h y ) h y = μ A ( h y n h x ) h x ,
and
γ A ( h x n h y ) h y = γ A ( h y n h x ) h x .
   □
Example 4.
Consider the hoop algebra H = { 0 , 1 , 2 , 3 , 4 , 5 , 6 } with the binary operations ⊙ and → as described in Example 1. Let n be any positive integer and define the interval-valued intuitionistic fuzzy set A = ( μ A , γ A ) on H by
μ A ( h x ) = [ 0.7 , 0.8 ] , γ A ( h x ) = [ 0.1 , 0.2 ] , h x H .
As shown in Example 1, A is an IVIF n-fold implicative filter of H .
Let us verify the equalities in Theorem 7 for arbitrary h x , h y H :
μ A ( ( h x n h y ) h y ) = μ A ( ( h y n h x ) h x ) ,
and
γ A ( ( h x n h y ) h y ) = γ A ( ( h y n h x ) h x ) .
Since μ A and γ A are constant functions,
μ A ( ( h x n h y ) h y ) = [ 0.7 , 0.8 ] , μ A ( ( h y n h x ) h x ) = [ 0.7 , 0.8 ] ,
γ A ( ( h x n h y ) h y ) = [ 0.1 , 0.2 ] , γ A ( ( h y n h x ) h x ) = [ 0.1 , 0.2 ] .
Therefore, for all h x , h y H , the equalities in Theorem 7 are satisfied.
This example demonstrates that the equalities in Theorem 7 hold for the IVIF n-fold implicative filter defined in Example 1.
For any fixed interval numbers r ˜ + , r ˜ , s ˜ + , s ˜ [ [ 0 , 1 ] ] such that r ˜ + r ˜ , s ˜ + s ˜ and a nonempty subset G of H , the IVIS
A G r ˜ + , s ˜ r ˜ , s ˜ + = H , μ A G r ˜ + r ˜ , γ A G s ˜ s ˜ +
in H , where
μ A G r ˜ + r ˜ ( h x ) = r ˜ + if h x G r ˜ o t h e r w i s e ,
γ A G s ˜ s ˜ + ( h x ) = s ˜ if h x G s ˜ + o t h e r w i s e .
Lemma 2.
If the constant 1 of H is in a nonempty subset G of H , then the IVIFS
A G = H , μ A G r ˜ + r ˜ , γ A G s ˜ s ˜ +
satisfies the conditions (11).
Proof. 
If 1 G , then μ A G r ˜ + r ˜ ( 1 ) = r ˜ + , and γ A G s ˜ s ˜ + ( 1 ) = s ˜ . Thus,
( h x H ) μ A G r ˜ + r ˜ ( 1 ) = r ˜ + μ A G r ˜ + r ˜ ( h x ) γ A G s ˜ s ˜ + ( 1 ) = s ˜ γ A G s ˜ s ˜ + ( h x ) .
Hence A G r ˜ + , s ˜ r ˜ , s ˜ + satisfies the conditions (11).    □
Lemma 3.
If the IVIS
A G = H , μ A G r ˜ + r ˜ , γ A G s ˜ s ˜ +
in H satisfies the condition (11), then the constant 1 of H is in the nonempty subset G of H .
Proof. 
Assume that A G satisfies the condition (11). Then, for all h x H ,
μ A G r ˜ + r ˜ ( 1 ) μ A G r ˜ + r ˜ ( h x ) .
Since G is nonempty, there exists g G . By the definition of μ A G ,
μ A G r ˜ + r ˜ ( g ) = r ˜ + .
Hence,
μ A G r ˜ + r ˜ ( 1 ) μ A G r ˜ + r ˜ ( g ) = r ˜ + μ A G r ˜ + r ˜ ( 1 ) ,
which implies
μ A G r ˜ + r ˜ ( 1 ) = r ˜ + .
Therefore, 1 G .    □
Theorem 8.
The IVIS
A G = H , μ A G r ˜ + r ˜ , γ A G s ˜ s ˜ +
in H is an IVIF n-fold implicative filter of H if and only if the nonempty subset G of H is an n-fold implicative filter of H .
Proof. 
Assume that A G is an IVIF n-fold implicative filter of H . Since A G satisfies condition (17), by Lemma 3, 1 G .
Let h x , h y , h z H with Δ h x n ( h y , h z ) , h x G . Then
μ A G r ˜ + r ˜ ( Δ h x n ( h y , h z ) ) = a ˜ + = μ A G r ˜ + r ˜ ( h x ) .
Hence,
μ A G a ˜ + r ˜ ( h y ) r min μ A G r ˜ + r ˜ ( Δ h x n ( h y , h z ) ) , μ A G r ˜ + r ˜ ( h x ) = r ˜ + .
Thus μ A G ( h y ) = r ˜ + , so y G . Therefore, G is an n-fold implicative filter of H .
Conversely, assume that G is an n-fold implicative filter of H . Since 1 G , by Lemma 2, A G satisfies condition (17).
Case 1: Suppose Δ h x n ( h y , h z ) , h x G . Then
μ A G ( Δ h x n ( h y , h z ) ) = μ A G ( h x ) = r ˜ + , γ A G ( Δ h x n ( h y , h z ) ) = γ A G ( h x ) = s ˜ .
Since G is an n-fold implicative filter, h y G , hence
μ A G ( h y ) = r ˜ + , γ A G ( h y ) = s ˜ .
Case 2: Suppose Δ h x n ( h y , h z ) G or h x G . Then
μ A G ( Δ h x n ( h y , h z ) ) = r ˜ or μ A G ( h x ) = a ˜ ,
and
γ A G ( Δ h x n ( h y , h z ) ) = s ˜ + or γ A G ( h x ) = s ˜ + .
Hence,
r min { μ A G ( Δ h x n ( h y , h z ) ) , μ A G ( h x ) } = r ˜ , r max { γ A G ( Δ h x n ( h y , h z ) ) , γ A G ( h x ) } = s ˜ + .
Therefore,
μ A G ( h y ) r ˜ , γ A G ( h y ) s ˜ + .
Thus, A G is an IVIF n-fold implicative filter of H .    □

4. Conclusions

In this paper, we have established several equivalent characterizations of interval-valued intuitionistic fuzzy n-fold implicative filters in finite hoop algebras. The main technical contributions include the equivalence between the n-fold implicative filter property and explicit interval conditions involving the Δ n operation, a schematic roadmap clarifying logical dependencies and a proof structure (see Remark 2), computational algorithms for explicit verification in finite cases, and closure properties under standard constructions such as intersection, complement, and derived operators. These results unify and extend classical fuzzy filter theory, demonstrating that interval-valued intuitionistic fuzzy filters and their n-fold counterparts can be systematically characterized and verified.
Our study is currently restricted to finite hoop algebras and interval-valued intuitionistic fuzzy sets with constant or piecewise-defined intervals. The structural properties and technical advantages of hoop algebras, as previously established in [5,6,7,8,9,10], provide a robust foundation for these results. Extending these findings to infinite algebras, more general residuated structures, or dynamic fuzzy systems remains an open challenge. Computational verification is feasible only for finite cases, and further research is needed for algorithmic approaches in infinite settings.
The findings suggest potential applications in logical systems and decision-making contexts where uncertainty and iterative implication are central. Future work may include exploring homomorphic images, categorical properties, and dynamic versions of interval-valued intuitionistic fuzzy filters.
By introducing interval-valued intuitionistic fuzzy n-fold implicative filters in hoop algebras, we have extended several existing notions of implicative-type filters within this framework. Fundamental properties and characterizations have been established, and the relationships between interval-valued intuitionistic fuzzy implicative filters and their n-fold counterparts have been clarified. Several known results regarding fuzzy and intuitionistic fuzzy filters are shown to be special cases of our main findings, enriching the theory of hoop algebras and providing a unified perspective for higher-order implicative structures under interval-valued intuitionistic fuzziness. The included examples illustrate the nontriviality and applicability of the introduced concepts, further supported by the rich structural results in hoop theory [7,8,9,10].
The results open several avenues for further research, such as investigating interval-valued intuitionistic fuzzy n-fold implicative filters in more general algebraic structures like residuated lattices, BL-algebras, or related logical algebras, and studying homomorphic images and categorical properties. Applications in logical systems and decision-making problems, where uncertainty and graded implication are significant, as well as dynamic or parameterized versions of interval-valued intuitionistic fuzzy filters, are promising directions for future exploration.
The proposed structures based on interval-valued intuitionistic fuzzy sets (IVIFS) are inherently designed to handle uncertainty and graded implication, as highlighted in previous literature [19,20]. In decision-making contexts, uncertainty evolves over time, requiring models that accommodate dynamic changes in information. The IVIFS framework, with interval-valued membership and non-membership functions, is well-suited for such scenarios: intervals can be updated or recalibrated as new data becomes available, reflecting the temporal evolution of uncertainty.
For instance, in multi-criteria decision-making problems, the algorithm by Gomathi Nayagam et al. [20] shows how IVIFS can aggregate and rank alternatives under changing information. Our proposed algorithm can be adapted to time-varying uncertainty by allowing the intervals associated with each criterion or logical proposition to be functions of time or sequential observations. This enables the model to capture both the current state and progression of uncertainty, making it applicable to real-world problems such as forecasting, adaptive control, or dynamic resource allocation.
Consider a scenario where the reliability of information sources fluctuates over time. By representing membership and non-membership degrees as evolving intervals, the IVIFS-based algorithm can continually update the assessment of alternatives, providing robust solutions under time-varying uncertainty.
In summary, this paper introduces and systematically characterizes interval-valued intuitionistic fuzzy n-fold implicative filters in hoop algebras, providing explicit equivalence theorems, computational verification algorithms, and closure properties. The proposed framework extends classical fuzzy filter theory, offering new tools for managing uncertainty and graded implication in algebraic structures. Future research may explore generalizations to infinite algebras, residuated lattices, and dynamic fuzzy systems, as well as applications in decision-making and logical systems where interval-valued uncertainty is essential.

Author Contributions

Conceptualization, A.S.A., T.O., R.K.B., R.N. and I.S.; methodology, A.S.A., T.O., R.K.B., R.N. and I.S.; writing, A.S.A., T.O., R.K.B., R.N. and I.S.; writing—review and editing, T.O., R.K.B., R.N. and I.S.; visualization, A.S.A., T.O., R.K.B. and R.N.; supervision, T.O., R.K.B. and R.N.; funding acquisition, 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 (PNURSP2026R231).

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding authors.

Acknowledgments

The authors extend their sincere gratitude to the anonymous reviewers for their insightful suggestions and constructive feedback, which have greatly enhanced the quality and clarity of this article. The authors extend their appreciation to Princess Nourah bint Abdulrahman University for funding this research under Researchers Supporting Project number (PNURSP2026R231), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

Below is a Python code that checks all possible combinations of ( h x , h y , h z ) H for the conditions in Definition 10 for Example 1. Variables and functions are chosen as ( H ) , ( h x ) , ( h y ) , ( h z ) , ( μ A ) , and ( γ A ) . Since verifying that all conditions are satisfied for Example 1 requires checking numerous combinations, the correctness of the example is demonstrated with the aid of this code. This computational approach is particularly valuable for confirming the validity of Example 1, ensuring that the interval-valued intuitionistic fuzzy n-fold implicative filter properties are rigorously tested and verified.
# Set and operation tables
kH = [0, 1, 2, 3, 4, 5, 6]
  
rightarrow = [
[1, 1, 2, 1, 1, 1, 1],
[0, 1, 2, 3, 4, 5, 6],
[1, 1, 1, 1, 1, 1, 1],
[0, 1, 2, 1, 1, 5, 6],
[0, 1, 2, 3, 1, 5, 6],
[0, 1, 2, 1, 1, 1, 6],
[1, 2, 1, 1, 1, 1, 1]
]
  
odot = [
[0, 0, 2, 0, 0, 0, 0],
[0, 1, 2, 3, 4, 5, 6],
[2, 2, 2, 2, 2, 2, 2],
[0, 3, 2, 3, 3, 5, 6],
[0, 4, 2, 3, 4, 5, 6],
[0, 5, 2, 5, 5, 5, 6],
[0, 6, 2, 6, 6, 6, 0]
]
  
def mu_kA(kx):      # (\mu_\kA(\kx))
return (0.7, 0.8)
  
def gamma_kA(kx):   # (\gamma_\kA(\kx))
return (0.1, 0.2)
  
def rmin(a, b):     # rmin([a_l, a_u], [b_l, b_u])
return (min(a[0], b[0]), min(a[1], b[1]))
  
def rmax(a, b):     # rmax([a_l, a_u], [b_l, b_u])
return (max(a[0], b[0]), max(a[1], b[1]))
  
def odot_pow(ky, n):
res = ky
for _ in range(n - 1):
res = odot[res][ky]
return res
  
def Delta(kx, ky, kz, n):
kyn = odot_pow(ky, n)
idx = rightarrow[kyn][kz]
return rightarrow[kx][rightarrow[idx][ky]]
  
n = 2
all_ok = True
  
for kx in kH:
for ky in kH:
for kz in kH:
delta = Delta(kx, ky, kz, n)
mu_ky = mu_kA(ky)
mu_kx = mu_kA(kx)
mu_delta = mu_kA(delta)
gamma_ky = gamma_kA(ky)
gamma_kx = gamma_kA(kx)
gamma_delta = gamma_kA(delta)
  
min_mu = rmin(mu_delta, mu_kx)
max_gamma = rmax(gamma_delta, gamma_kx)
  
# Check: mu_kA(ky) >= rmin(mu_kA(delta), mu_kA(kx))
if mu_ky[0] < min_mu[0] or mu_ky[1] < min_mu[1]:
all_ok = False
  
# Check: gamma_kA(ky) <= rmax(gamma_kA(delta), gamma_kA(kx))
if gamma_ky[0] > max_gamma[0] or gamma_ky[1] > max_gamma[1]:
all_ok = False
  
if all_ok:
print("All conditions are satisfied for every (kx, ky, kz) in kH.")
else:
print("Some conditions failed.")

References

  1. Hájek, P. Mathematics of Fuzzy Logic; Kluwer Academic Publishers: Dordrecht, The Netherlands, 1988; pp. 1–314. [Google Scholar]
  2. Cignoli, R.; D’Ottaviano, I.M.L.; Mundici, D. Algebraic Foundations of Many-Valued Reasoning; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2000; pp. 1–376. [Google Scholar]
  3. Esteva, F.; Godo, L. Monoidal t-norm based logic: Towards a logic for left-continuous t-norms. Fuzzy Sets Syst. 2001, 124, 271–288. [Google Scholar] [CrossRef]
  4. Kowalski, T.; Ono, H. Residuated Lattices: An Algebraic Glimpse at Logic Without Contraction; Japan Advanced Institute of Science and Technology: Ishikawa, Japan, 2001; pp. 1–200. [Google Scholar]
  5. Bosbach, B. Komplementäre Halbgruppen. Axiomatik und Arithmetik. Fundam. Math. 1969, 64, 257–287. [Google Scholar] [CrossRef]
  6. Bosbach, B. Komplementäre Halbgruppen. Kongruenzen und Quotienten. Fundam. Math. 1970, 69, 1–14. [Google Scholar] [CrossRef]
  7. Borzooei, R.A.; Aaly Kologani, M. Stabilizer topology of hoops. Algebr. Struct. Appl. 2014, 1, 35–48. [Google Scholar]
  8. Borzooei, R.A.; Aaly Kologani, M. Local and perfect semihoops. J. Intell. Fuzzy Syst. 2015, 29, 223–234. [Google Scholar] [CrossRef]
  9. Borzooei, R.A.; Aaly Kologani, M. On ideal theory of hoops. Math. Bohem. 2020, 145, 141–162. [Google Scholar]
  10. Namdar, A.; Borzooei, R.A.; Borumand Saeid, A.; Aaly Kologani, M. Some results in hoop algebras. J. Intell. Fuzzy Syst. 2017, 32, 1805–1813. [Google Scholar] [CrossRef]
  11. Oner, T.; Rajesh, N.; Bandaru, R.K.; Bordbar, H. An Investigation into Bipolar Fuzzy Hoop Algebras and Their Applications. Axioms 2025, 14, 338. [Google Scholar] [CrossRef]
  12. Aglianó, P.; Ferreirim, I.M.A.; Montagna, F. Basic hoops: An algebraic study of continuous t-norms. Stud. Log. 2007, 87, 73–98. [Google Scholar] [CrossRef]
  13. Georgescu, G.; Leustean, L.; Preoteasa, V. Pseudo-hoops. J. Mult.-Valued Logic Soft Comput. 2005, 11, 153–184. [Google Scholar]
  14. Kondo, M. Some types of filters in hoops. In Proceedings of the 2011 41st IEEE International Symposium on Multiple-Valued Logic; IEEE: New York, NY, USA, 2011; pp. 50–53. [Google Scholar]
  15. Atanassov, K.T. Intuitionistic sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  16. Borzooei, R.A.; Aaly Kologani, M. Filter theory of hoop-algebras. J. Adv. Res. Pure Math. 2014, 6, 72–86. [Google Scholar] [CrossRef]
  17. Namdar, A.; Borumand Saeid, A. Study hoop algebras by fuzzy (n-fold) obstinate filters. Topol. Algebra Appl. 2023, 11, 20230107. [Google Scholar] [CrossRef]
  18. Atanassov, K.; Gargov, G. Interval-valued intuitionistic fuzzy sets. Fuzzy Sets Syst. 1989, 31, 343–349. [Google Scholar] [CrossRef]
  19. Nayagama, L.G.; Sivaraman, G. Ranking of interval-valued intuitionistic fuzzy sets. Appl. Soft Comput. 2011, 11, 3368–3372. [Google Scholar] [CrossRef]
  20. Gomathi Nayagam, V.L.; Muralikrishnan, S.; Sivaraman, G. Multi-criteria decision-making method based on interval-valued intuitionistic fuzzy sets. Expert Syst. Appl. 2011, 38, 1464–1467. [Google Scholar] [CrossRef]
  21. Akram, M.U.H.; Dar, K.H.; Meng, B.L.; Shum, K.P. Interval-valued intuitionistic fuzzy ideals of K-algebras. WSEAS Trans. Math. 2008, 7, 559–565. [Google Scholar]
Table 1. Cayley table of the binary operation →.
Table 1. Cayley table of the binary operation →.
0123456
01121111
10123456
21111111
30121156
40123156
50121116
61211111
Table 2. Cayley table of the binary operation ⊙.
Table 2. Cayley table of the binary operation ⊙.
0123456
00020000
10123456
22222222
30323356
40423456
50525556
60626660
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

S. Alali, A.; Oner, T.; Bandaru, R.K.; Neelamegarajan, R.; Senturk, I. Interval-Valued Intuitionistic Fuzzy n-Fold Implicative Filters in Hoop Algebra. Axioms 2026, 15, 221. https://doi.org/10.3390/axioms15030221

AMA Style

S. Alali A, Oner T, Bandaru RK, Neelamegarajan R, Senturk I. Interval-Valued Intuitionistic Fuzzy n-Fold Implicative Filters in Hoop Algebra. Axioms. 2026; 15(3):221. https://doi.org/10.3390/axioms15030221

Chicago/Turabian Style

S. Alali, Amal, Tahsin Oner, Ravi Kumar Bandaru, Rajesh Neelamegarajan, and Ibrahim Senturk. 2026. "Interval-Valued Intuitionistic Fuzzy n-Fold Implicative Filters in Hoop Algebra" Axioms 15, no. 3: 221. https://doi.org/10.3390/axioms15030221

APA Style

S. Alali, A., Oner, T., Bandaru, R. K., Neelamegarajan, R., & Senturk, I. (2026). Interval-Valued Intuitionistic Fuzzy n-Fold Implicative Filters in Hoop Algebra. Axioms, 15(3), 221. https://doi.org/10.3390/axioms15030221

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