On big Ramsey degrees for binary free amalgamation classes
Logic
2022-07-12 v3 Combinatorics
Abstract
Generalizing and simplifying recent work of Dobrinen, we show that if is a finite binary relational language and is a finite set of finite irreducible -structures, then the class has finite big Ramsey degrees.
Keywords
Cite
@article{arxiv.2004.13162,
title = {On big Ramsey degrees for binary free amalgamation classes},
author = {Andy Zucker},
journal= {arXiv preprint arXiv:2004.13162},
year = {2022}
}
Comments
Formerly titled "A note on big Ramsey degrees." Accepted version