On Lattice Embeddings for Partially Ordered Sets

Truman Botts · Canadian Journal of Mathematics · 1954

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.

Read the paper · More papers on PaperTik