Prevalence and predictors of staff burnout at a tertiary cancer center in Jordan

1.   Introduction

Hoops are algebraic structure which are introduced by B. Bosbach in ^[5,6] are naturally ordered commutative residuated integral monoids. In the last years, some mathematician studied hoop theory in different fields ^{[1,2,3,5,6,7,8,9,10,17,19]}. Most of these results have a very deep relation with fuzzy logic. Particularly, by using of some theorems and notions of finite basic hoops, in ^[1] the authors could find a short proof for completeness theorem for propositional basic logic, which is introduced by Hájek in ^[11]. BL-algebras, the familiar cases of hoops, are the algebraic structures corresponding to basic logic. In algebra of logics, there are some sub-algebras that are very important and have a fundamental role in these algebraic structures. They are very similar to normal subgroups in group theory and ideals in ring theory which we called them filters and by using these notion we can introduce a congruence relation on algebraic structures and study the quotient structure that is made by them. Kondo, in ^[14], introduced different kinds of filters such as implicative, positive implicative and fantastic filters of hoops and investigated some properties of them. Borzooei and Aaly Kologani in ^[7], investigated these filters deeply and they introduced some equivalent characterizations of these filters on hoops. Also, they studied the relation among these filters and they showed some equivalent characterizations of these filters.

Zadeh in ^[21] introduced the notion of fuzzy sets and different kinds of operations on them. After that mathematicians studied on them and applied it to diverse fields. Actually, fuzzy mathematics have reached by studying of fuzzy subsets and their application to mathematical contexts. Nowadays, fuzzy algebra is an important branch of mathematics and mathematicians studied it in different fileds. For example, Rosenfeld in ^[18] studied fuzzy sub-groups in 1971. After using the concept of fuzzy sets to group theory and defined the notion of fuzzy subgroups, in ^[21] by Rosenfeld, the different fuzzy algebraic concepts has been growing very fast ^[12,13,16] and applied in other algebraic structures such as lattices, semigroups, rings, ideals, modules and vector spaces. Moreover, the concepts related to fuzzy sets have been used in various fields, including its use in fuzzy graphs and its application in decision theory. Borzooei and Aaly Kologani in ^[8], studied the notions of fuzzy filter of hoops and the relation among them and characterized some properties of them. Also, they defined a congruence relation on hoops by a fuzzy filter and proved that the quotient structure of this relation is a hoop.

Atanassov for the first time introduced the term, an intuitionistic fuzzy set ^[4] that is an extended form of a fuzzy set. These are the sets containing elements having degrees of membership and non-membership. Intuitionistic fuzzy sets are more adaptable and real intending to the uncertainty and vagueness than the conventional fuzzy sets. The foremost critical property of intuitionistic fuzzy sets not shared by the fuzzy sets is that modular operators can be characterized over intuitionistic fuzzy sets. The intuitionistic fuzzy sets have basically higher depicting conceivable outcomes than fuzzy sets. Also, there are a lot of applications of intuitionistic fuzzy sets in decision making, pattern recognition, medical diagnosis, neural models, image processing, market prediction, color region extraction, and others. In the last years, some mathematician studied intuitionistic fuzzy sets in different fields ^[15,20]. In decision-making problems, the use of fuzzy approaches is ubiquitous. The purpose of these intuitionistic fuzzy sets is, to provide a new approach with useful mathematical tools to address the fundamental problem of decision-making. The generality of the fuzzy set is given special importance, illustrating how many interesting decision-making problems can be formulated as a problem of fuzzy sets. These applied contexts provide solid evidence of the wide applications of fuzzy sets approach to model and research decision-making problems.

Now, in the following we define the notions of intuitionistic fuzzy filters and intuitionistic fuzzy implicative (positive implicative, fantastic) filters on hoops. Then we show that all intuitionistic fuzzy filters make a bounded distributive lattice. Also, by using intuitionistic fuzzy filters we introduce a relation on hoops and show that it is a congruence relation, then we prove that the algebraic structure made by it is a hoop. Finally, we investigate the conditions that quotient structure will be different algebras of logics such as Brouwerian semilattice, Heyting algebra and Wajesberg hoop.

2.   Preliminaries

In this section, we refer to the basic concepts and properties required in the field of hoop and fuzzy sets that we will use in the following sections.

A hoop is an algebraic structure $({H}, {\ast}, { {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}}, 1)$ such that, for any ${d}, {s}, {q}\in {H}$:

$(HP1)$ $({H}, {\ast}, 1)$ is a commutative monoid,

