In this paper we give characterizations of the super-stable theories, in terms of an external property called representation. In the sense of the representation property, the mentioned class of first-order theories can be regarded as "not very complicated".

In this paper we give characterizations of the stable and ℵ0‐stable theories, in terms of an external property called representation. In the sense of the representation property, the mentioned… Expand

— We give category-theoretic reformulations of stability, NIP, NTP, and non-dividing by observing that their characterisations in terms of indiscernible sequences are naturally expressed as Quillen… Expand

1. Sh:a Saharon Shelah. Classification theory and the number of nonisomorphic models, volume 92 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Co., Amsterdam-New… Expand

We prove that if $G=(V,E)$ is an $\omega$-stable (respectively, superstable) graph with $\chi(G)>\aleph_0$ (respectively, $2^{\aleph_0}$) then $G$ contains all the finite subgraphs of the shift graph… Expand

In this paper we give characterizations of the stable and ℵ0‐stable theories, in terms of an external property called representation. In the sense of the representation property, the mentioned… Expand