Abstract
In any logical algebraic structures, by using of different kinds of filters, one can construct various kinds of other logical algebraic structures. With this inspirations, in this paper by considering a hoop algebra or a hoop, that is introduced by Bosbach, the notion of co-filter on hoops is introduced and related properties are investigated. Then by using of co-filter, a congruence relation on hoops is defined, and the associated quotient structure is studied. Thus Brouwerian semilattices, Heyting algebras, Wajsberg hoops, Hilbert algebras and BL-algebras are obtained.
Keywords:
hoop; co-filter; Brouwerian semilattice; Heyting algebra; Wajsberg hoop; Hilbert algebra; BL-algebra MSC:
03G99; 06B10
1. Introduction
Non-classical logics (or called alternative logics) are formal systems that differ in a significant way from standard logical systems such as propositional and predicate logic. Many-valued logics are non-classical logics which are similar to classical logic. Bosbach [1,2] proposed the concept of hoop which is a nice algebraic structure to research the many-valued logical system whose propositional value is given in a lattice. For various information on hoops, refer to [3,4,5,6,7,8].
In this paper, we introduce the notion of co-filter in hoops and we get some properties of it. Then we construct a congruence relation by using co-filters on hoops. Finally, we investigate under which conditions the quotient structure of this congruence relation will be Brouwerian semilattice, Heyting algebra, Wajsberg hoop, Hilbert algebra and BL-algebra.
2. Preliminaries
In this section, we recollect some definitions and results which will be used in the following and we shall not cite them every time they are used.
Definition 1
([9]). A hoop is an algebraic structure of type such that, for all it satisfies in the following conditions:
is a commutative monoid.
.
.
.
On hoop , a binary relation ≤ is defined on such that iff and is a poset. If the least element exists such that, for all , , then is called a bounded hoop. We let and , for any . If is bounded, then, for all , the operation negation “ ′ ” is defined on by, . If , for all , then is said to have (DNP) property.
Proposition 1
([1,2]). Let be a hoop. Then, for all , it satisfies in the following conditions:
is a meet-semilattice with .
iff .
and , for any .
.
and .
.
.
implies , and .
Proposition 2
([1,2]). Let be a bounded hoop. Then, for any , the following conditions hold:
and
.
.
If has (DNP), then .
If has (DNP), then .
Proposition 3
([10]). Let be a hoop and for any , define the operation ∨ on as follows,
Then, for all , the following conditions are equivalent:
∨ is associative,
implies ,
,
∨ is the join operation on .
A hoop is said to a ∨-hoop, if it satisfies one of the above equivalent conditions.
Proposition 4
([10]). Let be a ∨-hoop and . Then ∨-hoop is a distributive lattice and .
Definition 2
([10]). A non-empty subset F of a hoop is called a filter of if, for any , the following condition hold:
implies .
and imply .
The set of all filters of is denoted by . Clearly, for any filter F of , . F is called a proper filter if . So, if is a bounded hoop, then a filter is proper iff it does not contain 0. It is easy to see that iff, for any , and if , then .
3. Co-Filters in Hoops
From here on, if there is no mention, denotes a bounded hoop.
We introduce the notion of co-filters on hoops, and it is proved that co-filters are not filters and some properties of them are studied. Moreover, a congruence relation is defined by them and is investigated the quotient structure of this congruence relation.
Definition 3.
A subset I of is said to be a co-filter of if, for any ,
.
and imply .
Example 1.
Let . Define the operations ⊙ and → on as below,
Then is a hoop and is a co-filter of , which is not a filter of because .
Note. For , define .
Proposition 5.
If has (DNP) and , then I is a filter of iff is a co-filter of .
Proof.
Suppose . Then , and so . Let such that and . Since has (DNP), by Proposition 2(iv), , and since , by Definition 2, , and so . Hence, is a co-filter of .
Let be a co-filter of . Then , and so . Now, suppose such that . Thus and . Since has (DNP), by Proposition 2(iv), , and since is a co-filter of , by definition, . Hemce, by (DNP), . Therefore, . □
If does not have (DNP), then Proposition 5 is not true, in general. We show this in the following example.
Example 2.
Let be a chain such that and two binary operations ⊙ and → which are given below,
By routine calculations, is a hoop that does not have (DNP). It is clear that is a co-filter of but is not a filter of .
Note. If F is a proper filter of , then by Definition 2, . Thus, F is not a co-filter of . On the other hand, for any proper co-filter I of , if , then .
Proposition 6.
Let I be a co-filter of . Then the following statements hold:
If and , then , for any .
If , then , for any .
If is a ∨-hoop with (DNP), then , for any .
Proof.
Let such that and . Then , and so . Since I is a co-filter of , and , we have .
Let and . By Proposition 1(iii), . Since , by (i), .
Suppose . By Proposition 4,
then . By Proposition 2(ii), , and so, by Proposition 1(viii) and (DNP), . Hence, . From I is a co-filter of and , by (i) . Moreover, by assumption, and I is a co-filter of . Therefore, . □
Corollary 1.
If I is a co-filter of and , then .
Proof.
By Proposition 6(i), the proof is straightforward. □
We provide conditions for a nonempty subset to be a co-filter.
Proposition 7.
Let and such that I has the following properties,
if , then ,
if and , then .
Then I is a co-filter of .
Proof.
Let . Since, for all , , by (ii), . Suppose such that and . Then by (i),
By (HP3), . Moreover, by Propositions 2(i) and 1(viii), and so . Since , by (ii), . Also, by Proposition 1(vi), , and by (ii), . Hence I is a co-filter of . □
By below example, we show that the converse of Proposition 7, is not true.
Example 3.
Let be a set with the following Cayley tabels:
Then is a hoop and is a co-filter of but .
Proposition 8.
Let has (DNP). Then I is a co-filter of iff for any , I has the following properties,
if , then .
if and , then .
Proof.
(⇒) Let I be a co-filter of . Then by Proposition 6(i), item (ii) is clear. Suppose . By Proposition 1(vi) and (viii), . Since has (DNP), . By assumption, , and so by Proposition 6(i), . Moreover, since and I is a co-filter of , .
(⇐) The proof is similar to the proof of Proposition 7. □
Theorem 1.
Let I be a co-filter of . Then, for all , the following statements hold:
and imply .
If , then .
and imply .
If , then .
Proof.
Let such that and . Since I is a co-filter of , . By Proposition 1(iv), . From Proposition 6(i), .
By Proposition 1(iii) and (viii), and . Since , by Proposition 6(i), .
Suppose such that and . Since I is a co-filter of , , and so by (ii), .
Let such that . Then by (HP3), we have
Thus, , and so . Since and I is a co-filter of , by Proposition 6(i), . □
If , then the least co-filter of contains X is called the co-filter generated by X of and we show it by .
Theorem 2.
If has (DNP), then, for any ,
Proof.
Let . Since , for all , we have , and so . Now, suppose such that and . Then there exist , such that and . By Proposition 1(viii),
By (HP3), we get
Then , and so . Hence, exists such that . Therefore, , and so B is a co-filter of . Also, by Proposition 1(iii), . Thus, and B is a co-filter of which containing a. Now, it is enough to prove that B is the least co-filter of which containing a. Suppose C is a co-filter of that contains a. We show that . Let . Then there exists such that . Thus . Since has (DNP), by (HP3) and Proposition 2(iv), we get
By continuing this method, we have
Hence,
Since C is a co-filter of and , we obtain,
By continuing this method, we can see that . Since , and C is a co-filter of , we have . Hence, . Therefore, . □
Corollary 2.
Let has (DNP), and . Then the following statements hold:
.
.
Proof.
The proof is similar to the proof of Theorem 2. □
Example 4.
Let A be the hoop as in Example 3. It is clear that A has (DNP). Since and and , we get . Also, since and , we have .
Theorem 3.
Let I be a co-filter of . We define the relation on as follows,
Then is a congruence relation on .
Proof.
At first, we prove that is an equivalence relation on . Since, for all , and I is a co-filter of , . Thus, , and so is reflexive. It is obvious that is symmetric. For proving transitivity of , suppose such that and . Hence, and by Proposition 1(vii) and (viii),
By (HP3) and Propositions 1(vii),(viii) and 2(iii), we have,
Thus, by Proposition 6(i),
Since and I is a co-filter of , . Moreover, and , by Proposition 6(i), . By the similar way, . Hence, . Therefore, is an equivalence relation on . Now, let , for some . Then . Thus, by Proposition 1(vi), , for all . So, by Proposition 1(viii), . Then by Proposition 1(viii) and (HP3),
Since and I is a co-filter of , by Proposition 6(i), . By the similar way, . Hence, . Suppose , for some . Then and by Proposition 1(vii) and (HP3), , for all . Also, by Proposition 1(viii),
From and I is a co-filter of , by Proposition 6(i), . By the similar way, . Hence, . Finally, if , for some , then . From , by Proposition 1(ii),(viii) and (HP3), , and so
Then by Proposition 1(viii),
Since and I is a co-filter of , by Proposition 6(i), . Similarly, . Hence, . Therefore, is a congruence relation on . □
For any , will denote the equivalence class of α with respect to . It is clear that
Easily we can see that and .
Theorem 4.
Let . Define the operations ⊗ and ⇝ on as follows:
Then is a bounded hoop.
Proof.
The proof is straightforward.
Note. Let . Then the binary relation “” is defined on as follows,
Then is a partially order relation on . Since , for any , . Suppose and , for any . Then and . Thus, , and so . Now, let and . Then and . By Proposition 1(vii), for , we have . Thus, by Proposition 1(viii) and (HP3),
and so
Thus, . Moreover, by Proposition 1(ii),
Hence, by Proposition 1(viii), we obtain,
Since and I is a co-filter of , by Proposition 6(i), . Also, , then . Hence, . Therefore, is a partially order relation on .
For proving is a bounded hoop, we have and iff and . Since is a congruence relation on , so all operations are well-defined. Thus, by routine calculations, we can see that is a commutative monoid and (HP2) holds. Let , for any . Since is a hoop, by (HP3) and (HP4) we have,
Also, for any , we get
Therefore, is a bounded hoop. □
Example 5.
Let A be the hoop as in Example 3. Then is a co-filter of A. Thus, by routine calculations, we can see that and . Hence, . Therefore, is a bounded hoop.
Example 6.
Let A be the hoop as in Example 2. We can see that A does not have (DNP) property, in general. So by Proposition 5 and Example 2, filter and co-filter are different notions. Then A is a co-filter of A and the quotient is that is a hoop algebra. But is a filter of A and the quotient that is a hoop with (DNP).
4. Some Applications of Co-Filters
In this section, we try to investigate under which conditions the quotient structure of this congruence relation will be Brouwerian semilattice, Heyting algebra, Wajsberg hoop, Hilbert algebra and BL-algebra.
Definition 4
([11]). A Brouwerian lattice is an algebra with the lattice infimum () and the lattice supremum () in which two operations “” and “” are defined by and
respectively.
Theorem 5.
Let I be a co-filter of and for all , . Then is a Brouwerian semilattice.
Proof.
Let I be a co-filter of . By Theorem 4, is a hoop. Thus, by Proposition 1(i), is a meet-semilattice with , for all . Now, we prove that, for all ,
Since is a hoop, by Proposition 1(iii), . Thus, , and so by Proposition 1(ii), . Conversely, suppose , for all . According to definition of , . By Proposition 1(vii), and by (HP3), . Also, by Proposition 1(viii) and (HP3), we get
and so
Thus,
Since for any , , we obtain, and so,
Hence, by Proposition 1(viii), we get . Since I is a co-filter of and , by Proposition 6(i), , so . Thus, by Proposition 1(ii),(i) and (viii),
Hence, . Therefore, is a Brouwerian semilattice. □
Example 7.
Let be a set with two operations which are given below:
Thus, is a hoop and , for all . Then is a co-filter of , and . Hence, by Theorem 5, is a Brouwerian semilattice.
Theorem 6.
Let has (DNP) and be a Brouwerian semilattice. Then I is a co-filter of .
Proof.
Let , for all . Then . Thus, , and so . By Proposition 1(iii), . Now, suppose and , for some . Since , we have . It means that , and equivalently . Moreover, , then , and so i.e., . Hence, . Since has (DNP), we get . Therefore, I is a co-filter of . □
Definition 5
([11]). A hoop is called Wajsberg if, for any ,
Theorem 7.
Let has (DNP). Then I is a co-filter of iff is a Wajsberg hoop.
Proof.
(⇒) Since has (DNP), by Proposition 2(v), , for all . Thus,
and so . By the similar way, . Thus, , for all . Therefore, is a Wajsberg hoop.
(⇐) The proof is similar to the proof of Theorem 6. □
Example 8.
In Example 1, is a hoop with (DNP). Since is a co-filter of , and . Hence, by Theorem 7, is a Wajsberg hoop.
Definition 6
([11]). A Heyting algebra is an algebra , where is a distributive lattice with the greatest element and the binary operation → on A verifies, for any ,
Theorem 8.
Let has (DNP) and , for all . Then I is a co-filter of iff is a Heyting algebra.
Proof.
(⇒) Since I is a co-filter of and , for all , by Theorem 5, is a Brouwerian semilattice. Moreover, since has (DNP), by Theorem 7, is a Wajsberg hoop. Define , for all . Then by Propositions 3 and 4, is a distributive lattice. Therefore, is a Heyting algebra.
(⇐) Since is a Heyting algebra, it is a Brouwerian semilattice. On the other side, has (DNP), then by Theorem 6, I is a co-filter of . □
Example 9.
Let be a set with the following Cayley tabels,
Then is a hoop with (DNP) and for any , . From is a co-filter of , . Then by Theorem 8, is a Heyting algebra.
Definition 7
([11]). A Hilbert algebra is a tripe of type such that, for all , the following three axioms are satisfied,
.
.
If , then .
The Hilbert algebra induces a partial order ≤ on A, defined by, iff and 1 is the greatest element of the induced poset . A Hilbert algebra A is bounded if there is an element such that, for any , .
Lemma 1.
Let , for all . Then, for all ,
Proof.
Let such that . Then by Proposition 1(iv), , for any and by Proposition 1(viii), . Then by (HP3), . Conversely, by (HP3), for all ,
By Proposition 1(vii), . Then by Proposition 1(viii) and (vii),
Thus, . Since , we get . Hence, by (HP3), . □
Theorem 9.
Let I be a co-filter of and , for all . Then is a Hilbert algebra.
Proof.
Since I is a co-filter of , by Theorem 5, is a hoop. Thus by Proposition 1(iv), it is clear that , for all . Let such that . Then and and so . Hence, . Moreover, since , for all , by Lemma 1, , for all , and so
Thus, by definition of ,
Therefore, is a Hilbert algebra. □
Definition 8
([11]). A BL-algebra is an algebra of type that, for any , it is satisfying the following axioms:
is a bounded lattice.
is a commutative monoid.
iff .
.
.
Theorem 10.
Let be a ∨-hoop such that, for all , and I be a co-filter of . Then is a BL-algebra.
Proof.
Let be a ∨-hoop. Then is a -hoop. Thus, by Proposition 4, is a bounded distributive lattice. Now, we prove that is a BL-algebra. For this, it is enough to prove that , for all . Equivalently, we show that , for all . Since for all ,
by Proposition 1(viii),
On the other hand, by Proposition 1(iv), and by Proposition 2(ii), , then by Proposition 1(viii), and . Thus, by Propositions 1(i), 2(i) and , for all , we have
Then . Therefore, is a BL-algebra. □
Theorem 11.
Let has (DNP) and , for all . Then I is a co-filter of iff is a BL-algebra.
Proof.
(⇒) Since has (DNP) and I is a co-filter of , by Theorem 7, is a Wajsberg hoop. Define for all . Then by Proposition 3, is a -hoop, and so by Proposition 4, is a bounded lattice. On the other side, since , for all , by Theorem 10, is a BL-algebra.
(⇐) Since has (DNP) and is a BL-algebra, is a distributive lattice. Thus, by Theorem 6, I is a co-filter of . □
Remark 1.
As you see in this section, we investigated the relation among the quotient hoop that is made by a co-filter I with other logical algebras such as Brouwerian semi-lattice, Heyting algebra, Hilbert algebra, Wajsberg hoop and BL-algebra. Clearly these conditions are similar and we know that for example if A has Godel condition () then is Hilbert algebra and by adding (DNP) property to A we obtain that is Heyting algebra.
5. Conclusions and Future Works
We have introduced the notion of co-filter of hoops and a congruence relation on hoop, and then we have constructed the quotient structures by using co-filters. We have considered the relation between filters and co-filters in a hoop with (DNP) property. We have provided conditions for a subset to be a co-filter. We have discussed characterizations of a co-filter. We have studied the relation among this structure and other algebraic structures. Using the notion of co-filters, we have established the quotient Brouwerian semilattice, the quotient Hilbert algebra and the quotient BL-algebra. We have induced a co-filter from a quotient Brouwerian semilattice. In our subsequent research, we will study some kinds of co-filter such as, implicative, ultra and prime one and investigate the relation between them. Also, we will discuss fuzzy co-filters and fuzzy congruence relation by them and study the quotient structure of this fuzzy congruence relation.
Author Contributions
Creation and Mathematical Ideas, R.A.B.; writing–original draft preparation, M.A.K.; writing–review and editing, S.-Z.S. and Y.B.J.; funding acquisition, S.-Z.S.
Funding
This research was supported by Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Education(No. 2016R1D1A1B02006812).
Acknowledgments
The authors express their sincere gratitude to the unknown reviewers for their detailed reading and valuable advice.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Bosbach, B. Komplementäre Halbgruppen. Kongruenzen und Quatienten. Funda. Math. 1970, 69, 1–14. [Google Scholar] [CrossRef]
- Bosbach, B. Komplementäre Halbgruppen. Axiomatik und Arithmetik. Funda. Math. 1969, 64, 257–287. [Google Scholar] [CrossRef]
- Aaly Kologani, M.; Borzooei, R.A. On ideal theory of hoops. Math. Bohem. 2019. [Google Scholar] [CrossRef]
- Borzooei, R.A.; Aaly kologani, M. Filter theory of hoop-algebras. J. Adv. Res. Pure Math. 2014, 6, 1–15. [Google Scholar] [CrossRef]
- Alavi, S.Z.; Borzooei, R.A.; Aaly Kologani, M. Filter theory of pseudo hoop-algebras. Ital. J. Pure Appl. Math. 2017, 37, 619–632. [Google Scholar]
- Namdar, A.; Borzooei, R.A. Nodal filters in hoop algebras. Soft Comput. 2018, 22, 7119–7128. [Google Scholar] [CrossRef]
- Namdar, A.; Borzooei, R.A.; Borumand Saeid, A.; Aaly Kologani, M. Some results in hoop algebras. J. Intell. Fuzzy Syst. 2017, 32, 1805–1813. [Google Scholar] [CrossRef]
- Rezaei, A.; Borumand Saeid, A.; Borzooei, R.A. Some types of filters in BE-algebras. Math. Comput. Sci. 2013, 7, 341–352. [Google Scholar]
- Aglianò, P.; Ferreirim, I.M.A.; Montagna, F. Basic hoops: An Algebraic Study of Continuous T-Norms. Stud. Log. 2007, 87, 73–98. [Google Scholar] [CrossRef]
- Georgescu, G.; Leustean, L.; Preoteasa, V. Pseudo-hoops. J. Mult.-Valued Log. Soft Comput. 2005, 11, 153–184. [Google Scholar]
- Iorgulescu, A. Algebras of logic as BCK-algebras; Editura ASE: Bucharest, Romania, 2008. [Google Scholar]
© 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).