#### Abstract

We give the simple general principle of studying the relations among fuzzy t-filters on residuated lattices. Using the general principle, we can easily determine the relations among fuzzy t-filters on different logical algebras.

#### 1. Introduction

Residuated lattices, invented by Ward and Dilworth [1], constitute the semantics of Höhle’s Monoidal Logic [2]. Residuated lattices are very useful and are basic algebraic structures. Many logical algebras, such as Boolean algebras, MV-algebras, BL-algebras, MTL-algebras, Gödel algebras, NM algebras, and R0-algebras, are particular residuated lattices. Besides their logical interest, residuated lattices have lots of interesting properties. In [3], Idziak proved that the varieties of residuated lattices are equational.

Filters play a vital role in investigating logical algebras and the completeness of the corresponding nonclassical logics. From logical points of view, filters correspond to sets of provable formulae. At present, the filter theory on different logical algebras has been widely studied. Only on residuated lattices, such literatures are as follows: [411]. In [8, 9], Ma et al. found the common features of filters on residuated lattices. They, respectively, proposed the notion of -filters and -filters on residuated lattices. In [9], Víta studied some basic properties of -filters and gave the simple general framework of special types of filters.

After Zadeh [12] proposed the theory of fuzzy sets, it has been applied to many branches in mathematics. The fuzzification of the filters was originated in 1995 [13]. Subsequently, a large amount of papers about special types of fuzzy filters was published in many journals on different logical algebras [10, 11, 1424]. In [23], Víta found the common features of fuzzy filters on residuated lattices. He proposed the notion of fuzzy -filters and proved its basic properties. However, the relations among fuzzy -filters were not discussed. Usually, when studying the relations among special types of fuzzy filters, the equivalent characterizations of special types of fuzzy filters were firstly discussed. Then, resorting to the properties of the logical algebras, the relations among special types of fuzzy filters were given. The proofs were tedious in many literatures. The motivation of this paper is to give the simple general principle of studying the relations among fuzzy -filters on residuated lattices. In contrast to proofs of particular results for concrete special types of fuzzy filters, proofs of those general theorems in this paper are simple. And the general principle can be applied to all the subvarieties of residuated lattices.

#### 2. Preliminary

Definition 1 (see [1, 25]). A residuated lattice is an algebra such that for all , , ,(1) is a bounded lattice;(2) is a commutative monoid;(3) forms an adjoint pair; that is, if and only if .
We denote .

Definition 2 (see [11, 2530]). Let be a residuated lattice. Then is called (i)an MTL-algebra if for all , (prelinear axiom);(ii)an Rl-monoid if for all , (divisible axiom);(iii)a Heyting algebra if for all , , which is equivalent to an idempotent residuated lattice; that is, for ;(iv)a regular residuated lattice if it satisfies double negation; that is, for ;(v)a BL-algebra if it satisfies both prelinear and divisible axioms;(vi)an MV-algebra if it is a regular Rl-monoid;(vii)a Gödel algebra if it is an idempotent BL-algebra;(viii)a Boolean algebra if it is an idempotent MV-algebra;(ix)a R0-algebra (NM algebra) if it satisfies prelinear axiom, double negation, and .

Definition 3 (see [25, 31, 32]). Let be a residuated lattice. Then, a nonempty subset of is called a filter if(1)for all and , implies ,(2)for all , , .

Definition 4 (see [511]). Let be a filter of . Then, is called(i)an implicative filter if for all ,(ii)a regular filter if for all ,(iii)a divisible filter if for all , ,(iv)a prelinear filter if for all , ,(v)a Boolean filter if for all ,(vi)a fantastic filter if for all , ,(vii)an -contractive filter if for all , where , .

Remark 5. On residuated lattices, holds (see [31]). Using these properties, we have that is a fantastic filter if .

We now review some fuzzy concepts. A fuzzy set on residuated lattice is a function . For any and an arbitrary fuzzy set , we denote the set (i.e., the -cut) by the symbol .

Definition 6 (see [10, 11]). A fuzzy set is a fuzzy filter on if and only if it satisfies the following two conditions for all :(1),(2)if , then .
In the following, by the symbol we denote the abbreviation of ; that is, is a formal listing of variables used in a given content. By the term , it is always meant as a term in the language of residuated lattices.

