Ordering subsets of (partially) ordered sets: representation theorems
From MaRDI portal
Recommendations
Cited in
(17)- More about plausibility orderings
- Realizing partial orderings by classes of co-simple sets
- On the representation of partially ordered sets
- Order types of free subsets
- Functors and dyadic sets of finite type
- Relating subsets of a poset, and a partition theorem for WQOs
- Parsimonious set representations of orders, a generalization of the interval order concept, and knowledge spaces.
- Ordering events: Intervals are sufficient, more general sets are usually not necessary
- A note on strongly Jónsson binary relational structures.
- Ordered sets with interval representation and (m,n)-Ferrers relation
- Tube representations of ordered sets
- Sub-representation of posets
- Orthoscalar representations of the partially ordered set (N,4).
- scientific article; zbMATH DE number 3929218 (Why is no real title available?)
- scientific article; zbMATH DE number 3977057 (Why is no real title available?)
- scientific article; zbMATH DE number 1301927 (Why is no real title available?)
- Partial Representations of Orderings
This page was built for publication: Ordering subsets of (partially) ordered sets: representation theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3577323)