Skip to main content

On the representation of partially ordered sets

Abstract

It is well known that any distributive poset (short for partially ordered set) has an isomorphic representation as a poset (Q, ⊆) such that the supremum and the infimum of any finite setF ofP correspond, respectively to the union and intersection of the images of the elements ofF. Here necessary and sufficient conditions are given for similar isomophic representation of a poset where however the supremum and infimum of also infinite subsetsI correspond to the union and intersection of images of elements ofI.

This is a preview of subscription content, access via your institution.

References

  1. Abian A.,On definitions of cuts and completions of partially ordered sets. Zeitschrift fur Math. Logik und Grundlagen der Math.,114 (1968), 299–302.

    Article  MathSciNet  Google Scholar 

  2. Balbes R., Dwinger P.,Distributive Lattices, 1974, Univ. of Mo. Press.

  3. Birkhoff G., Frink O.,Representations of lattices by sets, Trans. AMS64 (1948), 299–316.

    Article  MATH  MathSciNet  Google Scholar 

  4. Schein B.M.,On the definition of distributive semi lattices, Algebra Universalis2, (1972), 1–2.

    Article  MATH  MathSciNet  Google Scholar 

  5. Niederle, Josef,On completely meet irreducible elements in compactly generated lattices, Czechoslovak Mathematical Journal39 (1989), 113–114.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Kemp, P.A. On the representation of partially ordered sets. Rend. Circ. Mat. Palermo 46, 119–122 (1997). https://doi.org/10.1007/BF02844476

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02844476

1980 Mathematics Subject Classification

  • Primary 06A10