Hostname: page-component-77c89778f8-sh8wx Total loading time: 0 Render date: 2024-07-20T18:45:48.744Z Has data issue: false hasContentIssue false
  • English
  • Français

On Lattice Embeddings for Partially Ordered Sets

Published online by Cambridge University Press:  20 November 2018

Truman Botts
Truman Botts*
Affiliation:
University of Virginia
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let P be a set partially ordered by a (reflexive, antisymmetric, and transitive) binary relation ≺. Let be the family of all subsets K of P having the property that x ∈ P and y ∈ K and y ≺ x imply x ∈ K.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 6 , 1954 , pp. 525 - 528
Copyright
Copyright © Canadian Mathematical Society 1954

References

1. Birkhoff, Garrett, Lattice theory (Amer. Math. Soc. Colloquium Publications, XXV, 1948).Google Scholar
2. MacNeille, H. M., Partially ordered sets, Trans. Amer. Math. Soc, 42 (1937), 416–460.Google Scholar
3. Tukey, John W., Convergence and uniformity in topology (Princeton, 1940).Google Scholar
4. Vaidyanathaswamy, R., Treatise on set topology, Indian Math. Soc. (1947).Google Scholar
5. Wada, J., Lattices of spaces, Osaka Math. J., 5 (1953), 1–12.Google Scholar