Binary simple homogeneous structures are supersimple with finite rank
Koponen, Vera
Original · EN
Suppose that M is an infinite structure with finite relational vocabulary such that every relation symbol has arity at most 2. If M is simple and homogeneous then its complete theory is supersimple with finite SU-rank which cannot exceed the number of complete 2-types over the empty set.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.