Abstract
Hypergraphs of prime models over realizations of types in small theories are defined. On the basis of graph structures of models of small theories, hierarchies of sets in these hypergraphs, revealing structural connections in countable models of small theories, are established. The key role of graph-theoretic objects in constructions of Ehrenfeucht theories is proved. Using hypergraph constructions, a classification of complete first-order theories with finite Rudin–Keisler preorders is generalized to the class of all small theories.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. T. Baldwin and A. H. Lachlan, “On strongly minimal sets,” J. Symb. Logic, 36, No. 1, 79–96 (1971).
J. Barwise, ed., Handbook of Mathematical Logic [Russian translation], Vol. 1, Nauka, Moscow (1982).
B. Herwig, “Weight ω in stable theories with few types,” J. Symb. Logic, 60, No. 2, 353–373 (1995).
B. Kim, “On the number of countable models of a countable supersimple theory,” J. London Math. Soc., 60, No. 2, 641–645 (1999).
A. H. Lachlan, “On the number of countable models of a countable superstable theory,” in: Proc. Int. Cong. Logic, Methodology and Philosophy of Science, North-Holland, Amsterdam (1973), pp. 45–56.
M. Morley, “The number of countable models,” J. Symb. Logic, 35, 14–18 (1970).
M. G. Peretyat’kin, “On complete theories with a finite number of denumerable models,” Algebra Logic, 12, No. 5, 310–326 (1973).
M. G. Peretyat’kin, “Theories with three countable models,” Algebra Logic, 19, No. 2, 139–147 (1980).
A. Pillay, “Stable theories, pseudoplanes and the number of countable models,” Ann. Pure Appl. Logic, 43, No. 2, 147–160 (1989).
S. Shelah, Classification Theory and the Number of Non-isomorphic Models, Stud. Logic Foundations Math., Vol. 92, North-Holland, Amsterdam (1990).
S. V. Sudoplatov, “On acyclic hypergraphs of minimal prime models,” Sib. Math. J., 42, No. 6, 1408–1412 (2001).
S. V. Sudoplatov, “Complete theories with finitely many countable models. I,” Algebra Logic, 43, No. 1, 62–69 (2004).
S. V. Sudoplatov, “Complete theories with finitely many countable models. II,” Algebra Logic, 45, No. 3, 180–200 (2006).
S. V. Sudoplatov, “On the number of countable models of complete theories with finite Rudin–Keisler preorders,” Sib. Math. J., 48, No. 2, 334–338 (2007).
S. V. Sudoplatov, “Powerful digraphs,” Sib. Math. J., 48, No. 1, 165–171 (2007).
S. V. Sudoplatov, “Syntactic approach to constructions of generic models,” Algebra Logic, 46, No. 2, 244–268 (2007).
S. V. Sudoplatov and E. V. Ovchinnikova, Discrete Mathematics: Manual [in Russian], INFRA-M, Moscow; NSTU, Novosibirsk (2009).
P. Tanović, “On constants and the strict order property,” Arch. Math. Logic, 45, No. 4, 423–430 (2006).
P. Tanović, “Theories with constants and three countable models,” Arch. Math. Logic, 46, No. 5–6, 517–527 (2007).
A. Tsuboi, “Countable models and unions of theories,” J. Math. Soc. Jpn., 38, No. 3, 501–508 (1986).
R. Vaught, “Denumerable models of complete theories,” in: Infinistic Methods, Pergamon, London (1961), pp. 303–321.
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to the memory of Professor Yury Evgen’evich Shishmaryov
Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 15, No. 7, pp. 179–203, 2009.
Rights and permissions
About this article
Cite this article
Sudoplatov, S.V. Hypergraphs of prime models and distributions of countable models of small theories. J Math Sci 169, 680–695 (2010). https://doi.org/10.1007/s10958-010-0069-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-010-0069-9