$(HP2)$ ${d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {{d}} = 1$,

$(HP3)$ $({d}{\ast} {{s}}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {{q}} = {d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {{q}})$,

$(HP4)$ ${d}{\ast} ({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {{s}}) = {s}{\ast} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {{d}})$.

On hoop ${H}$, we define the relation ${\preceq}$ by ${d}{\preceq} {{s}}$ iff ${d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {{s}} = 1$. Obviously, $({H}, {\preceq})$ is a poset. A hoop ${H}$ is said to be bounded if ${H}$ has a least element such as $0$, it means that for all ${d}\in {H}$, we have $0{\preceq} {{d}}$. Define ${d}^{0} = 1, \; {d}^{n} = {d}^{n-1}{\ast} {d}$, for any $n\in \mathbb{N}$. If ${H}$ is bounded, then we can introduce a unary operation "$'$" on ${H}$ such that ${d}{'} = {d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}}0$, for any ${d}\in {H}$. The bounded hoop ${H}$ is said to have the double negation property, or (DNP), for short if $({d}{'}){'} = {d}$, for any ${d}\in {H}$ (see ^[1]).

The next proposition provides some properties of hoop.

Proposition 2.1. ^[5,6] Suppose $({H}, {\ast}, { {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}}, 1)$ is a hoop and ${d}, {s}, {q}\in {H}$. Then:

$(i)$ $({H}, {\preceq})$ is a $\wedge$-semilattice with ${d}\wedge{{s}} = {d}{\ast} {({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {{s}})}$.

$(ii)$ ${d}{\ast} {{s}}{\preceq} {{q}}$ iff ${{d}{\preceq} {{s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {{q}}}}$.

$(iii)$ ${d}{\ast} {{s}}{\preceq} {{d}, {s}}$ and ${d}^{n}{\preceq} {d}$, for any $n\in \mathbb{N}$.

$(iv)$ ${d}{\preceq} {{s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {{d}}}$.

$(v)$ $1{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {{d}} = {d}$.

$(vi)$ ${d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {1} = 1$.

$(vii)$ ${d}{\ast} ({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){\preceq} {s}$.

$(viii)$ ${d}{\preceq} ({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}$.

$(ix)$ ${d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}{\preceq} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q})$.

$(x)$ $({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {{s}}){\ast} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {{q}}){\preceq} {d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {{q}}$.

$(xi)$ ${d}{\preceq} {{s}}$ implies ${d}{\ast} {{q}}{\preceq} {{s}{\ast} {{q}}}$.

$(xii)$ ${d}{\preceq} {{s}}$ implies ${q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {{d}}{\preceq} {{q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {{s}}}$.

$(xiii)$ ${d}{\preceq} {{s}}$ implies ${s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {{q}}{\preceq} {{d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {{q}}}$.

$(xiv)$ $(({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s} = {d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}$.

Proposition 2.2. ^[5,6] Suppose ${H}$ is a bounded hoop and ${d}, {s}\in {H}$. Then:

$(i)$ ${d}{\preceq} {d}{''}$.

$(ii)$ ${d}{\ast} {d}{'} = 0$.

$(iii)$ ${d}{'}{\preceq} {d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}$.

Proposition 2.3. ^[10] Let ${H}$ be a hoop and ${d}, {s}\in {H}$. Define a binary operation $\sqcup$ on ${H}$ as ${d}\sqcup {{s}} = (({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {{s}}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {{s}})\wedge(({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {{d}}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {{d}})$. Then for any ${d}, {s}, {q}\in {H}$, the next conditions are equivalent:

$(i)$ $\sqcup$ is associative,

$(ii)$ ${d}{\preceq} {s}$ implies ${d}\sqcup {q}{\preceq} {s}\sqcup {q}$,

$(iii)$ ${d}\sqcup({s}\wedge {q}){\preceq} ({d}\sqcup {s})\wedge ({d}\sqcup {q})$,

$(iv)$ $\sqcup$ is the join operation on ${H}$.

Remark 2.4. A hoop ${H}$ is said to be a $\sqcup$-hoop if $\sqcup$ satisfies in one of the conditions of Proposition 2.3. Note that any $\sqcup$-hoop $({H}, \sqcup, \wedge)$ is a distributive lattice (see ^[10]).

A non-empty subset ${K}$ of ${H}$ is said to be a filter of ${H}$ if $(F1)$: ${d}, {s}\in {K}$ implies ${d}{\ast} {{s}}\in {K}$, $(F2)$: ${d}\in {K}$ and ${d}{\preceq} {s}$ imply ${s}\in {K}$, for any ${d}, {s}\in {H}$. This definition is equal with, if $1\in {K}$ and if ${d}, {d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}\in {K}$, then ${s}\in {K}$, for any ${d}, {s}\in {H}$. We use $\mathcal{F}({H})$ to denote the set of all filters of ${H}$. Clearly, $1\in {K}$, for all ${K}\in \mathcal{F}({H})$. A proper filter is a filter which is not equal to ${H}$. Obviously, a filter is proper iff $0\notin {H}$ if ${H}$ is a bounded hoop. Assume $\emptyset\neq{K}\subseteq{H}$ such that $1\in {K}$. Then ${K}$ is called an implicative filter of ${H}$ if, ${d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} (({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})\in {K}$ and ${d}\in {K}$ imply ${s}\in {K}$, for any ${d}, {s}, {q}\in {H}$, is called a positive implicative filter of ${H}$ if, $({d}{\ast} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}\in {K}$ and ${d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}\in {K}$ imply ${d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}\in {K}$, for any ${d}, {s}, {q}\in {H}$, is called a fantastic filter of ${H}$ if ${q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d})\in {K}$ and ${q}\in {K}$ imply $(({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}\in {K}$, for any ${d}, {s}, {q}\in {H}$ (see ^[10,14]).

Let ${H}$ be a set. A fuzzy set ${\varsigma}$ on ${H}$ is a map ${\varsigma}:{H}\rightarrow [0, 1]$. Let ${\varrho}_{\mathcal{{B}}}, {\varsigma}_{\mathcal{{B}}} : {H}\rightarrow [0, 1]$ be two fuzzy sets on ${H}$ and mapping $\mathcal{{B}}:{H}\rightarrow [0, 1]\times[0, 1]$ is defined by $\mathcal{{B}}({d}) = ({\varsigma}_{\mathcal{{B}}}({d}), {\varrho}_{\mathcal{{B}}}({d}))$, for any ${d}\in {H}$. Then $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ is called an intuitionistic fuzzy set or an IF-set of ${H}$ if ${\varsigma}_{\mathcal{{B}}}(x)+{\varrho}_{\mathcal{{B}}}({d}){\preceq} 1$, for all ${d}\in {H}$ or denoted by $\mathcal{{B}} = \{\langle {d}, {\varsigma}_{\mathcal{{B}}}({d}), {\varrho}_{\mathcal{{B}}}({d}) \rangle\mid {d}\in {H}\}$. The family of all intuitionistic fuzzy sets on ${H}$ will be denoted by $\mathcal{IFS}({H})$. Let $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}}), \mathcal{{C}} = ({\varsigma}_{\mathcal{{C}}}, {\varrho}_{\mathcal{{C}}})\in \mathcal{IFS}({H})$. Then we define $\mathcal{{B}}\cap \mathcal{{C}} = ({\varsigma}_{\mathcal{{B}}}\wedge {\varsigma}_{\mathcal{{C}}}, {\varrho}_{\mathcal{{B}}}\vee {\varrho}_{\mathcal{{C}}}), \; \mathcal{{B}}\cup \mathcal{{C}} = ({\varsigma}_{\mathcal{{B}}}\vee{\varsigma}_{\mathcal{{C}}}, {\varrho}_{\mathcal{{B}}}\wedge {\varrho}_{\mathcal{{C}}})$ and $\mathcal{{B}}\subseteq \mathcal{{C}}$ iff ${\varsigma}_{\mathcal{{B}}}{\preceq} {\varsigma}_{\mathcal{{C}}}, {\varrho}_{\mathcal{{B}}}{\succeq} {\varrho}_{\mathcal{{C}}}$. Let $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ and $\mathcal{{C}} = ({\varsigma}_{\mathcal{{C}}}, {\varrho}_{\mathcal{{C}}})$ be two IF-sets on ${H}$. Then, for any ${d}\in {H}$, we define a relation between them as follows:

A fuzzy set ${\varsigma}$ on hoop ${H}$ is called a fuzzy filter of ${H}$ if for all ${d}, {s}\in {H}$, ${\varsigma}({d}){\preceq} {\varsigma}(1)$ and

Proposition 2.5. ^[8] Let ${\varsigma}$ be a fuzzy filter on hoop ${H}$. Then, for any ${d}, {s}\in {H}$, ${d}{\preceq} {s}$ implies ${\varsigma}({d}){\preceq} {\varsigma}({s})$.

Theorem 2.6. ^[8] Let ${\varsigma}$ be a fuzzy set on hoop ${H}$ and for ${r}\in [0, 1]$ ${\varsigma}_{{r}} = \{{d}\in {H}\mid {\varsigma}({d}){\succeq} {r}\}$. Then ${\varsigma}$ is a fuzzy filter of ${H}$ iff for any ${r}\in[0, 1]$, ${\varsigma}_{{r}}\neq \emptyset$ is a filter of ${H}$.

Theorem 2.7. ^[8] Let ${\varsigma}$ be a fuzzy filter on hoop ${H}$ and fuzzy relation ${\approx}_{{\varsigma}}$ on hoop ${H}$ is defined by

Then ${\approx}_{{\varsigma}}$ is a congruence relation on ${H}$.

Theorem 2.8. ^[8] Suppose ${H}$ is a hoop and $\dfrac{{H}}{{\approx}_{{\varsigma}}} = \{[{e}]_{{\varsigma}}\mid {e}\in {H}\}$. Define the operations $\otimes$ and $\hookrightarrow$ on $\dfrac{{H}}{{\approx}_{{\varsigma}}}$ as follows:

Then $(\dfrac{{H}}{{\approx}_{{\varsigma}}}, \odot, \hookrightarrow, [1]_{{\varsigma}})$ is a hoop.

Notation. In the following, we will consider in this article ${H}$ as a hoop and ${\varsigma}$ and ${\varrho}$ as fuzzy sets. Moreover, the set of all fuzzy filters of ${H}$ and anti-fuzzy filter of ${H}$ are denoted by $FF({H})$ and $AFF({H})$, respectively.

3.   Construction of hoops by anti-fuzzy filters

In this section, the concept of anti-fuzzy filter on hoop ${H}$ is defined and some related results are investigated.

A complement of ${\varsigma}$ is the fuzzy set ${\varsigma}^{c}$ which is defined by, ${\varsigma}^{c}({d}) = 1-{\varsigma}({d})$, for any ${d}\in {H}$.

Definition 3.1. ${\varrho}$ is called an anti-fuzzy filter of ${H}$ if for any ${d}, {s}\in {H}$:

$(AFF1)$ ${\varrho}({d}{\ast} {s}){\preceq} \max\{{\varrho}({d}), {\varrho}({s})\} = {\varrho}({d})\vee {\varrho}({s})$,

$(AFF2)$ if ${d}{\preceq} {s}$, then ${\varrho}({s}){\preceq} {\varrho}({d})$.

Example 3.2. Let ${H} = \{0, {e}, {k}, 1\}$ be a chain such that $0{\preceq} {e}{\preceq} {k}{\preceq} 1$. Define the operations ${\ast}$ and ${ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}}$ on ${H}$ as follows:

Then $({H}, {\ast}, { {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}}, 0, 1)$ is a bounded hoop. Define ${\varrho}: {H}\rightarrow {H}$ such that ${\varrho}(1) = 0, \ {\varrho}(0) = {\varrho}({e}) = 0.5$ and ${\varrho}({k}) = 0.3$. Then ${\varrho}$ is an anti-fuzzy filter of ${H}$.

Remark 3.3. $(1)$ The following statements hold:

$(i)$ ${\varsigma}\in FF({H})$ iff ${\varsigma}^{c}\in AFF({H})$.

$(ii)$ ${\varrho}\in AFF({H})$ iff ${\varrho}^{c}\in FF({H})$.

$(2)$ It is easy to see that ${\varsigma}({d}){\preceq} {\varsigma}(1)$(${\varrho}(1){\preceq} {\varrho}({d})$) and ${\varsigma}(0){\preceq} {\varsigma}({d})$(${\varrho}({d}){\preceq} {\varrho}(0)$), for any ${d}\in {H}$.

Theorem 3.4. Suppose for any ${r}\in [0, 1]$, we have ${\varrho}_{{r}} = \{{d}\in {H}\mid{\varrho}({d}){\preceq} {r}\}$. Then ${\varrho}\in AFF({H})$ iff for any ${r}\in [0, 1]$, ${\varrho}_{{r}}\neq \emptyset$ is a filter of ${H}$.

Proof. The proof is clear. In the next proposition we investigate some properties of anti-fuzzy filters of hoops.

Proposition 3.5. Assume ${\varrho}(1){\preceq} {\varrho}({d})$, for all ${d}\in {H}$. Then for all ${d}, {s}, {q}\in {H}$, the next statements are equivalent:

$(i)$ ${\varrho}\in AFF({H})$,

$(ii)$ If ${d}{\preceq} {s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}$, then ${\varrho}({q}){\preceq} {\varrho}({d})\vee {\varrho}({s})$,

$(iii)$ ${\varrho}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){\preceq} {\varrho}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})\vee {\varrho}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q})$,

$(iv)$ ${\varrho}({s}{\ast} {q}){\preceq} {\varrho}({d}{\ast} {q})\vee {\varrho}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})$,

$(v)$ ${\varrho}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){\preceq} {\varrho}(({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q})\vee {\varrho}({s})$.

Proof. $(i)\Rightarrow (ii)$ Let ${\varrho}\in AFF({H})$ and ${d}, {s}, {q}\in {H}$ such that ${d}{\preceq} {s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}$. Then ${\varrho}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){\preceq} {\varrho}({d})$. By Proposition 2.1(vii), ${s}{\ast} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){\preceq} {q}$, since ${\varrho}\in AFF({H})$, we have ${\varrho}({q}){\preceq} {\varrho}({s}{\ast} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q})){\preceq} {\varrho}({s})\vee {\varrho}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q})$. Hence, ${\varrho}({q}){\preceq} {\varrho}({s})\vee {\varrho}({d})$.

$(ii)\Rightarrow (iii)$ By Proposition 2.1(ix), ${d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}{\preceq} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q})$. Then by (ii),

$(iii)\Rightarrow (i)$ Let ${d}{\preceq} {s}$, then ${d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s} = 1$. Thus, by (iii) and assumption,

Also, from ${d}{\ast} {s}{\preceq} {d}{\ast} {s}$, by Proposition 2.1(ii), ${d}{\preceq} {s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({d}{\ast} {s})$, then ${\varrho}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({d}{\ast} {s})){\preceq} {\varrho}({d})$. Let ${d} = 1$ and ${q} = {d}{\ast} {s}$ in (iii). Then

Hence, ${\varrho}\in AFF({H})$.

$(ii)\Rightarrow (iv)$ By Proposition 2.1(vii) and (xi), $({q}{\ast} {d}){\ast} ({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){\preceq} {q}{\ast} {s}$. Then ${q}{\ast} {d}{\preceq} ({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({q}{\ast} {s})$. Thus, by (ii), ${\varrho}({q}{\ast} {s}){\preceq} {\varrho}({q}{\ast} {d})\vee {\varrho}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})$.

$(iv)\Rightarrow (v)$ Let ${d}, {s}, {q}\in {H}$. By Proposition 2.1(iii) and (iv), ${d}{\ast} {s}{\preceq} {s}{\preceq} {d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}$. Then by Proposition 2.1(xiii) and (HP3),

Thus, by Proposition 2.1(vii), ${s}{\ast} (({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){\preceq} {d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}$. Also, if ${d}{\preceq} {s}$, let ${q} = 1$ in (iv), then by assumption ${\varrho}({s}) = {\varrho}(1{\ast} {s}){\preceq} {\varrho}({d}{\ast} 1)\vee {\varrho}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}) = {\varrho}({d})$, and so ${\varrho}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){\preceq} {\varrho}({s}{\ast} (({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}))$. Moreover, if ${q} = {d}$ and ${d} = 1$ in (iv), then ${\varrho}({d}{\ast} {s}){\preceq} {\varrho}({d})\vee{\varrho}({s})$. Hence,

$(v)\Rightarrow (ii)$ Let ${d}{\preceq} {s}$. Then ${d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s} = 1$. It is enough to choose ${d} = 1, {q} = {s}$ and ${s} = {d}$ in (v). Thus, by assumption,

So, if ${d}{\preceq} {s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}$, then ${\varrho}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){\preceq} {\varrho}({d})$. Now, let ${d} = 1$ in (v), then

Theorem 3.6. Let ${\varrho}\in AFF({H})$ and fuzzy relation ${\approx}_{{\varrho}}$ on ${H}$ be defined by

Then ${\approx}_{{\varrho}}$ is a congruence relation on ${H}$.

Proof. Since ${\varrho}\in AFF({H})$, for all ${d}\in {H}$, we get

Hence ${\approx}_{{\varrho}}$ is reflexive. Clearly, ${\approx}_{{\varrho}}$ is symmetric. Now, suppose ${d}{\approx}_{{\varrho}} {s}$ and ${s}{\approx}_{{\varrho}} {q}$, for ${d}, {s}, {q}\in {H}$. Then ${\varrho}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})\vee{\varrho}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}) = {\varrho}(1)$ and ${\varrho}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q})\vee {\varrho}({q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}) = {\varrho}(1)$. Thus,

