Partial orderings for sets of multisets (Q1821780)

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.