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 -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.
3. IVIF -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 be a hoop algebra. For the sake of readability, throughout this paper we use the notation instead of and instead of for arbitrary elements .
Lemma 1. Let be a hoop algebra, and let for . The following order-related properties hold:
- 1.
for all .
- 2.
If , then .
- 3.
is monotone in y.
- 4.
For all , (see Proposition 1(4)).
Proof. - 1.
By Proposition 1(4), for all , .
- 2.
Suppose . Then , and since the implication operation is order-reversing in the antecedent, . Thus, .
- 3.
Monotonicity in y follows since for , , and thus .
- 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 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 be a hoop algebra. An IVIFS on is called an IVIF n-fold implicative filter of if it satisfies condition (11) together with the following condition: 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 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 and provides a reliable decision procedure.
Algorithm 1 is designed to verify whether a given interval-valued intuitionistic fuzzy set
forms an IVIF
n-fold implicative filter of a hoop algebra
according to Definition 10. The procedure iterates over all triples of elements
, computes the
n-fold implicative operation
, 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 Axioms 15 00221 i001]() |
For each triple, the algorithm verifies the following requirements:
and
If any of these conditions fails for any triple, the algorithm immediately returns False, indicating that
does not satisfy the definition. If all conditions hold for every triple, the algorithm returns True, confirming that
is an IVIF
n-fold implicative filter of
. This systematic approach guarantees thorough and reliable verification in accordance with Definition 10.
Example 1. The binary operations → and ⊙ on the set 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 on by Consider the elementfor all , where denotes the n-fold product of under ⊙. According to Definition 10, we must verifyandfor all , whereand Since and are constant for all elements,andThus, the inequalitieshold for every choice of . The code provided in the Appendix A Section demonstrates that all conditions required by Definition 10 are satisfied for every . Consequently, is an interval-valued intuitionistic fuzzy n-fold implicative filter of the hoop algebra . Proposition 2. Every IVIF n-fold implicative filter of a hoop algebra is an IVIF filter of .
Proof. Let
be an IVIF
n-fold implicative filter of
and let
. By assumption, condition (
11) is satisfied. Taking
, we obtain
and
Since
, the above inequalities reduce to
and
Hence,
satisfies the defining conditions of an IVIF filter of
, which completes the proof. □
Theorem 2. Let be an IVIF filter of a hoop algebra . Then, for all , the following statements are equivalent:
- 1.
is an IVIF n-fold implicative filter of ;
- 2.
and ;
- 3.
and ;
- 4.
and .
Proof. (1) ⇒ (2). Assume that
is an IVIF
n-fold implicative filter of
. Then, condition (
11) holds. By Proposition 1(3), we have
. Hence,
and
which proves (2).
(2) ⇒ (1). Let
be an IVIF filter of
satisfying (2). For arbitrary
, since
is an IVIF filter, we have
and
By Proposition 1(5),
, which implies
Combining these inequalities with assumption (2), we obtain
and
Therefore,
is an IVIF
n-fold implicative filter of
.
(3) ⇒ (1). Assume that
is an IVIF filter of
satisfying (3). Then
and
Using the assumption
and
, we obtain
and
Consequently,
and
which shows that
is an IVIF
n-fold implicative filter.
(3) ⇒ (4). Taking
in (3), we get
which proves (4).
(4) ⇒ (3). By Proposition 1(3) and (4), we have
Thus,
and (3) follows.
(3) ⇒ (2). For any
, using (3), we obtain
and
This completes the proof. □
The following schematic roadmap illustrates the logical equivalence between the four statements in Theorem 2:
![Axioms 15 00221 i002 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 be two intervals, and recall that the order relation holds if and only if and . The and operators are defined as follows:The compatibility between the interval order and these operators is established as follows: - If , then and . - More generally, for any intervals , and , while and . These properties ensure that the interval order is preserved under and , and justify the inequalities used in the proofs, such aswhenever 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 be an IVIFS of a hoop . Then the following statements hold:
- 1.
is an IVIF n-fold implicative filter of if and only if - 2.
is an IVIF n-fold implicative filter of if and only if
Proof. (1) Suppose that
is an IVIF
n-fold implicative filter of
. Then, by Theorem 2(2), for all
,
Taking
, we immediately obtain
which proves the necessity.
Conversely, assume that
Since
, it follows that
Hence, by Theorem 2(4),
is an IVIF
n-fold implicative filter of
.
(2) Let
be an IVIF
n-fold implicative filter of
. By Theorem 2(2), we have
On the other hand, by Proposition 1(5),
, which implies
Therefore,
Conversely, the sufficiency follows directly from Theorem 2. □
Proposition 3. If is an IVIF n-fold implicative filter of , then it is an IVIF -fold implicative filter of .
Proof. Let
be an IVIF
n-fold implicative filter of
. By Proposition 1(3), we have
for all
. Hence,
which implies
Consequently,
Since
is an IVIF
n-fold implicative filter, by Theorem 2(4),
Thus,
Again by Theorem 2(4),
A is an IVIF
-fold implicative filter of
. □
Proposition 4. If is an IVIF filter of such that and for all , then is an IVIF n-fold implicative filter of .
Proof. Let
. By Proposition 1(3),
, and by Proposition 1(4),
. Hence,
Since
is an IVIF filter, we have
Therefore,
By Theorem 3(1),
A is an IVIF
n-fold implicative filter of
. □
Theorem 4. An IVIFS in is an IVIF n-fold implicative filter of if and only if and are fuzzy n-fold implicative filters of .
Proof. Since , , and , and .
Let
. Then we have
and
Hence
is an IVIF
n-fold implicative filter of
. Conversely, assume that
is an IVIF
n-fold implicative filter of
. Let
. Then
; hence
and
. Let
. Then
Hence,
and
Also
Hence
and
Therefore,
and
are fuzzy
n-fold implicative filters of
. □
Proposition 5. If and are IVIF n-fold implicative filters of , then is an IVIF n-fold implicative filter of .
Proof. Let
and
be IVIF
n-fold implicative filters of
. Define
by
Since
and
, we have
Similarly,
Let
. Since
and
are IVIF
n-fold implicative filters of
, we have
and
Since
for all
, it follows that
Similarly, since
for all
, we obtain
Hence,
is an IVIF
n-fold implicative filter of
. □
Corollary 1. If is an IVIF n-fold implicative filter of , then its complement is also an IVIF n-fold implicative filter of .
Definition 11. Let be an IVIFS on . The operators and are defined byand 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 and from a given IVIFS on a hoop . 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 and from an interval-valued intuitionistic fuzzy set on a hoop . For each element , the algorithm computes the complement intervals and as specified in Definition 11 and assembles the resulting ordered pairs into the sets and .
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 and for an IVIFS on a Hoop |
![Axioms 15 00221 i003 Axioms 15 00221 i003]() |
Example 2. Consider the hoop algebra given in Example 1 together with the interval-valued intuitionistic fuzzy set defined therein.
Since is an interval-valued intuitionistic fuzzy n-fold implicative filter of (see Example 1), it satisfies condition (11) as well as inequality (13). By Definition 11, the IVIFS’s and are obtained by interchanging the membership and non-membership functions. Consequently, the defining inequalities in Definition 10 remain valid for both and . Therefore, and satisfy condition (13) of Definition 10, and hence they are interval-valued intuitionistic fuzzy n-fold implicative filters of the hoop algebra .
Theorem 5. Let be an IVIF n-fold implicative filter of a hoop algebra . Then both and are IVIF n-fold implicative filters of .
Proof. Assume that is an IVIF n-fold implicative filter of .
(i) The case of
. For any
, since
, we have
Let
. Then
Hence satisfies the defining conditions of an IVIF n-fold implicative filter.
(ii) The case of
. For any
, since
, we obtain
Let
. Then
Thus
is also an IVIF
n-fold implicative filter of
. □
Example 3. Let be the hoop algebra with operations ⊙ and → as in Example 1. Define the interval-valued intuitionistic fuzzy set byAs shown in Example 1, is an IVIF n-fold implicative filter of . Now, consider the fuzzy complement sets:for all . Let us verify that and are IVIF n-fold implicative filters of .
Theorem 6. An IVIFS is an IVIF n-fold implicative filter of if and only if for every , the sets and are either empty or n-fold implicative filters of .
Proof. (⇒) Let be an IVIF n-fold implicative filter of and let such that and .
Since
and
, we have
Let such that .
Since
is an IVIF
n-fold implicative filter, we have
which implies that
. Hence,
is an
n-fold implicative filter of
.
Similarly, let
. Then
Since
is an IVIF
n-fold implicative filter, we obtain
Therefore,
, and hence
is an
n-fold implicative filter of
.
(⇐) Assume that every nonempty set and is an n-fold implicative filter of .
If
does not hold for some
, then there exists
such that
. Choose
Then
, so
. Since it is a filter,
, which yields
, a contradiction. Hence
for all
.
A similar argument shows that for all .
Now suppose that
does not hold for some
. Then there exist
such that
Choose
Then
but
, contradicting the filter property. Hence the inequality holds.
An analogous argument shows that
for all
. Therefore,
A is an IVIF
n-fold implicative filter of
. □
Theorem 7. Let be an IVIF n-fold implicative filter of . Then the following equalities hold: Proof. Let be an IVIF n-fold implicative filter of . By Theorem 6, for any , the nonempty sets and are n-fold implicative filters of .
By Proposition 1(2), we have
. Moreover, by Proposition 1(4),
Hence,
Similarly, since
, Proposition 1(4) yields
and consequently,
Thus,
Since
and
are
n-fold implicative filters, Proposition 1(3) implies
Furthermore,
and
. Hence,
Therefore,
and
By symmetry, the reverse inequalities also hold, and hence
and
□
Example 4. Consider the hoop algebra with the binary operations ⊙ and → as described in Example 1. Let n be any positive integer and define the interval-valued intuitionistic fuzzy set on byAs shown in Example 1, is an IVIF n-fold implicative filter of . Let us verify the equalities in Theorem 7 for arbitrary :andSince and are constant functions,Therefore, for all , 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
such that
,
and a nonempty subset
G of
, the IVIS
in
, where
Lemma 2. If the constant 1 of is in a nonempty subset of , then the IVIFSsatisfies the conditions (11). Proof. If
, then
, and
. Thus,
Hence
satisfies the conditions (
11). □
Lemma 3. If the IVISin satisfies the condition (11), then the constant 1 of is in the nonempty subset of . Proof. Assume that
satisfies the condition (
11). Then, for all
,
Since
is nonempty, there exists
. By the definition of
,
Therefore, . □
Theorem 8. The IVISin is an IVIF n-fold implicative filter of if and only if the nonempty subset of is an n-fold implicative filter of . Proof. Assume that
is an IVIF
n-fold implicative filter of
. Since
satisfies condition (
17), by Lemma 3,
.
Let
with
. Then
Hence,
Thus
, so
. Therefore,
is an
n-fold implicative filter of
.
Conversely, assume that
is an
n-fold implicative filter of
. Since
, by Lemma 2,
satisfies condition (
17).
Case 1: Suppose
. Then
Since
is an
n-fold implicative filter,
, hence
Case 2: Suppose
or
. Then
and
Thus, is an IVIF n-fold implicative filter of . □
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 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.