ScholarLens Back to search
2012•Unpublished venueRequires access

• DUAL PSUEDO-COMPLEMENTED ALMOST DISTRIBUTIVE LATTICES

G. C. Rao, Naveen Kumar Kakumanu

Open publisher page 2 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Distributive lattice, Distributive property, Congruence lattice problem, Dual (grammatical number), Lattice (music), Mathematics, Complete lattice, Boolean algebra

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
• DUAL PSUEDO-COMPLEMENTED ALMOST DISTRIBUTIVE LATTICES — Research Paper | ScholarLens