Abstract
A complete description of (p, 1)-stable theories is furnished in terms of definable interpretability in a theory for the language of unary predicates.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Shelah, “Stable theories,” Isr. J. Math., 7, No. 3, 187–202 (1969).
M. D. Morley, “Categoricity in power,” Trans. Am. Math. Soc., 114, No. 2, 514–538 (1965).
S. Shelah, Classification Theory and the Number of Non-Isomorphic Models, Stud. Log. Found. Math., 92, North-Holland, Amsterdam (1978).
E. A. Palyutin “E-stable theories,” Algebra Logika, 42, No. 2, 194–210 (2003).
T. Nurmagambetov and B. Poizat, “The number of elementary pairs over sets,” Proc. French-Kazakhstan Coll. Model Theory, Alma-Ata (1995), pp. 73–82.
Author information
Authors and Affiliations
Additional information
Supported by RFBR grant No. 05-01-00411.
__________
Translated from Algebra i Logika, Vol. 46, No. 3, pp. 346–359, May–June, 2007.
Rights and permissions
About this article
Cite this article
Rusaleev, M.A. Characterization of (p, 1)-stable theories. Algebr Logic 46, 188–194 (2007). https://doi.org/10.1007/s10469-007-0017-z
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10469-007-0017-z