Binary simple homogeneous structures are supersimple with finite rank
classification
🧮 math.LO
keywords
finitecompletehomogeneoussimplesupersimplearitybinarycannot
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.