Abstract
We define the operations of an inessential combination and an almost inessential combination of models and theories. We establish basedness for an (almost) inessential combination of theories. We also establish that the properties of smallness and λ-stability are preserved upon passing to (almost) inessential combinations of theories. We define the notions of coloring of a model, colored model, and colored theory, and transfer the assertions about combinations to the case of colorings. We characterize the inessential colorings of a polygonometry.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barwise J., Ershov Yu. L., Palyutin E. A., Ta \(\overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\smile}$}}{\imath } \) manov A. D. (eds) Handbook of Mathematical Logic. Vol. 1: Model Theory [Russian translation], Nauka, Moscow (1982).
Sudoplatov S. V., “Group polygonometries and related algebraic systems,” in: Contributions to General Algebra 11: Proc. of the Olomouc Workshop '98 on General Algebra, Verl. Johannes Heyn, Klagenfurt, 1999, pp. 191–210.
Zaffe Yu., Palyutin E. A., and Starchenko S. S., “Models of superstable Horn theories,” Algebra i Logika, 24, No. 3, 278–326 (1985).
Sudoplatov S. V., “On a certain complexity estimate in graph theory,” Sibirsk. Mat. Zh., 37, No. 3, 700–703 (1996).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sudoplatov, S.V. Inessential Combinations and Colorings of Models. Siberian Mathematical Journal 44, 883–890 (2003). https://doi.org/10.1023/A:1025901223496
Issue Date:
DOI: https://doi.org/10.1023/A:1025901223496