Moreover, since ${\varrho}$ is an anti-fuzzy filter, by Propositions 2.1(x), 3.5(iii) and Remark $3.3$(2), we have

So, ${d}{\approx}_{{\varrho}} {q}$ and this means that ${\approx}_{{\varrho}}$ is transitive. Hence, ${\approx}_{{\varrho}}$ is an equivalence relation. Now, we prove that ${\approx}_{{\varrho}}$ is a congruence relation. Let ${d}, {s}, {q}\in {H}$ such that ${d}{\approx}_{{\varrho}} {s}$. Then ${\varrho}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})\vee{\varrho}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}) = {\varrho}(1)$. Since ${s}{\ast} {q}{\preceq} {s}{\ast} {q}$, by Proposition 2.1(ii) and (xii), ${d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}{\preceq} {d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{\ast} {q}))$. Thus by (HP3), ${d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}{\preceq} ({d}{\ast} {q}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{\ast} {q})$. Since ${\varrho}$ is an anti-fuzzy filter, ${\varrho}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){\succeq} {\varrho}(({d}{\ast} {q}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{\ast} {q}))$. By the similar way, ${\varrho}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){\succeq} {\varrho}(({s}{\ast} {q}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({d}{\ast} {q}))$. Thus,

Hence, ${d}{\ast} {q}{\approx}_{{\varrho}} {s}{\ast} {q}$. On the other hand, by Proposition 2.1(ix), ${d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}{\preceq} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q})$, for any ${d}, {s}, {q}\in {H}$. From ${\varrho}$ is an anti-fuzzy filter, ${\varrho}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){\succeq} {\varrho}(({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}))$. By the similar way, ${\varrho}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){\succeq} {\varrho}(({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}))$. Then

and so ${d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}{\approx}_{{\varrho}} {s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}$. By the similar way, we can see ${q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}{\approx}_{{\varrho}} {q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}$. Therefore, ${\approx}_{{\varrho}}$ is a congruence relation on ${H}$.

For any ${e}\in {H}$, $[{e}]_{{\varrho}}$ denotes the equivalence class of ${e}$ with respect to ${\approx}_{{\varrho}}$. Clearly

Theorem 3.7. Let $\dfrac{{H}}{{\approx}_{{\varrho}}} = \{[{e}]_{{\varrho}}\mid {e}\in {H}\}$ and operations $\otimes$ and $\hookrightarrow$ on $\dfrac{{H}}{{\approx}_{{\varrho}}}$ defined as follows:

Then $(\dfrac{{H}}{{\approx}_{{\varrho}}}, \otimes, \hookrightarrow, [1]_{{\varrho}})$ is a hoop.

Proof. We have $[{e}]_{{\varrho}} = [{k}]_{{\varrho}}$ and $[{m}]_{{\varrho}} = [{z}]_{{\varrho}}$ iff ${e}{\approx}_{{\varrho}} {k}$ and ${m}{\approx}_{{\varrho}} {z}$. Since ${\approx}_{{\varrho}}$ is the congruence relation on ${H}$, we get that all above operations are well-defined. Thus, by routine calculation, we can see that $\dfrac{{H}}{{\approx}_{{\varrho}}}$ is a hoop. Now, we define a binary relation on $\dfrac{{H}}{{\approx}_{{\varrho}}}$ by

Easily we can see $(\dfrac{{H}}{{\approx}_{{\varrho}}}, {\preceq})$ is a partial order monoid.

Example 3.8. Let ${H}$ be the hoop as in Example 3.2. Define a map ${\varrho}:{H}\rightarrow {H}$ by ${\varrho}(1) = {\varrho}({k}) = 0.3$ and ${\varrho}(0) = {\varrho}({e}) = 0.5$. Then, we have $[0]_{{\varrho}} = \{0\}$, $[{e}]_{{\varrho}} = \{{e}\}$ and $[{k}]_{{\varrho}} = [1]_{{\varrho}} = \{{k}, 1\}$. Hence, $\dfrac{{H}}{{\approx}_{{\varrho}}} = \{[0]_{{\varrho}}, [{e}]_{{\varrho}}, [1]_{{\varrho}}\}$, which by the operations defining in Theorem 3.7 is a hoop.

4.   Construction of hoops and distributive lattices by intuitionistic fuzzy filters

In the following, we define the concept of intuitionistic fuzzy filter on hoop ${H}$ and investigate some related results.

Definition 4.1. An intuitionistic fuzzy set or IF-set $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ on ${H}$ is called an intuitionistic fuzzy filte or an IF-filter of ${H}$ if, for any ${d}, {s}\in {H}$, it satisfies the next conditions:

$(IFF1)$ if ${d}{\preceq} {s}$, then ${\varsigma}_{\mathcal{{B}}}({d}){\preceq} {\varsigma}_{\mathcal{{B}}}({s})$ and ${\varrho}_{\mathcal{{B}}}({s}){\preceq} {\varrho}_{\mathcal{{B}}}({d})$,

$(IFF2)$ ${\varsigma}_{\mathcal{{B}}}({d}{\ast} {s}){\succeq} {\varsigma}_{\mathcal{{B}}}({d})\wedge {\varsigma}_{\mathcal{{B}}}({s})$,

$(IFF3)$ ${\varrho}_{\mathcal{{B}}}({d}{\ast} {s}){\preceq} {\varrho}_{\mathcal{{B}}}({d})\vee {\varrho}_{\mathcal{{B}}}({s})$.

The family of all intuitionistic fuzzy filters of ${H}$ will be denoted by $\mathcal{IFF}({H})$.

Example 4.2. Let ${H}$ be the hoop as in Example 3.2. Define ${\varsigma}_{\mathcal{{B}}}(1) = 0.9$, ${\varsigma}_{\mathcal{{B}}}(0) = {\varsigma}_{\mathcal{{B}}}({e}) = 0.5$, ${\varsigma}_{\mathcal{{B}}}({k}) = 0.7$ and ${\varrho}_{\mathcal{{B}}}(1) = 0.1$, ${\varrho}_{\mathcal{{B}}}(0) = {\varrho}_{\mathcal{{B}}}({e}) = 0.5$ and ${\varrho}_{\mathcal{{B}}}({k}) = 0.3$. Then $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ is an intuitionistic fuzzy filter on ${H}$.

Proposition 4.3. An IF-set $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ on $A$ is an IF-filter iff ${\varsigma}_{\mathcal{{B}}}\in FF({H})$ and ${\varrho}_{\mathcal{{B}}}\in AFF({H})$ such that ${\varsigma}_{\mathcal{{B}}}({d})+{\varrho}_{\mathcal{{B}}}({d}){\preceq} 1$.

Proof. By Definitions 3.1, 4.1 and Proposition 2.5, the proof is clear. In the next example, we show that the condition ${\varsigma}_{\mathcal{{B}}}({d})+{\varrho}_{\mathcal{{B}}}({d}){\preceq} 1$, for any ${d}\in {H}$ is necessary.

Example 4.4. Let ${H}$ be the hoop as in Example 3.2. Define

Clearly, ${{\varsigma}_{\mathcal{{B}}}}\in FF({H})$ and ${{\varrho}_{\mathcal{{B}}}}\in AFF({H})$ such that ${{\varsigma}_{\mathcal{{B}}}}(1)+{{\varrho}_{\mathcal{{B}}}}(1){\succeq} 1$. Hence, $\mathcal{{B}} = ({{\varsigma}_{\mathcal{{B}}}}, {{\varrho}_{\mathcal{{B}}}})$ is not an IF-set of ${H}$.

In the next proposition we prove that by a fuzzy filter (anti-fuzzy filter) on $A$ we can make an IF-filter.

