Abstract

We build a collection of topological Ramsey spaces of trees giving rise to universal inverse limit structures, extending Zheng’s work for the profinite graph to the setting of Fraïssé classes of finite ordered binary relational structures with the Ramsey property. This work is based on the Halpern-Läuchli theorem, but different from the Milliken space of strong subtrees. Based on these topological Ramsey spaces and the work of Huber-Geschke-Kojman on inverse limits of finite ordered graphs, we prove that for each such Fraïssé class, its universal inverse limit structure has finite big Ramsey degrees under finite Baire-measurable colorings. For such Fraïssé classes satisfying free amalgamation as well as finite ordered tournaments and finite partial orders with a linear extension, we characterize the exact big Ramsey degrees.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call