In the class of models of some theory in a countable first order language, we consider relationships between isomorphism, elementary embeddability, and elementary equivalence.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Yu. L. Ershov and E. A. Palyutin, Matematical Logic, Mir Publisher, Moscow (1984).
C. C. Chang and H. J. Keisler, Model Theory, North-Holland, Amsterdam etc. (1973).
G. E. Sacks, Saturated Model Theory, W. A. Benjamin, Reading, Mass. (1972).
S. Shelah, “Stability, the f.c.p., and superstability; model theoretic properties of formulas in first order theory,” Ann. Math. Logic 3, No. 3, 271—362 (1971).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Sibirskii Zhurnal Chistoi i Prikladnoi Matematiki 16, No. 4, 2016, pp. 13-16.
Rights and permissions
About this article
Cite this article
Bekenov, M.I. Properties of Elementary Embeddability in Model Theory. J Math Sci 230, 10–13 (2018). https://doi.org/10.1007/s10958-018-3721-4
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-018-3721-4