Proposition 4.5. Let $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ be an IF-set on ${H}$. Then $\mathcal{{B}}$ is an IF-filter iff $\mathcal{{B}}_{{C}} = ({\varsigma}_{\mathcal{{B}}}, {\varsigma}^{c}_{\mathcal{{B}}})$ and $_{{C}}\mathcal{{B}} = ({\varrho}^{c}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ are IF-filters of ${H}$.

Proof. $(\Rightarrow)$ Let $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ be an IF-filter of ${H}$. By Definition 4.1, ${\varsigma}_{\mathcal{{B}}}\in FF({H})$ and ${\varrho}_{\mathcal{{B}}}\in AFF({H})$. Thus, by Remark $3.3$, ${\varsigma}^{c}_{\mathcal{{B}}}\in AFF({H})$ and $\nu^{c}_{\mathcal{{B}}}\in FF({H})$. Also, from ${\varsigma}_{\mathcal{{B}}}+{\varsigma}^{c}_{\mathcal{{B}}}{\preceq} 1$ and ${\varrho}_{\mathcal{{B}}}+{\varrho}^{c}_{\mathcal{{B}}}{\preceq} 1$, obviously, $\mathcal{{B}}_{{C}} = ({\varsigma}_{\mathcal{{B}}}, {\varsigma}^{c}_{\mathcal{{B}}})$ and $_{{C}}\mathcal{{B}} = ({\varrho}^{c}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ are IF-filters of ${H}$.

$(\Leftarrow)$ Let $\mathcal{{B}}_{{C}} = ({\varsigma}_{\mathcal{{B}}}, {\varsigma}^{c}_{\mathcal{{B}}})$ and $_{{C}}\mathcal{{B}} = ({\varrho}^{c}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ be IF-filters of ${H}$. Then ${\varsigma}_{\mathcal{{B}}}\in FF({H})$ and ${\varrho}_{\mathcal{{B}}}\in AFF({H})$. From, $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ is an IF-set on ${H}$, then ${\varsigma}_{\mathcal{{B}}}+{\varrho}_{\mathcal{{B}}}{\preceq} 1$. Thus, by Proposition $4.3$, $\mathcal{{B}}$ is an IF-filter of ${H}$.

Theorem 4.6. Let $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ be an IF-set on ${H}$ and for any ${r}\in [0, 1]$,

Then $\mathcal{{B}}$ is an IF-filter of ${H}$ iff for any ${r}\in [0, 1]$, $\mathcal{{B}}_{{r}}\neq \emptyset$ is a filter of ${H}$.

Proof. By Theorems $2.6$, $3.4$ and Proposition $4.3$, the proof is clear. Now, we mainly investigate the lattice of all IF-filters by introducing the notion of tip-extended pair of IF-sets.

Proposition 4.7. Let $\{\mathcal{{B}}_{i} = ({\varsigma}_{\mathcal{{B}}_{i}}, {\varrho}_{\mathcal{{B}}_{i}})\}_{i\in I}$ be a set of IF-filters of ${H}$ and fuzzy sets $\bigwedge_{i\in I} {{\varsigma}_{\mathcal{{B}}_{i}}}$ and $\bigvee_{i\in I} {{\varrho}_{\mathcal{{B}}_{i}}}$ on ${H}$ are defined as follows:

and IF-set $\bigcap_{i\in I} {\mathcal{{B}}_{i}}$ on ${H}$, are defined by $\bigcap_{i\in I} {\mathcal{{B}}_{i}} = (\bigwedge_{i\in I} {{\varsigma}_{\mathcal{{B}}_{i}}}, \bigvee_{i\in I} {{\varrho}_{\mathcal{{B}}_{i}}})$. Then $\mathcal{{B}} = \bigcap_{i\in I} {\mathcal{{B}}_{i}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ is an IF-filter of ${H}$, too.

Proof. Let $\{\mathcal{{B}}_{i} = ({\varsigma}_{\mathcal{{B}}_{i}}, {\varrho}_{\mathcal{{B}}_{i}})\}_{i\in I}$ be a set of IF-filters of ${H}$ and $\mathcal{{B}} = \bigcap_{i\in I} {\mathcal{{B}}_{i}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ such that ${\varsigma}_{\mathcal{{B}}} = \bigwedge_{i\in I}{{\varsigma}_{\mathcal{{B}}_{i}}}$ and ${\varrho}_{\mathcal{{B}}} = \bigvee_{i\in I}{{\varrho}_{\mathcal{{B}}_{i}}}$. Let ${d}, {s}, {q}\in {H}$ such that ${d}{\preceq} {s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}$. Then

In the next example we show that $(\bigvee_{i\in I}{{\varsigma}_{\mathcal{{B}}_{i}}}, \bigvee_{i\in I}{{\varrho}_{\mathcal{{B}}_{i}}})$ is not an IF-filter, in general.

Example 4.8. Let ${H}$ be as Example $4.4$ and;

${{\varsigma}_{\mathcal{{B}}}}_{1}(1) = 0.4, \; {{\varsigma}_{\mathcal{{B}}}}_{1}({e}) = {{\varsigma}_{\mathcal{{B}}}}_{1}(0) = 0.2, {{\varsigma}_{\mathcal{{B}}}}_{1}({k}) = 0.3, {{\varrho}_{\mathcal{{B}}}}_{1}(1) = 0.6, \; {{\varrho}_{\mathcal{{B}}}}_{1}({e}) = {{\varrho}_{\mathcal{{B}}}}_{1}(0) = 0.8\; {\rm{and}}\; {{\varrho}_{\mathcal{{B}}}}_{1}({k}) = 0.7\\ {{\varsigma}_{\mathcal{{B}}}}_{2}(1) = 0.5, \; {{\varsigma}_{\mathcal{{B}}}}_{2}({e}) = {{\varsigma}_{\mathcal{{B}}}}_{2}(0) = 0.3, {{\varsigma}_{\mathcal{{B}}}}_{2}({k}) = 0.4, {{\varrho}_{\mathcal{{B}}}}_{2}(1) = 0.5, \; {{\varrho}_{\mathcal{{B}}}}_{2}({e}) = {{\varrho}_{\mathcal{{B}}}}_{2}(0) = 0.7\; {\rm{and}}\; {{\varrho}_{\mathcal{{B}}}}_{2}({k}) = 0.6\\ {{\varsigma}_{\mathcal{{B}}}}_{3}(1) = 1, \; {{\varsigma}_{\mathcal{{B}}}}_{3}({e}) = {{\varsigma}_{\mathcal{{B}}}}_{3}(0) = 0.5, {{\varsigma}_{\mathcal{{B}}}}_{3}({k}) = 0.7, {{\varrho}_{\mathcal{{B}}}}_{3}(1) = 0, \; {{\varrho}_{\mathcal{{B}}}}_{3}({e}) = {{\varrho}_{\mathcal{{B}}}}_{3}(0) = 0.5\; {\rm{and}}\; {{\varrho}_{\mathcal{{B}}}}_{3}({k}) = 0.3\\ {{\varsigma}_{\mathcal{{B}}}}_{4}(1) = 0.3, \; {{\varsigma}_{\mathcal{{B}}}}_{4}({e}) = {{\varsigma}_{\mathcal{{B}}}}_{4}(0) = 0.1, {{\varsigma}_{\mathcal{{B}}}}_{4}({k}) = 0.2, {{\varrho}_{\mathcal{{B}}}}_{4}(1) = 0.7, \; {{\varrho}_{\mathcal{{B}}}}_{4}({e}) = {{\varrho}_{\mathcal{{B}}}}_{4}(0) = 0.9\; {\rm{and}}\; {{\varrho}_{\mathcal{{B}}}}_{4}({k}) = 0.8$

Then $(\vee{\varsigma}_{\mathcal{{B}}}(1), \vee{\varrho}_{\mathcal{{B}}}(1)) = (1, 0.7)$ such that ${\varsigma}_{\mathcal{{B}}}+{\varrho}_{\mathcal{{B}}}{\succeq} 1$, which is a contradiction with definition of IF-set.

Let ${L}$ be an IF-set on ${H}$. The intersection of all IF-filters containing ${L}$ is called the generated IF-filter by ${L}$, denoted as $\langle {L}\rangle$.

Theorem 4.9. Let ${L} = ({\varsigma}_{{L}}, {\varrho}_{{L}})$ be an IF-set on ${H}$ and $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ is defined on ${H}$ by;

and

for all ${d}\in {H}$, ${e}_{i}\in {H}$, $1{\preceq} i{\preceq} n$ and $n\in \mathbb{N}$. Then $\mathcal{{B}} = \langle {L}\rangle$.

Proof. First, we verify that $\mathcal{{B}}$ is an IF-filter. For all ${d}, {s}\in {H}$, such that ${d}{\preceq} {s}$, the definition of $\mathcal{{B}}$ yields that ${\varsigma}_{\mathcal{{B}}}({d}){\preceq} {\varsigma}_{\mathcal{{B}}}({s})$ and ${\varrho}_{\mathcal{{B}}}({s}){\preceq} {\varrho}_{\mathcal{{B}}}({d})$. For all ${d}, {s}, {e}_{i}, {k}_{j}, {m}_{l}\in {H}$, $1{\preceq} i{\preceq} n$, $1{\preceq} j{\preceq} m$, $1{\preceq} l{\preceq} k$ and $n, m, k\in \mathbb{N}$, we have

and

Thus $\mathcal{{B}}$ is an IF-filter. Secondly, let $\mathcal{{C}}$ be an IF-filter such that ${L}\subseteq \mathcal{{C}}$. By definition of IF-filter, for all ${d}, {s}, {e}_{i}\in {H}$, $1{\preceq} i{\preceq} n$ and $n\in \mathbb{N}$, it holds that

and

and hence, $\mathcal{{B}}\subseteq\mathcal{{C}}$. Thus, $\mathcal{{B}} = \langle {L}\rangle$.

Associating with the above results, similar to the proof of ([15,Theorems 10–12]), we define the operations $\sqcap$ and $\sqcup$ on IF-filters of ${H}$ in this way, $\mathcal{{B}}\sqcap \mathcal{{C}} = \mathcal{{B}}\cap \mathcal{{C}}$ and $\mathcal{{B}}\sqcup \mathcal{{C}} = \langle \mathcal{{B}}\cup \mathcal{{C}}\rangle$, for any $\mathcal{{B}}, \mathcal{{C}}\in IFF({H})$.

Theorem 4.10. $(\mathcal{IFF}({H}), \sqcap, \sqcup, \emptyset, {H})$ is a bounded distributive lattice.

Proof. The proof is similar to the proof of [15,Theorems 10–12].

Theorem 4.11. Let $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ be an IF-filter of ${H}$ and fuzzy relation ${\approx}_{\mathcal{{B}}}$ on ${H}$, for any ${d}, {s}\in {H}$, is defined by

Then ${\approx}_{\mathcal{{B}}}$ is a congruence relation on ${H}$.

Proof. The proof is similar to the proof of Theorems $2.7$ and $3.6$.

Theorem 4.12. Let $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}} = \{[{e}]_{\mathcal{{B}}}\mid {e}\in {H}\}$ and operations $\odot$ and $\hookrightarrow$ on $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}}$ are defined as follows:

Also, we define a binary relation on $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}}$ by

Clearly, $(\dfrac{{H}}{{\approx}_{\mathcal{{B}}}}, {\preceq})$ is a poset. Then $(\dfrac{{H}}{{\approx}_{\mathcal{{B}}}}, \odot, \hookrightarrow, [1]_{\mathcal{{B}}})$ is a hoop.

Proof. The proof is similar to the proof of Theorems $2.8$ and $3.7$.

Example 4.13. Let ${H}$ be the hoop as in Example 3.2. Define ${\varsigma}_{\mathcal{{B}}}(0) = {\varsigma}_{\mathcal{{B}}}({e}) = 0.5$, ${\varsigma}_{\mathcal{{B}}}(1) = {\varsigma}_{\mathcal{{B}}}({k}) = 0.7$ and ${\varrho}_{\mathcal{{B}}}(0) = {\varrho}_{\mathcal{{B}}}({e}) = 0.5$ and ${\varrho}_{\mathcal{{B}}}(1) = {\varrho}_{\mathcal{{B}}}({k}) = 0.3$. Then $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ is an intuitionistic fuzzy filter on ${H}$ and $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}} = \{[0]_{\mathcal{{B}}}, [{e}]_{\mathcal{{B}}}, [1]_{\mathcal{{B}}}\}$ with the operations defining in Theorem 4.12 is a hoop.

5.   Construction of Brouwerian semilattice by intuitionistic fuzzy (positive) implicative filters

Here, we define the notions of intuitionistic fuzzy (positive) implicative filters on hoops and some related results are investigated. We find some equivalence characterizations of them.

Definition 5.1. An IF-set $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ on ${H}$ is called an intuitionistic fuzzy implicative filter or an IF-implicative filter of ${H}$ if for all ${d}, {s}, {q}\in {H}$, it satisfies the next conditions:

