Learn More
We introduce the notion of the burden of a partial type in a complete first-order theory and call a theory strong if all types have almost finite burden. In a simple theory it is the supremum of the weights of all extensions of the type, and a simple theory is strong if and only if all types have finite weight. A theory without the independence property is(More)
We introduce the notion of a preindependence relation between subsets of the big model of a complete first-order theory, an abstraction of the properties which numerous concrete notions such as forking, dividing, thorn-forking, thorn-dividing, splitting or finite satisfiability share in all complete theories. We examine the relation between four additional(More)
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness notion from algorithmic graph theory is essentially the earlier stability theoretic notion of superflatness. For subgraph-closed classes of graphs we prove equivalence to stability(More)
A theory with the strict order property does not eliminate hyperimaginaries. Hence a theory without the independence property eliminates hyperimaginaries if and only if it is stable. A type definable equivalence relation is an equivalence relation on tuples of a certain length (possibly infinite) which is defined by a partial type E(¯ x; ¯ y) over ∅. A(More)
  • 1