Partial orderings for sets of multisets
From MaRDI portal
It is shown that if \((S,<)\), a poset, does not contain an infinite descending chain, then neither do some naturally defined posets on the set of finite sub-multisets, i.e. functions f:T\(\to N\), where T is a finite subset of S, N is the set of natural numbers. The author identifies the cases of the axiom of choice used in the proofs.
Recommendations
Cites work
Cited in
(13)- Extension functions for multiset orderings
- Realizing partial orderings by classes of co-simple sets
- General relations between partially ordered multisets and their chains and antichains
- A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets
- scientific article; zbMATH DE number 3977057 (Why is no real title available?)
- scientific article; zbMATH DE number 3986676 (Why is no real title available?)
- Non-well-foundedness of well-orderable power sets
- scientific article; zbMATH DE number 218835 (Why is no real title available?)
- Partial multipliers on partially ordered sets
- Partial Representations of Orderings
- On multiset ordering
- ON MULTIPLIERS OF PARTIALLY ORDERED SETS
- Number theory of matrix semigroups
This page was built for publication: Partial orderings for sets of multisets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1821780)