$(IFIF_{1})$ If ${d}{\preceq} {s}$, then ${\varsigma}_{\mathcal{{B}}}({d}){\preceq} {\varsigma}_{\mathcal{{B}}}({s})$ and ${\varrho}_{\mathcal{{B}}}({s}){\preceq} {\varrho}_{\mathcal{{B}}}({d})$,

$(IFIF_{2})$ ${\varsigma}_{\mathcal{{B}}}({d})\wedge{\varsigma}_{\mathcal{{B}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} (({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})){\preceq} {\varsigma}_{\mathcal{{B}}}({s})$ and ${\varrho}_{\mathcal{{B}}}({s}){\preceq} {\varrho}_{\mathcal{{B}}}({d})\vee{\varrho}_{\mathcal{{B}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} (({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}))$.

Example 5.2. Assume ${H} = \{0, {e}, {k}, 1\}$ is a chain such that $0{\preceq} {e}{\preceq} {k}{\preceq} 1$. Define two binary operations ${\ast}$ and ${ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}}$ on ${H}$ as follows:

Clearly, $({H}, {\ast}, { {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}}, 0, 1)$ is a hoop. Define ${\varsigma}_{\mathcal{{B}}}$ on ${H}$ by ${\varsigma}_{\mathcal{{B}}}(1) = {\varsigma}_{\mathcal{{B}}}({k}) = {\varsigma}_{\mathcal{{B}}}({e}) = {r}_{2}$ and ${\varsigma}_{\mathcal{{B}}}(0) = {r}_{1}$ such that $0{\preceq} {r}_{1} < {r}_{2}{\preceq} 1$ and ${\varrho}_{\mathcal{{B}}} = 1-{\varsigma}_{\mathcal{{B}}}$. One easily verify that $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ is an IF-implicative filter.

Theorem 5.3. Let $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ be an IF-set on ${H}$. Then $\mathcal{{B}}$ is an IF-implicative filters of ${H}$ iff for any ${r}\in [0, 1]$, $\mathcal{{B}}_{{r}}\neq \emptyset$ is an implicative filter of ${H}$.

Proof. The proof is similar to the proof of Theorem $4.6$.

Theorem 5.4. Every IF-implicative filter of ${H}$ is an IF-filter.

Proof. Let $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ be an IF-implicative filter. By $(IFIF_{1})$, obviously $(IFF1)$ holds. Since ${d}{\ast} {s}{\preceq} {d}{\ast} {s}$, by Proposition $2.1$(ii), ${s}{\preceq} {d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({d}{\ast} {s})$. Then by $(IFIF_{1})$, ${{\varrho}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({d}{\ast} {s})){\preceq} {{\varrho}_{\mathcal{{B}}}}({s})$. Also, since ${{\varrho}_{\mathcal{{B}}}}$ is an IF-implicative filter, it is enough to choose ${q} = 1$, then

Similarly, we can see ${{\varsigma}_{\mathcal{{B}}}}({d}{\ast} {s}){\succeq} {{\varsigma}_{\mathcal{{B}}}}({d})\wedge {{\varsigma}_{\mathcal{{B}}}}({s})$. Hence, $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ is an IF-filter. In the next example we can see that the converse of the previous theorem does not hold.

Example 5.5. Assume ${H} = \{0, {e}, {k}, 1\}$ is a chain, where $0{\preceq} {e}{\preceq} {k}{\preceq} 1$. Define two binary operations ${\ast}$ and ${ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}}$ on ${H}$ as follows:

Hence $({H}, {\ast}, { {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}}, 0, 1)$ is a hoop. Define ${\varsigma}_{\mathcal{{B}}}\in FF({H})$ by ${\varsigma}_{\mathcal{{B}}}(1) = {r}_{1}, \; {\varsigma}_{\mathcal{{B}}}({k}) = {r}_{2}$ and ${\varsigma}_{\mathcal{{B}}}({e}) = {\varsigma}_{\mathcal{{B}}}(0) = {r}_{3}$ such that $0{\preceq} {r}_{3} < {r}_{2} < {r}_{1}{\preceq} 1$ and ${\varrho}_{\mathcal{{B}}} = 1-{\varsigma}_{\mathcal{{B}}}$. One easily verify that $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ is an IF-filter of ${H}$ but $\mathcal{{B}}$ is not an IF-implicative filter. Because ${r}_{2} = {\varsigma}_{\mathcal{{B}}}({k}) = {\varsigma}_{\mathcal{{B}}}({k})\wedge {\varsigma}_{\mathcal{{B}}}({k}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} (({e}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} 0){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {e}))\nleq {\varsigma}_{\mathcal{{B}}}({e}) = {r}_{3}$.

Theorem 5.6. Suppose ${H}$ is bounded and $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ is an IF-filter of ${H}$. Then the next statements are equivalent, for all ${d}, {s}\in {H}$,

$(i)$ $\mathcal{{B}}$ is an IF-implicative filter of ${H}$,

$(ii)$ ${{\varsigma}_{\mathcal{{B}}}}(({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){\preceq} {{\varsigma}_{\mathcal{{B}}}}({d})$ and ${{\varrho}_{\mathcal{{B}}}}(({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){\succeq} {{\varrho}_{\mathcal{{B}}}}({d})$,

$(iii)$ ${{\varsigma}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){\succeq} {{\varsigma}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({q}'{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}))\wedge {{\varsigma}_{\mathcal{{B}}}}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q})$ and ${{\varrho}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){\preceq} {{\varrho}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({q}'{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}))\vee {{\varrho}_{\mathcal{{B}}}}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q})$,

$(iv)$ ${{\varsigma}_{\mathcal{{B}}}}(({d}{\ast} {s}'){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){\preceq} {{\varsigma}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})$ and ${{\varrho}_{\mathcal{{B}}}}(({d}{\ast} {s}'){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){\succeq} {{\varrho}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})$.

Proof. In this proof, we just prove the items of ${\varrho}_{\mathcal{{B}}}$. Also, since $\mathcal{{B}}$ is an IF-filter of ${H}$, by Definition $4.1$, ${\varsigma}_{\mathcal{{B}}}\in FF({H})$ and ${\varrho}_{\mathcal{{B}}}\in AFF({H})$. Then as we notice, ${{\varrho}_{\mathcal{{B}}}}(1){\preceq} {{\varrho}_{\mathcal{{B}}}}({d})$ and ${{\varsigma}_{\mathcal{{B}}}}(1){\succeq} {{\varsigma}_{\mathcal{{B}}}}({d})$, for any ${d}\in {H}$.

$(i)\Rightarrow (ii)$ It is enough to let ${d} = 1$ in $(IFIF_{2})$. Then

$(ii)\Rightarrow (i)$ Let ${d}, {s}, {q}\in {H}$. Then by Proposition $2.1$(vii),

Since ${{\varrho}_{\mathcal{{B}}}}\in AFF({H})$, we get

By (ⅱ),

Hence, $\mathcal{{B}}$ is an IF-implicative filter of ${H}$.

$(i)\Rightarrow (iv)$ Let ${d}, {s}\in {H}$. Then by Proposition $2.1$(iv) and (xii), ${s}{\preceq} {d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}$, and so $({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})'{\preceq} {s}'$. Again, by Proposition $2.1$(xiii), ${s}'{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){\preceq} ({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})'{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})$. Since ${{\varrho}_{\mathcal{{B}}}}\in AFF({H})$, ${{\varrho}_{\mathcal{{B}}}}(({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})'{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})){\preceq} {{\varrho}_{\mathcal{{B}}}}({s}'{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}))$. Moreover, since ${\mathcal{{B}}}$ is an IF-implicative filter of ${H}$, we have

$(iv)\Rightarrow (iii)$ Let ${d}, {s}, {q}\in {H}$. Then by Proposition $2.1$(x),

Since ${{\varrho}_{\mathcal{{B}}}}\in AFF({H})$,

by (iv), ${{\varrho}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){\preceq} {{\varrho}_{\mathcal{{B}}}}(({d}{\ast} {q}'){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q})$. Hence, ${{\varrho}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){\preceq} {{\varrho}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({q}'{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}))\vee {{\varrho}_{\mathcal{{B}}}}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q})$.

$(iii)\Rightarrow (i)$ Let ${d} = 1$ and ${q} = {s}$ in (iii). Then ${{\varrho}_{\mathcal{{B}}}}(1{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){\preceq} {{\varrho}_{\mathcal{{B}}}}(1{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}'{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}))\vee {{\varrho}_{\mathcal{{B}}}}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})$, and so ${{\varrho}_{\mathcal{{B}}}}({s}){\preceq} {{\varrho}_{\mathcal{{B}}}}({s}'{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})\vee {{\varrho}_{\mathcal{{B}}}}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}) = {{\varrho}_{\mathcal{{B}}}}({s}'{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})$. Also, by Proposition $2.1$(vii),

Since $\mathcal{{B}}$ is an IF-filter of ${H}$, by Definition $4.1$, ${\varrho}_{\mathcal{{B}}} \in AFF({H})$, then ${{\varrho}_{\mathcal{{B}}}}(({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){\preceq} {{\varrho}_{\mathcal{{B}}}}({d})\vee {{\varrho}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} (({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}))$. Moreover, by Proposition $2.1$(xiii) and Proposition $2.2$(iii), ${s}'{\preceq} {s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}$, and so $({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}{\preceq} {s}'{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}$, thus, ${{\varrho}_{\mathcal{{B}}}}({s}'{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){\preceq} {{\varrho}_{\mathcal{{B}}}}(({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})$. Hence, ${{\varrho}_{\mathcal{{B}}}}({s}){\preceq} {{\varrho}_{\mathcal{{B}}}}({d})\vee {{\varrho}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} (({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})$.

Definition 5.7. Assume $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ is an IF-set of ${H}$. Then $\mathcal{{B}}$ is said to be an intuitionistic fuzzy positive implicative filter or an IF-positive implicative filter of ${H}$ if, for all ${d}, {s}, {q}\in {H}$,

$(IFPIF_{1})$ if ${d}{\preceq} {s}$, then ${{\varsigma}_{\mathcal{{B}}}}({d}){\preceq} {{\varsigma}_{\mathcal{{B}}}}({s})$ and ${{\varrho}_{\mathcal{{B}}}}({s}){\preceq} {{\varrho}_{\mathcal{{B}}}}({d})$,

$(IFPIF_{2})$ ${{\varsigma}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})\wedge{{\varsigma}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q})){\preceq} {{\varsigma}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q})$ and ${{\varrho}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){\preceq} {{\varrho}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})\vee{{\varrho}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}))$.

Example 5.8. Assume ${H} = \{0, {e}, {k}, 1\}$ is a chain where $0{\preceq} {e}{\preceq} {k}{\preceq} 1$. Define two binary operations ${\ast}$ and ${ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}}$ on ${H}$ as follows:

