Abstract
We show that each c-simple theory with an additional discreteness condition has an uncountable model Σ-definable in ℍ\( \mathbb{H} \)(\( \mathbb{L} \)), where \( \mathbb{L} \) is a dense linear order. From this we establish the same for all c-simple theories of finite signature that are submodel complete.
Similar content being viewed by others
References
Stukachev A. I., “Σ-Definability in hereditarily finite superstructures and pairs of models,” Algebra and Logic, 43, No. 4, 258–270 (2004).
Ershov Yu. L., Definability and Computability [in Russian], Nauchnaya Kniga, Novosibirsk (1996).
Stukachev A. I., “Degrees of presentability of structures. II,” Algebra and Logic, 47, No. 1, 65–74 (2008).
Ershov Yu. L., “Σ-Definability of algebraic structures,” in: Handbook of Recursive Mathematics. Vol. 1. Recursive Model Theory, Elsevier Sci. B. V., Amsterdam, 1998, pp. 235–260 (Stud. Logic Found. Math.; 138).
Kierstead H. A. and Remmel J. B., “Indiscernibles and decidable models,” J. Symbolic Logic, 48, No. 1, 21–32 (1983).
Hodges W., Model Theory, Cambridge Univ. Press, Cambridge (1993).
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to Yurĭ Leonidovich Ershov.
Original Russian Text Copyright © 2010 Stukachev A. I.
The author was supported by the Russian Foundation for Basic Research (Grants 06-01-04002-NNIOa, 08-01-00442a, and 09-01-12140-ofi_m), the State Maintenance Program for the Leading Scientific Schools of the Russian Federation (Grant NSh-335.2008.1), and the Lavrent’ev Young Scientists Competition of the Russian Academy of Sciences (Resolution No. 43 of 04.02.2010).
__________
Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 51, No. 3, pp. 649–661, May–June, 2010.
Rights and permissions
About this article
Cite this article
Stukachev, A.I. Σ-definability of uncountable models of c-simple theories. Sib Math J 51, 515–524 (2010). https://doi.org/10.1007/s11202-010-0054-z
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11202-010-0054-z