Title
Completions of Pseudo Ordered Sets
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.
Year
DOI
Venue
2022
10.1007/s11083-021-09565-4
Order
Keywords
DocType
Volume
Pseudo order, Completion, MacNeille completion, Trellis
Journal
39
Issue
ISSN
Citations 
1
0167-8094
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Maria D. Cruz-Quinones100.34
John Harding200.34