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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.