Coloring linear orders with Rado's partial order

DOI10.1002/MALQ.200710002zbMATH1121.03057OpenAlexW2081516714MaRDI QIDQ5293200FDOQ5293200

Authors Riccardo Camerlo, Alberto Marcone

Publication date 26 June 2007

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.200710002

zbMATH Keywords

Borel reducibilitycolored linear ordersRado's partial order

Mathematics Subject Classification ID

Descriptive set theory (03E15) Total orders (06A05)

Recommendations

• Classification of finite coloured linear orderings
• On optimal representatives of finite coloured linear orders
• On the Complexity of Ordered Colorings
• A cofinal coloring theorem for partially ordered algebras
• A Ramsey theorem for partial orders with linear extensions
• Countable homogeneous coloured partial orders
• Orderings, Multicoloring, and Consistently Ordered Matrices
• Countably categorical coloured linear orders
• Uniform orderings for generalized coloring numbers
• On a problem concerning ordered colourings

Cited in

(5)

• Embeddability on functions: Order and chaos
• Universality of embeddability relations for coloured total orders
• Coloring Ordered Sets to Avoid Monochromatic Maximal Chains
• Two results on borel orders
• On isometry and isometric embeddability between ultrametric Polish spaces

This page was built for publication: Coloring linear orders with Rado's partial order

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