The equational theory of pomsets
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
The age of a relational structure
Discrete Mathematics
Series-Parallel Posets: Algebra, Automata and Languages
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Hi-index | 0.05 |
It is well known that the collection N of finite series-parallel posets is well-quasiordered under embeddability. Here, we show that the ordinal length of N, that is the maximum of the order types of its linear extensions, is the Feferman ordinal Γ0 (J. Symbolic Logic 33 (1968) 193). Finite series-parallel posets form an age in Fraïssé's sense; we deduce that the height of N in the collection of its subages is also equal to Γ0.