Standard Completions for Pseudo Ordered Sets
摘要
The concept of pseudo ordered sets is a generalization of posets by removing the requirement of transitivity. The lack of transitivity in pseudo ordered sets prevents the direct application of standard completions for posets. This paper presents a unified framework for constructing completions of pseudo ordered sets. Our approach involves directly selecting families of subsets, which generalizes renowned standard completions for posets. We introduce suitable morphisms on pseudo ordered sets and characterize our completion construction by means of a universal property. This characterization establishes reflective relationships between categories of pseudo ordered sets and the category of complete trellises.