Hence $({H}, {\ast}, { {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}}, 0, 1)$ is a hoop. Define ${\varsigma}_{\mathcal{{B}}}\in FF({H})$ by ${\varsigma}_{\mathcal{{B}}}(1) = {r}_{2}$ and ${\varsigma}_{\mathcal{{B}}}({k}) = {\varsigma}_{\mathcal{{B}}}({e}) = {\varsigma}_{\mathcal{{B}}}(0) = {r}_{1}$ such that $0{\preceq} {r}_{1} < {r}_{2}{\preceq} 1$ and let ${\varrho}_{\mathcal{{B}}} = 1-{\varsigma}_{\mathcal{{B}}}$. Clearly, $\mathcal{{B}}$ is an IF-positive implicative filter.

Theorem 5.9. Let $\mathcal{{B}}$ be an IF-set of ${H}$. Then $\mathcal{{B}}$ is an IF-positive implicative filter of ${H}$ iff for any ${r}\in [0, 1]$, $\mathcal{{B}}_{{r}}\neq \emptyset$ is a positive implicative filter of ${H}$.

Proof. The proof is similar to the proof of Theorem $4.6$.

Theorem 5.10. Each IF-positive implicative filter of ${H}$ is an IF-filter.

Proof. Assume $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ is an IF-positive implicative filter of ${H}$. Then by $(IFPIF_{1})$, obviously, (IFF1) holds. Moreover, by Proposition $2.1$(v) and $(IFPIF_{2})$, we have

Also, by Proposition $2.1$(ii), ${d}{\preceq} {s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({d}{\ast} {s})$. Then by $(IFPIF_{1})$, ${{\varrho}_{\mathcal{{B}}}}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({d}{\ast} {s})){\preceq} {{\varrho}_{\mathcal{{B}}}}({d})$. Hence, ${{\varrho}_{\mathcal{{B}}}}({d}{\ast} {s}){\preceq} {{\varrho}_{\mathcal{{B}}}}({d})\vee{{\varrho}_{\mathcal{{B}}}}({s})$. Similarly, ${{\varsigma}_{\mathcal{{B}}}}({d})\wedge {{\varsigma}_{\mathcal{{B}}}}({s}){\preceq} {{\varsigma}_{\mathcal{{B}}}}({d}{\ast} {s})$. Therefore, $\mathcal{{B}}$ is an IF-filter of ${H}$.

Next example shows that the converse of the previous theorem does not hold.

Example 5.11. According to Example $5.2$, introduce ${{\varsigma}_{\mathcal{{B}}}}$ by ${{\varsigma}_{\mathcal{{B}}}}(1) = {r}_{3}, \; {{\varsigma}_{\mathcal{{B}}}}({k}) = {{\varsigma}_{\mathcal{{B}}}}({e}) = {r}_{2}$ and ${{\varsigma}_{\mathcal{{B}}}}(0) = {r}_{1}$ such that $0{\preceq} {r}_{1} < {r}_{2} < {r}_{3}{\preceq} 1$. Routine calculation shows ${{\varsigma}_{\mathcal{{B}}}}\in FF({H})$ and ${{\varrho}_{\mathcal{{B}}}} = 1-{{\varsigma}_{\mathcal{{B}}}}\in AFF({H})$. So, $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ is an IF-filter of ${H}$ but $\mathcal{{B}} = ({{\varsigma}_{\mathcal{{B}}}}, {{\varrho}_{\mathcal{{B}}}})$ is not an IF-positive implicative filter. Because

Theorem 5.12. Let $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ be an IF-filter of ${H}$. Then for any ${d}, {s}, {q}\in {H}$ the next conditions are equivalent:

$(i)$ $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ is an IF-positive implicative filter of ${H}$,

$(ii)$ ${{\varsigma}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})){\preceq} {{\varsigma}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}) \, \ {{\varrho}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){\preceq} {{\varrho}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}))$,

$(iii)$ ${{\varsigma}_{\mathcal{{B}}}}({q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d})){\preceq} {{\varsigma}_{\mathcal{{B}}}}(({q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d})) \, \ {{\varrho}_{\mathcal{{B}}}}(({q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d})){\preceq} {{\varrho}_{\mathcal{{B}}}}({q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}))$,

$(iv)$ ${{\varsigma}_{\mathcal{{B}}}}({q})\wedge {{\varsigma}_{\mathcal{{B}}}}({q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}))){\preceq} {{\varsigma}_{\mathcal{{B}}}}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}) \, \ {{\varrho}_{\mathcal{{B}}}}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){\preceq} {{\varrho}_{\mathcal{{B}}}}({q})\vee {{\varrho}_{\mathcal{{B}}}}({q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d})))$,

$(v)$ ${{\varsigma}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}^{2}) = {{\varsigma}_{\mathcal{{B}}}}(1)$ and ${{\varrho}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}^{2}) = {{\varrho}_{\mathcal{{B}}}}(1)$.

Proof. In this proof, we just prove the items of ${\varrho}_{\mathcal{{B}}}$. Also, since $\mathcal{{B}}$ is an IF-filter of ${H}$, by Definition $4.1$, ${\varsigma}_{\mathcal{{B}}} \in FF({H})$ and ${\varrho}_{\mathcal{{B}}}\in AFF({H})$. Then as we notice, ${{\varrho}_{\mathcal{{B}}}}(1){\preceq} {{\varrho}_{\mathcal{{B}}}}({d})$ and ${{\varsigma}_{\mathcal{{B}}}}(1){\succeq} {{\varsigma}_{\mathcal{{B}}}}({d})$, for any ${d}\in {H}$.

$(i)\Rightarrow (ii)$ Let ${q} = {s}$ and ${s} = {d}$ in $(IFPIF_{2})$. Then

$(ii)\Rightarrow (iii)$ Since ${q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}{\preceq} {q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}$, by Proposition $2.1$(vii), ${q}{\ast} ({q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){\preceq} {s}$. Also, by (HP3),

Since ${{\varrho}_{\mathcal{{B}}}}\in AFF({H})$,

Also, by (ⅱ),

Hence, by (HP3),

$(iii)\Rightarrow (iv)$ By Proposition $2.1$(vii), ${q}{\ast} ({q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}))){\preceq} {s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d})$. Since ${{\varrho}_{\mathcal{{B}}}}\in AFF({H})$,

So it is enough to choose ${q} = {s}$ in (iii). Then

$(iv)\Rightarrow (v)$ Let ${q} = 1, {s} = {d}$ and ${d} = {d}^{2}$ in (iv). Then

and so ${{\varrho}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}^{2}) = {{\varrho}_{\mathcal{{B}}}}(1)$.

$(v)\Rightarrow (i)$ By Proposition $2.1$(vii),

Since ${{\varrho}_{\mathcal{{B}}}}\in AFF({H})$, we have

By Proposition $2.1$(vii), $({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}^{2}){\ast} ({d}^{2}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){\preceq} {d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}$. Then

By (v), ${{\varrho}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}^{2}) = {{\varrho}_{\mathcal{{B}}}}(1)$, hence, ${{\varrho}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){\preceq} {{\varrho}_{\mathcal{{B}}}}({d}^{2}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q})$. As we prove,

Corollary 5.13. Let ${d}^{2} = {d}$, for all ${d}\in {H}$. Then any IF-filter of ${H}$ is an IF-positive implicative filter.

Proof. Let ${d}, {s}, {q}\in {H}$ and $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ be an IF-filter of ${H}$. If, for all ${d}\in {H}$, ${d}^{2} = {d}$, then ${{\varrho}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}^{2}) = {{\varrho}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}) = {{\varrho}_{\mathcal{{B}}}}(1)$ and also, ${{\varsigma}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}^{2}) = {{\varsigma}_{\mathcal{{B}}}}(1)$. Thus, by Theorem $5.12$(v), $\mathcal{{B}}$ is an IF-positive implicative filter.

Theorem 5.14. Every IF-implicative filter of ${H}$ is an IF-positive implicative filter.

Proof. In this proof, we just prove the sentence of ${\varrho}_{\mathcal{{B}}}$. Let $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ be an IF-implicative filter of ${H}$. Then by $(IFIF_{1})$, clearly $(IFPIF_{1})$ holds. Now, let ${d}\in {H}$. Then by Theorem $5.4$, $\mathcal{{B}}$ is an IF-filter. Thus, by Theorem $5.6$(ii), Proposition $2.1$(xiv), (HP2) and (HP3),

By the similar way, ${{\varsigma}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}^{2}) = {{\varsigma}_{\mathcal{{B}}}}(1)$. Hence, by Theorem $5.12$(v), $\mathcal{{B}}$ is an IF-positive implicative filter. The next example shows that the converse of the pervious theorem does not hold, in general.

