LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Completions of Pseudo Ordered Sets

Photo from wikipedia

A pseudo ordered set (X,≤) is a set X with a binary relation ≤ that is reflexive and antisymmetric. We associate to a pseudo ordered set X, a partially ordered… Click to show full abstract

A pseudo ordered set (X,≤) is a set X with a binary relation ≤ that is reflexive and antisymmetric. We associate to a pseudo ordered set X, a partially ordered set Γ(X) called the covering poset. Taking any completion (C,f) of the covering poset Γ(X), and a special equivalence relation 𝜃 on this completion, yields a completion C/𝜃 of the pseudo ordered set X. The case when (C,f) is the MacNeille completion of Γ(X) gives the pseudo MacNeille completion of X.

Keywords: completions pseudo; ordered sets; completion; pseudo ordered; ordered set

Journal Title: Order
Year Published: 2021

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.