2006•Journal of Shanxi Normal UniversityRequires access

Some Results on Semilattice

Zhu Yu-shan

Open publisher page 0 citations

Abstract

A semilattice can be defined as a universal algebra,and it can also be defined as a partial ordered set.In this paper,we proved that the definition of a semilattice as a universal algebra and the definition of a semilattice as a partial ordered set are equivalent.In order to describe the relationship between two kinds of definitions for a semilattice,we established two formulas.Moreover,we proved a necessary and sufficient condition showing the relationship between the isomorphisms of semilattices and the isomorphisms of the lattices of the ideals of the semilattices.

About this research paper

What this paper is about

A semilattice can be defined as a universal algebra,and it can also be defined as a partial ordered set.In this paper,we proved that the definition of a semilattice as a universal algebra and the definition of a semilattice as a partial ordered set are equivalent.In order to describe the relationship between two kinds of definitions for a semilattice,we established two formulas.Moreover,we proved a necessary and sufficient condition showing the relationship between the isomorphisms of semilattices and the isomorphisms of the lattices of the ideals of the semilattices.

Why it matters

A significance statement is not available in the OpenAlex record.

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

A semilattice can be defined as a universal algebra,and it can also be defined as a partial ordered set.In this paper,we proved that the definition of a semilattice as a universal algebra and the definition of a semilattice as a partial ordered set are equivalent.In order to describe the relationship between two kinds of definitions for a semilattice,we established two formulas.Moreover,we proved a necessary and sufficient condition showing the relationship between the isomorphisms of semilattices and the isomorphisms of the lattices of the ideals of the semilattices.

Key concepts: Semilattice, Mathematics, Set (abstract data type), Order (exchange), Pure mathematics, Algebra over a field, Discrete mathematics, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Some Results on Semilattice — Research Paper | ScholarLens