Example 5.15. According to Example $5.8$, we see that $\mathcal{{B}}$ is an IF-positive implicative filter, but it is not an IF-implicative filter. Because by Theorem $5.6$(iv), ${r}_{2} = {{\varsigma}_{\mathcal{{B}}}}(1) = {{\varsigma}_{\mathcal{{B}}}}(0{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {e}) = {{\varsigma}_{\mathcal{{B}}}}(({k}{\ast} {e}'){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {e})\neq {{\varsigma}_{\mathcal{{B}}}}({k}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {e}) = {{\varsigma}_{\mathcal{{B}}}}({e}) = {r}_{1}$.

Theorem 5.16. Let ${H}$ be bounded with (DNP). Then every IF-positive implicative filter of ${H}$ is an IF-implicative filter.

Proof. Let ${H}$ be bounded with (DNP) and $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ be an IF-positive implicative filter of ${H}$. Then by Theorem $5.10$, $\mathcal{{B}}$ is an IF-filter. Thus, by Proposition $2.1$(vii),

and so

and

Since ${H}$ has (DNP), by (HP3), we have,

By the similar way,

Moreover, since $\mathcal{{B}}$ is an IF-positive implicative filter of ${H}$, by Theorem $5.12$(iii), Proposition $2.2$(ii) and (DNP), we get

By the similar way, ${{\varsigma}_{\mathcal{{B}}}}({s}){\succeq} {{\varsigma}_{\mathcal{{B}}}}({d})\wedge {{\varsigma}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} (({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}))$. Therefore, by Theorem $5.6$(ii), ${\mathcal{{B}}}$ is an IF-implicative filter.

Theorem 5.17. Let $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ be an IF-set of ${H}$. Then $\mathcal{{B}}$ is an IF-implicative filter of ${H}$ iff $\mathcal{{B}}$ is an IF-positive implicative filter of ${H}$ and ${{\varsigma}_{\mathcal{{B}}}}(({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){\preceq} {{\varsigma}_{\mathcal{{B}}}}(({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d})$ and ${{\varrho}_{\mathcal{{B}}}}(({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){\succeq} {{\varrho}_{\mathcal{{B}}}}(({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d})$, for all ${d}, {s}\in {H}$.

Proof. $(\Rightarrow)$ Let $\mathcal{{B}}$ be an IF-implicative filter. Then by Theorem $5.14$, $\mathcal{{B}}$ is an IF-positive implicative filter. Now, suppose ${d}, {s}\in {H}$. Then by Proposition $2.1$(iv) and (viii), ${d}, {s}{\preceq} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}$. Since ${s}{\preceq} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}$, by Proposition $2.1$(xii), we have $({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}{\preceq} ({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} (({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d})$. Moreover, since ${d}{\preceq} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}$, by Proposition $2.1$(xiii), ${d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}{\succeq} (({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}$, and so

Thus, we have,

Since $\mathcal{{B}}$ is an IF-implicative filter, by Theorem $5.4$, $\mathcal{{B}}$ is an IF-filter. Thus, by Theorem $5.6$(ii),

Hence, ${\varrho}_{\mathcal{{B}}}(({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){\succeq} {\varrho}_{\mathcal{{B}}}(({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d})$.

$(\Leftarrow)$ Let ${d}, {s}\in {H}$. Then by Proposition $2.1$(viii), ${d}{\preceq} ({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}$, and by Proposition $2.1$(xii), $({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}{\preceq} ({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} (({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s})$. Since $\mathcal{{B}}$ is an IF-positive implicative filter, by Theorem $5.12$(ii), we have

Also, by assumption,

On the other hand, by Proposition $2.1$(iv), ${s}{\preceq} {d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}$ and by Proposition $2.1$(xiii), $({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}{\preceq} {s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}$. Since $\mathcal{{B}}$ is an IF-positive implicative filter, by Theorem $5.10$, $\mathcal{{B}}$ is an IF-filter, thus, ${\varrho}_{\mathcal{{B}}}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){\preceq} {\varrho}_{\mathcal{{B}}}(({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d})$. Hence,

Therefore, ${\mathcal{{B}}}$ is an IF-implicative filter.

Theorem 5.18. Let $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ be an IF-filter of ${H}$. Then $\mathcal{{B}}$ is an IF-positive implicative filter iff $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}}$ is a Brouwerian semilattice.

Proof. $(\Rightarrow)$ Let $\mathcal{{B}}$ be an IF-filter. Then by Theorem $4.12$, $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}}$ is well-defined. Since $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}}$ is a hoop, then by Proposition $2.1$(i), $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}}$ is a $\wedge$-semilattice. Now, it is enough to prove that

Let $[{d}]_{\mathcal{{B}}}\wedge [{s}]_{\mathcal{{B}}}{\preceq} [{q}]_{\mathcal{{B}}}$. Then by Proposition $2.1$(iii), $[{d}]_{\mathcal{{B}}}\otimes [{s}]_{\mathcal{{B}}}{\preceq} [{d}]_{\mathcal{{B}}}\wedge [{s}]_{\mathcal{{B}}}{\preceq} [{q}]_{\mathcal{{B}}}$. Thus, $[{d}]_{\mathcal{{B}}}\otimes [{s}]_{\mathcal{{B}}}{\preceq} [{q}]_{\mathcal{{B}}}$. Since $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}}$ is a hoop, by Proposition $2.1$(ii), we get $[{d}]_{\mathcal{{B}}}{\preceq} [{s}]_{\mathcal{{B}}}\hookrightarrow [{q}]_{\mathcal{{B}}}$.

Conversely, suppose $[{d}]_{\mathcal{{B}}}{\preceq} [{s}]_{\mathcal{{B}}}\hookrightarrow [{q}]_{\mathcal{{B}}}$. Then $[{d}]_{\mathcal{{B}}}\hookrightarrow ([{s}]_{\mathcal{{B}}}\hookrightarrow [{q}]_{\mathcal{{B}}}) = [1]_{\mathcal{{B}}}$, so ${\varsigma}_{\mathcal{{B}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q})) = {\varsigma}_{\mathcal{{B}}}(1)$ and ${\varrho}_{\mathcal{{B}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q})) = {\varrho}_{\mathcal{{B}}}(1)$. Since $\mathcal{{B}}$ is an IF-positive implicative filter, by Theorem $5.6$(iii), we have

and

Thus, ${\varsigma}_{\mathcal{{B}}}(({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q})) = {\varsigma}_{\mathcal{{B}}}(1)$ and ${\varrho}_{\mathcal{{B}}}(({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {q})) = {\varrho}_{\mathcal{{B}}}(1)$, and so $[{d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}]_{\mathcal{{B}}}{\preceq} [{d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}}{q}]_{\mathcal{{B}}}$. Hence, $[{d}]_{\mathcal{B}}\hookrightarrow [{s}]_{\mathcal{{B}}}{\preceq} [{d}]_{\mathcal{{B}}}\hookrightarrow [{q}]_{\mathcal{{B}}}$. Since $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}}$ is a hoop, by Proposition $2.1$(ii) and (i), we have

Therefore, $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}}$ is a Brouwerian semilattice.

$(\Leftarrow)$ Since $\mathcal{{B}}$ is an IF-filter, by $(IFF1)$, ${\varsigma}_{\mathcal{{B}}}({d}){\preceq} {\varsigma}_{\mathcal{{B}}}(1)$ and ${\varrho}_{\mathcal{{B}}}(1){\preceq} {\varrho}_{\mathcal{{B}}}({d})$, for all ${d}\in {H}$. By assumption, $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}}$ is a Brouwerian semilattice, define $[{d}]_{\mathcal{{B}}}\otimes [{s}]_{\mathcal{{B}}} = [{d}]_{\mathcal{{B}}}\wedge [{s}]_{\mathcal{{B}}}$, for all ${d}, {s}\in {H}$. Since $[{d}]_{\mathcal{{B}}}{\preceq} [{d}]_{\mathcal{{B}}}$, we have

So, $[{d}]_{\mathcal{{B}}}{\preceq} [{d}^{2}]_{\mathcal{{B}}}$. Then $[{d}]_{\mathcal{{B}}}\hookrightarrow [{d}^{2}]_{\mathcal{{B}}} = [1]_{\mathcal{{B}}}$, and so, ${\varsigma}_{\mathcal{{B}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}^{2}) = {\varsigma}_{\mathcal{{B}}}(1)$ and ${\varrho}_{\mathcal{{B}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}^{2}) = {\varrho}_{\mathcal{{B}}}(1)$. Hence, by Theorem $5.12$(v), $\mathcal{{B}}$ is an IF-positive implicative filter.

Example 5.19. Let ${H}$ be the hoop and $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ be an IF-positive implicative filter of ${H}$ as in Example 5.8. Then $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}} = \{[0]_{\mathcal{{B}}}, [{e}]_{\mathcal{{B}}}, [{k}]_{\mathcal{{B}}}, [1]_{\mathcal{{B}}}\}$ is a Brouwerian semilattice.

6.   Construction of Heyting semilattice and Wajesberg hoops by intuitionistic fuzzy fantastic filters

In the following, the concept of intuitionistic fuzzy fantastic filter on hoops is defined and some related results are investigated.

Definition 6.1. Let $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ be an IF-set of ${H}$. Then $\mathcal{{B}}$ is called an intuitionistic fuzzy fantastic filter or an IF-fantastic filter of ${H}$ if, for all ${d}, {s}, {q}\in {H}$,

$(IFFF_{1})$ if ${d}{\preceq} {s}$, then ${\varsigma}_{\mathcal{{B}}}({d}){\preceq} {\varsigma}_{\mathcal{{B}}}({s})$ and ${\varrho}_{\mathcal{{B}}}({s}){\preceq} {\varrho}_{\mathcal{{B}}}({d})$,

