Length of an intersection
Logic
2015-10-05 v1 Combinatorics
Abstract
A poset is well-partially ordered (WPO) if all its linear extensions are well orders~; the supremum of ordered types of these linear extensions is the {\em length}, of . We prove that if the vertex set of is infinite, of cardinality , and the ordering is the intersection of finitely many partial orderings on , , then, letting , with , denote the euclidian division by (seen as an initial ordinal) of the length of the corresponding poset~: where denotes the least initial ordinal greater than the ordinal . This inequality is optimal (for ).
Cite
@article{arxiv.1510.00596,
title = {Length of an intersection},
author = {Christian Delhommé and Maurice Pouzet},
journal= {arXiv preprint arXiv:1510.00596},
year = {2015}
}
Comments
13 pages