Definition 7 (see [9]). Let be an arbitrary term on the language of residuated lattices. A filter on is a -filter if for all .

Definition 8 (see [23]). A fuzzy filter on is called a fuzzy -filter on , if for all it satisfies .

Example 9 (see [11]). Fuzzy Boolean filters are fuzzy -filters for equal to .

Example 10 (see [11]). Fuzzy regular filters are fuzzy -filters for equal to .

Example 11 (see [11]). Fuzzy fantastic filters are fuzzy -filters for equal to .

Remark 12. Using the notion of fuzzy -filter, fuzzy implicative filters are fuzzy -filters for equal to . Fuzzy divisible filters are fuzzy -filters for equal to and so forth.

Let us assume that since now, is an arbitrary term in the language of residuated lattices. We also use another useful convention: given a variety of residuated lattices, we denote its subvariety given by the equation by the symbol ; we call this algebra -algebra.

The next part of this paper concerns fuzzy quotient constructions. We recall some known results and constructions concerning fuzzy quotients residuated lattices.

Theorem 13 (see [11]). Let be a fuzzy filter on and . For any , we define , . Then, if and only if .

Theorem 14 (see [11]). Let be a fuzzy filter on and . For any , we define,,,.Then, is a residuated lattice called the fuzzy quotient residuated lattice.

Theorem 15 (quotient characteristics [23]). Let be a variety of residuated lattices and . Let be a fuzzy filter on . Then, the fuzzy quotient / belongs to if and only if is a fuzzy -filter on .

#### 3. The General Principle of the Relation among Fuzzy -Filters and Its Application

In the following, let be a variety of residuated lattices. and is a fuzzy filter on .

Theorem 16. Suppose that there are fuzzy -filter and fuzzy -filter on and . If is a fuzzy -filter, then is a fuzzy -filter.

Proof. is a fuzzy -filter is a fuzzy -filter.

Theorem 17. Suppose there are fuzzy -filter and fuzzy -filter on . If , then is a fuzzy -filter if and only if is a fuzzy -filter.

Proof. is a fuzzy -filter is a fuzzy -filter.

Remark 18. The above results give the general principle of the relations among fuzzy -filters. If we want to judge the relations among fuzzy -filter, we only resort to the relations among -algebras. Since the relations among -algebras are known to us, we can easily obtain the relations among fuzzy -filters.

Theorem 19. Let be a residuated lattice. If is a fuzzy implicative filter, then is a fuzzy -contractive filter.

Proof. It is obvious that . By Theorem 16, the result is clear.

Lemma 20 (see [5, 27]). Let be a residuated lattice. If is a Heyting algebra, then is an Rl-monoid.

Lemma 21 (see [11]). Let be a residuated lattice. Then the following are equivalent:(1) is an MV-algebra;(2).

Lemma 22 (see [25]). Let be a residuated lattice. Then is an MV-algebra if and only if is a regular BL-algebra.

Lemma 23. Let be a residuated lattice. Then the following are equivalent:(1) is a Boolean algebra;(2), ;(3) is regular and idempotent.

Proof. (1)(2) Reference [11], Proposition 2.10.
(1)(3) If is a Boolean algebra, then is an idempotent MV-algebra. Thus, is regular and idempotent.
(3)(1) If is regular and idempotent, then is a regular Rl-monoid. Thus, is an MV-algebra. Also, is idempotent; therefore, is a Boolean algebra.

Lemma 24. Let be a residuated lattice. Then the following are equivalent:(1) is a Boolean algebra;(2) is an idempotent R0-algebra.

Proof. (1)(2) If is a Boolean algebra, then is a R0-algebra ([30], Example ) and is idempotent.
(2)(1) Suppose is an idempotent R0-algebra. Since is a R0-algebra, then is regular. By Lemma 23, we have that is a Boolean algebra.

Lemma 25. Let be a residuated lattice. and are arbitrary terms on . Then, .

Proof. and ; and .

Theorem 26. Let be a residuated lattice. Then, is a fuzzy Boolean filter if and only if is both a fuzzy regular and a fuzzy implicative filter.

Proof. is a fuzzy Boolean filter and is both a fuzzy regular and a fuzzy implicative filter.

