pith. sign in

arxiv: 1707.05954 · v2 · pith:3EXQHJXYnew · submitted 2017-07-19 · 🧮 math.LO

On constraints and dividing in ternary homogeneous structures

classification 🧮 math.LO
keywords constraintshomogeneousnaturesu-ranksupersimpleternaryconstraineddefinable
0
0 comments X
read the original abstract

Let M be ternary, homogeneous and simple. We prove that if M is finitely constrained, then it is supersimple with finite SU-rank and dependence is $k$-trivial for some $k < \omega$ and for finite sets of real elements. Now suppose that, in addition, M is supersimple with SU-rank 1. If M is finitely constrained then algebraic closure in M is trivial. We also find connections between the nature of the constraints of M, the nature of the amalgamations allowed by the age of M, and the nature of definable equivalence relations. A key method of proof is to "extract" constraints (of M) from instances of dividing and from definable equivalence relations. Finally, we give new examples, including an uncountable family, of ternary homogeneous supersimple structures of SU-rank 1.

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.