Distributive Pseudo Be-Algebras (original) (raw)
2015, Fasciculi Mathematici
In this paper, we introduce the notion of distributive pseudo BE-algebra and show that the related relation defined on this structure is transitive and prove that every pseudo upper set is a pseudo filter. Also, the pseudo filter generated by a set is define and show that the set of all pseudo filters is distributive complete lattice but it is not complemented. the notion of prime and irreducible subset and prove that every irreducible subset is prime.
Related papers
• Dual Psuedo-Complemented Almost Distributive Lattices
International Journal of Mathematical Archive, 2012
The concept of a dual pseudo-complemented Almost Distributive Lattice is introduced. Necessary and sufficient conditions for an Almost Distributive Lattice to become a dual pseudo-complemented Almost Distributive Lattice are derived. It is proved that a dual pseudo-complemented Almost Distributive Lattice is equationally definable. A one to one correspondence between the set of all dual pseudo-complementations on an ADL and the set of all maximal elements of is obtained. Also proved that the set is a Boolean algebra.
Fuzzy Medial Filters of Pseudo Be-Algebras
2021
In this paper, the notion of fuzzy medial filters of a pseudo BE-algebra is defined, and some of the properties are investigated. We show that the set of all fuzzy medial filters of a pseudo BE-algebra is a complete lattice. Moreover, we state that in commutative pseudo BE-algebras fuzzy filters and fuzzy medial filters coincide. Finally, the notion of a fuzzy implicative filter is introduced and proved that every fuzzy implicative filter is a fuzzy medial filter, and we show that the converse is not valid in general.
Filters and ideals in pseudocomplemented posets
2022
We study ideals and filters of posets and of pseudocomplemented posets and show a version of the Separation Theorem, known for ideals and filters in lattices and semilattices, within this general setting. We extend the concept of a *-ideal already introduced by Rao for pseudocomplemented distributive lattices and by Talukder, Chakraborty and Begum for pseudocomplemented semilattices to pseudocomplemented posets. We derive several important properties of such ideals. Especially, we explain connections between prime filters, ultrafilters, filters satisfying the *-condition and dense elements. Finally, we prove a Separation Theorem for *-ideals.
Filters and congruences in sectionally pseudocomplemented lattices and posets
Soft Computing
Together with J. Paseka we introduced so-called sectionally pseudocomplemented lattices and posets and illuminated their role in algebraic constructions. We believe that—similar to relatively pseudocomplemented lattices—these structures can serve as an algebraic semantics of certain intuitionistic logics. The aim of the present paper is to define congruences and filters in these structures, derive mutual relationships between them and describe basic properties of congruences in strongly sectionally pseudocomplemented posets. For the description of filters in both sectionally pseudocomplemented lattices and posets, we use the tools introduced by A. Ursini, i.e., ideal terms and the closedness with respect to them. It seems to be of some interest that a similar machinery can be applied also for strongly sectionally pseudocomplemented posets in spite of the fact that the corresponding ideal terms are not everywhere defined.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.