A Decomposition Theorem for Aronszajn Lines

DOI10.1142/S0219061322500179MaRDI QIDQ6337487arXivFDO

Authors Keegan Dasilva Barbosa

Publication date 26 March 2020

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Ramsey theory (05D10) Total orders (06A05)

Abstract: We show that under the proper forcing axiom the class of all Aronszajn lines behave like $sigma$-scattered orders under the embeddability relation. In particular, we are able to show that the class of better quasi order labeled fragmented Aronszajn lines is itself a better quasi order. Moreover, we show that every better quasi order labeled Aronszajn line can be expressed as a finite sum of labeled types which are algebraically indecomposable. By encoding lines with finite labeled trees, we are also able to deduce a decomposition result, that for every Aronszajn line $L$ there is integer n such that for any finite colouring of $L$ there is subset $L^{p}rime$ of $L$ isomorphic to $L$ which uses no more than n colours.

This page was built for publication: A Decomposition Theorem for Aronszajn Lines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6337487)