On the cartesian product of well-orderings
Logic in Computer Science
2024-05-21 v1 Combinatorics
Logic
Abstract
The width of a well partial ordering (wpo) is the ordinal rank of the set of its antichains ordered by inclusion. We compute the width of wpos obtained as cartesian products of finitely many well-orderings.
Cite
@article{arxiv.2202.07487,
title = {On the cartesian product of well-orderings},
author = {Isa Vialard},
journal= {arXiv preprint arXiv:2202.07487},
year = {2024}
}