论文标题
在二元免费合并课程的大拉姆西学位上
On big Ramsey degrees for binary free amalgamation classes
论文作者
论文摘要
概括并简化了多布林蛋白的最新工作，我们表明，如果$ \ nathcal {l} $是一种有限的二进制关系语言，而$ \ Mathcal {f} $是有限的有限的不可理用$ \ MATHCAL {l} $，则是$ \ Mathcal $ \ Mathcal {k} = k {k} = \ mathrm {forb}（\ Mathcal {f}）$具有有限的大拉姆西学位。
Generalizing and simplifying recent work of Dobrinen, we show that if $\mathcal{L}$ is a finite binary relational language and $\mathcal{F}$ is a finite set of finite irreducible $\mathcal{L}$-structures, then the class $\mathcal{K} = \mathrm{Forb}(\mathcal{F})$ has finite big Ramsey degrees.
