Superstable theories and representation
Logic
2019-04-18 v2
Abstract
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". This was done for "stable" and for "aleph_0-stable". Here we give a complete answer for "superstable".
Cite
@article{arxiv.1412.0421,
title = {Superstable theories and representation},
author = {Saharon Shelah},
journal= {arXiv preprint arXiv:1412.0421},
year = {2019}
}