Advertisement

Siberian Mathematical Journal

, Volume 44, Issue 5, pp 883–890 | Cite as

Inessential Combinations and Colorings of Models

  • S. V. Sudoplatov
Article

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.

inessential combination of models inessential combination of theories colored model colored theory 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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).Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    Zaffe Yu., Palyutin E. A., and Starchenko S. S., “Models of superstable Horn theories,” Algebra i Logika, 24, No. 3, 278–326 (1985).Google Scholar
  4. 4.
    Sudoplatov S. V., “On a certain complexity estimate in graph theory,” Sibirsk. Mat. Zh., 37, No. 3, 700–703 (1996).Google Scholar

Copyright information

© Plenum Publishing Corporation 2003

Authors and Affiliations

  • S. V. Sudoplatov
    • 1
  1. 1.Novosibirsk State Technical UniversityUSSR

Personalised recommendations