Pseudo - Complementation on Almost Lattices

Ashagrew Worku Tadesse

dc.contributor.author	Ashagrew Worku Tadesse
dc.date.accessioned	2021-10-08T11:32:10Z
dc.date.available	2021-10-08T11:32:10Z
dc.date.issued	2021-10-08
dc.identifier.uri	http://ir.bdu.edu.et/handle/123456789/12705
dc.description.abstract	In this paper we discussed the concept of pseudo – complementation * on an almost lattices with 0 is discussed and proved some basic properties of pseudo-complementation. Also prove that pseudo- complementationon an AL L is equationally definable. A one to one correspondence between the set of pseudo – complementation on an AL L with 0 and the set of all maximal elements of L is verified. It is also, proved that L* = {a: a L} is a Boolean algebra which is independent (up to isomorphism) of the pseudo complementation on L. Key words: almost lattice, pseudo – complementation ,equationally definable class, Boolean algebra and maximal elements	en_US
dc.language.iso	en_US	en_US
dc.subject	Mathematics	en_US
dc.title	Pseudo - Complementation on Almost Lattices	en_US
dc.type	Thesis	en_US