Abstract:In this short paper we introduce the notion of α-filter in the class of distributive nearlattices and we prove that the α-filters of a normal distributive nearlattice are strongly connected with the filters of the distributive nearlattice of the annihilators.
“…By Lemma 1 and Theorem 3 we have R(A) = ⟨R(A), m, A⟩ is a distributive nearlattice (for more details see [5,6]).…”
Section: Annihilators and Normal Distributive Nearlatticesmentioning
confidence: 96%
“…We recall the basics results about distributive nearlattices, where our main references are [8,2,3,5,6].…”
Section: Distributive Nearlatticesmentioning
confidence: 99%
“…Then Fi α (A) = ⟨Fi α (A), ⊔, ∩, ⇒, {1}, A⟩ is a Heyting algebra, where for each F, G ∈ Fi α (A), we have F⊔G = α(F⊻G) and F ⇒ G = α(F → G) (see [5]).…”
Section: Proposition 2 ([5]mentioning
confidence: 99%
“…and ρ is a onto homomorphism between the distributive nearlattices A and R(A) such that Θ ⊤ = Ker(ρ) ( [5,6]). The next result give a necessary and sufficient conditions through α-filters so that ρ is 1-1.…”
Section: Theorem 4 ([6]mentioning
confidence: 99%
“…In particular, in [3], the authors presented an alternative definition of relative annihilator in distributive nearlattices different from that given in [9] and established new equivalences of the distributivity. Later, using the results developed in [3], the notion of annihilator was studied in [4][5][6].…”
The aim of this paper is to introduce the quasicomplemented distributive nearlattices. We investigateα-filters and α-ideals in the class of quasicomplemented distributive nearlattices and some results on ideals-congruence-kernels. We also study the notion of Stone distributive nearlattice and give a characterization by means σ-filters.
“…By Lemma 1 and Theorem 3 we have R(A) = ⟨R(A), m, A⟩ is a distributive nearlattice (for more details see [5,6]).…”
Section: Annihilators and Normal Distributive Nearlatticesmentioning
confidence: 96%
“…We recall the basics results about distributive nearlattices, where our main references are [8,2,3,5,6].…”
Section: Distributive Nearlatticesmentioning
confidence: 99%
“…Then Fi α (A) = ⟨Fi α (A), ⊔, ∩, ⇒, {1}, A⟩ is a Heyting algebra, where for each F, G ∈ Fi α (A), we have F⊔G = α(F⊻G) and F ⇒ G = α(F → G) (see [5]).…”
Section: Proposition 2 ([5]mentioning
confidence: 99%
“…and ρ is a onto homomorphism between the distributive nearlattices A and R(A) such that Θ ⊤ = Ker(ρ) ( [5,6]). The next result give a necessary and sufficient conditions through α-filters so that ρ is 1-1.…”
Section: Theorem 4 ([6]mentioning
confidence: 99%
“…In particular, in [3], the authors presented an alternative definition of relative annihilator in distributive nearlattices different from that given in [9] and established new equivalences of the distributivity. Later, using the results developed in [3], the notion of annihilator was studied in [4][5][6].…”
The aim of this paper is to introduce the quasicomplemented distributive nearlattices. We investigateα-filters and α-ideals in the class of quasicomplemented distributive nearlattices and some results on ideals-congruence-kernels. We also study the notion of Stone distributive nearlattice and give a characterization by means σ-filters.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.