Ordinal measures of the set of finite multisets

Abstract

Well-partial orders, and the ordinal invariants used to measure them, are relevant in set theory, program verification, proof theory and many other areas of computer science and mathematics. In this article we focus on one of the most common data structure in programming, the finite multiset of some wpo. There are two natural orders one can define on the set of finite multisets $M(X)$ of a partial order $X$: the multiset embedding and the multiset ordering, for which $M(X)$ remains a wpo when $X$ is. Though the maximal order type of these orders is already known, the other ordinal invariants remain mostly unknown. Our main contributions are expressions to compute compositionally the width of the multiset embedding and the height of the multiset ordering. Furthermore, we provide a new ordinal invariant useful for characterizing the width of the multiset ordering.