Abstract
It is well known [1] 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 isomorphic 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
Abian, A.,On definitions of cuts and completions of partially ordered sets. Zeitshrift fur Math. Logik und Grundlagen der Math.114 (1968), 299–302.
Balbes, R. andDwinger, P.,Distributive Lattices. University of Missouri Press, 1974.
Gierz, G. et al.,A Compendium of Continuous Lattices. Springer-Verlag, New York, 1980.
Schien B. M.,On the definition of distributive semi lattices. Algebra Universalis, pp 1–2, 1972.
Niederle, Josef,On completely meet-irreducible elements in compactly generated, lattices. Czechoslovak Mathematical Journal39(114) 1989.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kemp, P. Representation of partially ordered sets. Algebra Universalis 30, 348–351 (1993). https://doi.org/10.1007/BF01190444
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01190444
1980 Mathematics Subject Classification
- Primary O6A10