$(IFFF_{2})$ ${\varsigma}_{\mathcal{{B}}}({q})\wedge{\varsigma}_{\mathcal{{B}}}({q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d})){\preceq} {\varsigma}_{\mathcal{{B}}}((({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d})$ and ${\varrho}_{\mathcal{{B}}}((({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){\preceq} {\varrho}_{\mathcal{{B}}}({q})\vee{\varrho}_{\mathcal{{B}}}({q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}))$.

Example 6.2. According to Example $5.5$, routine calculation shows that $\mathcal{{B}}$ is an IF-fantastic filter.

Theorem 6.3. Let $\mathcal{{B}}$ be an IF-set of ${H}$. Then $\mathcal{{B}}$ is an IF-fantastic filter of ${H}$ iff for any ${r}\in [0, 1]$, $\mathcal{{B}}_{{r}}\neq \emptyset$ is a fantastic filter.

Proof. The proof is similar to the proof of Theorem $4.6$.

Theorem 6.4. Every IF-fantastic filter of ${H}$ is an IF-filter.

Proof. Let $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ be an IF-fantastic filter and ${d}, {s}\in {H}$. Then $(IFF{1})$ holds. Since $\mathcal{{B}}$ is an IF-fantastic filter, then by Proposition $2.1$(v), we have

By the similar way, we can see that ${{\varsigma}_{\mathcal{{B}}}}({d})\wedge {{\varsigma}_{\mathcal{{B}}}}({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){\preceq} {{\varsigma}_{\mathcal{{B}}}}({s})$. Therefore, $\mathcal{{B}}$ is an IF-filter of ${H}$.

In the next example we show that the converse of the previous theorem does not hold, in general.

Example 6.5. According to Example $5.5$, $\mathcal{{B}}$ is an IF-filter but it is not an IF-fantastic filter. Because

Theorem 6.6. Let $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ be an IF-filter of ${H}$. Then the next statements are equivalent, for all ${d}, {s}\in {H}$,

$(i)$ $\mathcal{{B}}$ is an IF-fantastic filter of ${H}$,

$(ii)$ ${{\varsigma}_{\mathcal{{B}}}}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){\preceq} {{\varsigma}_{\mathcal{{B}}}}((({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d})$ and ${{\varrho}_{\mathcal{{B}}}}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){\succeq} {{\varrho}_{\mathcal{{B}}}}((({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d})$,

$(iii)$ ${{\varsigma}_{\mathcal{{B}}}}((({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} (({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d})) = {{\varsigma}_{\mathcal{{B}}}}(1)$ and ${{\varrho}_{\mathcal{{B}}}}((({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} (({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d})) = {{\varrho}_{\mathcal{{B}}}}(1)$.

Proof. In this proof, we just prove the items of ${\varrho}_{\mathcal{{B}}}$. Also, since $\mathcal{{B}}$ is an IF-filter of ${H}$, by Definition $4.1$, ${\varsigma}_{\mathcal{{B}}}\in FF({H})$ and ${\varrho}_{\mathcal{{B}}}\in AFF({H})$. Then as we notice, ${{\varrho}_{\mathcal{{B}}}}(1){\preceq} {{\varrho}_{\mathcal{{B}}}}({d})$ and ${{\varsigma}_{\mathcal{{B}}}}(1){\succeq} {{\varsigma}_{\mathcal{{B}}}}({d})$, for any ${d}\in {H}$.

$(i)\Rightarrow (ii)$ Suppose $\mathcal{{B}}$ is an IF-fantastic filter and ${d}, {s}\in {H}$. Let ${q} = 1$. Then

$(ii)\Rightarrow (i)$ Let ${d}, {s}, {q}\in {H}$. Since $\mathcal{{B}}$ is an IF-filter, we get ${{\varrho}_{\mathcal{{B}}}}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){\preceq} {{\varrho}_{\mathcal{{B}}}}({q})\vee{{\varrho}_{\mathcal{{B}}}}({q}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}))$. Thus, by (ii),

$(ii)\Rightarrow (iii)$ Let ${d}, {s}\in {H}$. Then by Proposition $2.1$(viii), ${d}{\preceq} ({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}$, thus, by Proposition $2.1$(xiii), $({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}{\preceq} ((({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}$, and so

Since $\mathcal{{B}}$ is an IF-filter,

Now, since $\mathcal{{B}}$ is an IF-fantastic filter, we have

Hence, (iii) holds.

$(iii)\Rightarrow (ii)$ Let ${d}, {s}\in {H}$ such that

Then by (HP3),

Now, since $\mathcal{{B}}$ is an IF-filter, we get

Theorem 6.7. Every IF-implicative filter of ${H}$ is an IF-fantastic filter.

Proof. Let ${d}, {s}\in {H}$ and $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ be an IF-implicative filter of ${H}$. Then by Proposition $2.1$(iv), ${d}{\preceq} (({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}$, thus by Proposition $2.1$(xiii), $((({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}{\preceq} {d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}$, and so by Proposition $2.1$(xiii) and (vii),

Moreover, since $\mathcal{{B}}$ is an IF-implicative filter,

Hence, by Theorem $6.6$(ii), $\mathcal{{B}}$ is an IF-fantastic filter. The next example shows that the converse of the pervious theorem may not be true, in general.

Example 6.8. According to Example $4.4$, define an IF-set $\mathcal{{B}}$ by ${{\varsigma}_{\mathcal{{B}}}}(1) = {{\varsigma}_{\mathcal{{B}}}}({k}) = {r}_{1}$ and ${{\varsigma}_{\mathcal{{B}}}}({e}) = {{\varsigma}_{\mathcal{{B}}}}(0) = {r}_{2}$ such that $0{\preceq} {r}_{2} < {r}_{1}{\preceq} 1$ and ${{\varrho}_{\mathcal{{B}}}} = 1-{{\varsigma}_{\mathcal{{B}}}}$. By routine calculation, $\mathcal{{B}}$ is an IF-fantastic filter but it is not an IF-implicative filter. Because by Theorem $5.6$(ii),

Theorem 6.9. $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ is an IF-implicative filter of ${H}$ iff $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ is an IF-positive implicative filter and IF-fantastic filter of ${H}$.

Proof. $(\Rightarrow)$ By Theorems $6.7$ and $5.14$, the proof is clear.

$(\Leftarrow)$ Let ${d}, {s}\in {H}$. Then by Proposition $2.1$(viii) and (xii),

Since $\mathcal{{B}}$ is an IF-positive implicative filter, by Theorem $5.10$, $\mathcal{{B}}$ is an IF-filter of ${H}$, we have

Also, since $\mathcal{{B}}$ is an IF-positive implicative filter, by Theorem $5.12$(ii), we get

On the other side, by Proposition $2.1$(iv) and (xiii), $({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}{\preceq} {s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}$. Since $\mathcal{{B}}$ is an IF-filter of ${H}$, ${{\varrho}_{\mathcal{{B}}}}(({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){\succeq} {{\varrho}_{\mathcal{{B}}}}({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d})$. Moreover, since $\mathcal{{B}}$ is an IF-fantastic filter, by Theorem $6.6$(ii),

From $\mathcal{{B}}$ is an IF-filter, then

Thus, by Theorem $5.6$(ii), $\mathcal{{B}}$ is an IF-implicative filter.

Theorem 6.10. Let $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ be an IF-filter of ${H}$. Then $\mathcal{{B}}$ is an IF-fantastic filter of ${H}$ iff $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}}$ is a Wajesberg hoop.

Proof. $(\Rightarrow)$ Since $\mathcal{{B}}$ is an IF-filter, by Theorem $4.12$, $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}}$ is well-define and is a hoop. Since $\mathcal{{B}}$ is an IF-fantastic filter of ${H}$, by Theorem $6.6$(iii), we get

and

Then by Theorem $4.12$, $[({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}]_{\mathcal{{B}}}{\preceq} [({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}]_{\mathcal{{B}}}$. By the similar way, $[({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}]_{\mathcal{{B}}}{\preceq} [({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}]_{\mathcal{{B}}}$. Thus

Therefore, $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}}$ is a Wajesberg hoop.

$(\Leftarrow)$ Let $\mathcal{{B}}$ be an IF-filter of ${H}$. Then by $(IFF{1})$, ${\varsigma}_{\mathcal{{B}}}({d}){\preceq} {\varsigma}_{\mathcal{{B}}}(1)$ and ${\varrho}_{\mathcal{{B}}}({d}){\succeq} {\varrho}_{\mathcal{{B}}}(1)$, for all ${d}\in {H}$. Moreover, since $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}}$ is a Wajesberg hoop, we have $([{d}]_{\mathcal{{B}}}\hookrightarrow [{s}]_{\mathcal{{B}}})\hookrightarrow [{s}]_{\mathcal{{B}}} = ([{s}]_{\mathcal{{B}}}\hookrightarrow [{d}]_{\mathcal{{B}}})\hookrightarrow [{d}]_{\mathcal{{B}}}$, for any $[{d}]_{\mathcal{{B}}}, [{s}]_{\mathcal{{B}}}\in \dfrac{{H}}{{\approx}_{\mathcal{{B}}}}$. Thus, ${\varsigma}_{\mathcal{{B}}}((({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} (({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d})) = {\varsigma}_{\mathcal{{B}}}(1)$ and ${\varrho}_{\mathcal{{B}}}((({d}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {s}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} (({s}{ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d}){ {{{{{{{{{{{{{{{{{{{\twoheadrightarrow}}}}}}}}}}}}}}}}}}}} {d})) = {\varrho}_{\mathcal{{B}}}(1)$, thus, by Theorem $6.6$(iii), $\mathcal{{B}}$ is an IF-fantastic filter of ${H}$.

Example 6.11. Let ${H}$ be the hoop as in Example $5.5$. Define ${\varsigma}_{\mathcal{{B}}}(1) = {\varsigma}_{\mathcal{{B}}}({k}) = r_1$, ${\varsigma}_{\mathcal{{B}}}(0) = {\varsigma}_{\mathcal{{B}}}({e}) = r_2$, ${\varrho}_{\mathcal{{B}}}(1) = {\varrho}_{\mathcal{{B}}}({k}) = 1-r_1$ and ${\varrho}_{\mathcal{{B}}}(0) = {\varrho}_{\mathcal{{B}}}({e}) = 1-r_2$, where $0\leq r_2\leq r_1\leq 1$. Then $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}} = \{[0]_{\mathcal{{B}}}, [{e}]_{\mathcal{{B}}}, [1]_{\mathcal{{B}}}\}$ is a Wajesberg hoop.

Theorem 6.12. Let $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ be an IF-filter of ${H}$. Then $\mathcal{{B}}$ is an IF-implicative filter of ${H}$ iff $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}}$ is a Heyting semilattice that has Wajesberg property.

Proof. $(\Rightarrow)$ Let $\mathcal{{B}}$ be an IF-filter. Then by Theorem 4.12, $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}}$ is well-define and is a hoop. Since $\mathcal{{B}}$ is an IF-implicative filter, by Theorem 5.14, we have $\mathcal{{B}}$ is an IF-positive implicative filter. Hence by Theorem 5.18, $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}}$ is a Brouwerian semilattice. On the other side, by Theorem 6.7, $\mathcal{{B}}$ is an IF-fantastic filter, and by Theorem 6.10, $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}}$ is a Wajesberg hoop. Thus, by Proposition 2.3, we define

Then it is easy to see that $\sqcup$ is a join operation, and so by Remark 2.4, ${H}/ {\approx}_{\mathcal{{B}}}$ is a distributive lattice. Therefore, $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}}$ is a Heyting semilattice.

$(\Leftarrow)$ Since $\dfrac{{H}}{ {\approx}_{\mathcal{{B}}}}$ is a Heyting semilattice, then $\dfrac{{H}}{ {\approx}_{\mathcal{{B}}}}$ is a Brouwerian semilattice. Thus, by Theorem 5.18, $\mathcal{{B}}$ is an IF-positive implicative filter. Moreover, by assumption, $\dfrac{{H}}{ {\approx}_{\mathcal{{B}}}}$ is a Wajesberg hoop, by Theorem 6.10, $\mathcal{{B}}$ is an IF-fantastic filter. Thus, by Theorem 6.9, $\mathcal{{B}}$ is an IF-implicative filter of ${H}$.

Example 6.13. Let ${H}$ be the hoop and $\mathcal{{B}} = ({\varsigma}_{\mathcal{{B}}}, {\varrho}_{\mathcal{{B}}})$ be an IF-implicative filter of ${H}$ as in Example 5.2. Then $\dfrac{{H}}{{\approx}_{\mathcal{{B}}}} = \{[0]_{\mathcal{{B}}}, [1]_{\mathcal{{B}}}\}$ is a Heyting semilattice that has Wajesberg property.

7.   Conclusions

In decision problems, the use of fuzzy approaches is ubiquitous. Given the importance of fuzzy concepts in solving decision problems, we decided to use these concepts, intuitionistic fuzzy sets, in a specific logical algebra to provide a new approach with useful mathematical tools to address the fundamental decision problem. In this paper, the concept of anti-fuzzy filter of hoops is defined and the concepts of intuitionistic fuzzy filters, intuitionistic fuzzy (positive) implicative and intuitionistic fuzzy fantastic filters of hoops are introduced and the properties and equivalent characterizations of them are discussed. Moreover, it was proved that all intuitionistic fuzzy filters make a bounded distributive lattice. Also, the relations between different kinds of intuitionistic fuzzy filters are investigated and studied that under which conditions they are equivalent. Also, a congruence relation on hoops is defined by an intuitionistic fuzzy filter and proved the new structure is a hoop. Finally, the conditions that quotient structure will be Brouwerian semilattice, Heyting algebra and Wajesberg hoop are investigated.

Conflict of interest

The authors declare that there is no conflict of interest.