Binary simple homogeneous structures are supersimple with finite rank
Logic
2015-04-08 v2
Abstract
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.
Cite
@article{arxiv.1406.7615,
title = {Binary simple homogeneous structures are supersimple with finite rank},
author = {Vera Koponen},
journal= {arXiv preprint arXiv:1406.7615},
year = {2015}
}