Remark 27. Using the same method, we can easily obtain the following results.

Theorem 28. Let be a residuated lattice. Then(1) is a fuzzy Boolean filter if and only if is a fuzzy fantastic and fuzzy implicative filter;(2) is a fuzzy fantastic filter if and only if is a fuzzy regular and fuzzy divisible filter;(3)every fuzzy implicative filter is a fuzzy divisible one;(4)if is a fuzzy prelinear filter, then is a fuzzy fantastic filter if and only if is both a fuzzy regular and a fuzzy divisible filter;(5)if is a fuzzy Boolean filter, then is a fuzzy -contractive filter.

Remark 29. The notion of fuzzy -filter and the general principle are not only applicable on residuated lattices, but also even transferable to all their subvarieties. Taking advantage of the relations among -algebras, we can easily obtain the following results.

Theorem 30. Let be a Boolean-algebra. Then the fuzzy prelinear filter, fuzzy fantastic filter, fuzzy divisible filter, fuzzy regular filter, and fuzzy -contractive and fuzzy Boolean filter coincide.

Theorem 31. Let be an MV-algebra. Then(1) is a fuzzy Boolean filter if and only if is a fuzzy implicative filter;(2)the fuzzy prelinear filter, fuzzy fantastic filter, fuzzy divisible filter, and fuzzy regular filter coincide.

Theorem 32. Let be a Gödel-algebra. Then(1) is a fuzzy Boolean filter if and only if is a fuzzy regular filter if and only if is a fuzzy fantastic filter;(2)the fuzzy prelinear filter, fuzzy divisible filter, fuzzy -contractive filter, and fuzzy implicative filter coincide.

Theorem 33. Let be a BL-algebra; then(1) is a fuzzy Boolean filter if and only if is both a fuzzy implicative and a fuzzy regular filter;(2) is a fuzzy Boolean filter if and only if is both a fuzzy implicative and a fuzzy fantastic filter;(3) is a fuzzy fantastic filter if and only if is a fuzzy regular filter;(4)the fuzzy prelinear filter and fuzzy divisible filter coincide.

Theorem 34. Let be an MTL-algebra. Then,(1) is a fuzzy Boolean filter if and only if is both a fuzzy implicative and a fuzzy regular filter;(2) is a fuzzy Boolean filter if and only if is both a fuzzy implicative and a fuzzy fantastic filter;(3) is a fantastic filter if and only if is a regular and divisible filter;(4)if is a fuzzy implicative filter, then is a fuzzy divisible filter.

Theorem 35. Let be a Heyting-algebra. Then(1) is a fuzzy Boolean filter if and only if is a fuzzy regular filter if and only if is a fuzzy fantastic filter;(2)the fuzzy implicative filter, fuzzy divisible filter, and fuzzy -contractive filter coincide.

Theorem 36. Let be a R0-algebra; then(1) is a fuzzy Boolean filter if and only if is a fuzzy implicative filter;(2)every fuzzy Boolean filter is a fuzzy fantastic filter;(3) is a fuzzy fantastic filter if and only if is a fuzzy divisible filter;(4)the fuzzy prelinear filter and fuzzy regular filter coincide;(5)every fuzzy implicative filter is a fuzzy divisible one.

Theorem 37. Let be a regular residuated lattice. Then(1) is a fuzzy Boolean filter if and only if is a fuzzy implicative filter;(2) is a fuzzy fantastic filter if and only if is a fuzzy divisible filter;(3)every fuzzy Boolean filter is a fuzzy fantastic filter;(4)every fuzzy implicative filter is a fuzzy divisible one.

Theorem 38. Let be a Rl-monoid. Then(1) is a fuzzy Boolean filter if and only if is a fuzzy implicative and fuzzy fantastic filter;(2) is a fuzzy Boolean filter if and only if is a fuzzy implicative and fuzzy regular filter;(3) is a fuzzy fantastic filter if and only if is a fuzzy regular filter;(4)every fuzzy implicative filter is a fuzzy divisible one.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgments

This work was supported by the National Natural Science Foundation of China, Grant nos. 11371130 and 61273018, and by the Research Fund for the Doctoral Program of Higher Education of China, Grant no. 20120161110017.