Some Results on Semilattice
Zhu Yu-shan
Abstract
Zhu Yu-shan
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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