• Corpus ID: 119115813

Superstable theories and representation

@article{Shelah2014SuperstableTA,
  title={Superstable theories and representation},
  author={Saharon Shelah},
  journal={arXiv: Logic},
  year={2014}
}
  • S. Shelah
  • Published 1 December 2014
  • Mathematics
  • arXiv: Logic
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". 
4 Citations
Stable theories and representation over sets
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
Remarks on Shelah's classification theory and Quillen's negation
— 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
LIST OF PUBLICATIONS
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
Infinite Stable Graphs With Large Chromatic Number
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

References

SHOWING 1-2 OF 2 REFERENCES
Stable theories and representation over sets
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