Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T02:44:24.449Z Has data issue: false hasContentIssue false

On Lattice Embeddings for Partially Ordered Sets

Published online by Cambridge University Press:  20 November 2018

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1954