Abstract:
A syntactic approach is described to constructing generic models which generalizes the known semantic one. A sufficient condition of a generic model being homogeneous is specified. It is shown that, within the syntactic approach, any countable homogeneous model is generic. Criteria and a sufficient condition are given for the generic models created in syntactic constructions to be saturated.
Citation:
S. V. Sudoplatov, “Syntactic approach to constructions of generic models”, Algebra Logika, 46:2 (2007), 244–268; Algebra and Logic, 46:2 (2007), 134–146
B. Sh. Kulpeshov, S. V. Sudoplatov, “Linearly Ordered Theories which are Nearly Countably Categorical”, Math. Notes, 101:3 (2017), 475–483
S. V. Sudoplatov, “Combinations related to classes of finite and countably categorical structures and their theories”, Sib. elektron. matem. izv., 14 (2017), 135–150
I. Kiouvrekis, P. Stefaneas, S. V. Sudoplatov, “Definable sets in generic structures and their cardinalities”, Siberian Adv. Math., 28:1 (2018), 39–52
S. V. Sudoplatov, “Generations of generative classes”, Izvestiya Irkutskogo gosudarstvennogo universiteta. Seriya Matematika, 22 (2017), 106–117
Sudoplatov S.V., Kiouvrekis Y., Stefaneas P., “Generic Constructions and Generic Limits”, Algebraic Modeling of Topological and Computational Structures and Applications, Springer Proceedings in Mathematics & Statistics, 219, eds. Lambropoulou S., Theodorou D., Stefaneas P., Kauffman L., Springer, 2017, 375–398
I. V. Shulepov, S. V. Sudoplatov, “Algebras of distributions for isolating formulas of a complete theory”, Sib. elektron. matem. izv., 11 (2014), 380–407
S. V. Sudoplatov, “On expansions and extensions of powerful digraphs”, Siberian Math. J., 50:3 (2009), 498–502
S. V. Sudoplatov, “Hypergraphs of prime models and distributions of countable models of small theories”, J. Math. Sci., 169:5 (2010), 680–695
S. V. Sudoplatov, “Small Stable Generic Graphs with Infinite Weight. Digraphs without Furcations”, Siberian Adv. Math., 18:2 (2008), 142–150
S. V. Sudoplatov, “Small Stable Generic Graphs with Infinite Weight. Bipartite Digraphs”, Siberian Adv. Math., 17:1 (2007), 37–48