Abstract
We prove that a countable, complete, first-order theory with infinite dcl(\( \theta \)) and precisely three non-isomorphic countable models interprets a variant of Ehrenfeucht’s or Peretyatkin’s example.
Similar content being viewed by others
References
Ikeda K., Pillay A. and Tsuboi A. (1998). On theories having three countable models. Math. Log. Quart. 44: 161–166
Newelski L. (1994). Meager forking. Ann. Pure Appl. Log. 70: 141–175
Peretyatkin M.G. (1973). On complete theories with a finite number of countable models (in Russian). Algebra Log. 12: 550–576
Peretyatkin M.G. (1980). On theories with three countable models (in Russian). Algebra Log. 19: 224–235
Pillay A. (1980). Theories with exactly three countable models and theories with algebraic prime models. J. Symbolic Log. 45: 302–310
Pillay A. (1983). Countable models of stable theories. Proc. Am. Math. Soc. 89: 666–672
Tanović, P.: Fundamental Order and the Number of Countable Models. PhD Thesis, McGill University (1993)
Tanović P. (2001). On the number of countable models of stable theories. Fund. Math. 169: 139–144
Tanović P. (2006). On constants and the strict order property. Arch. Math. Log. 45: 423–430
Vaught, R.L.: Denumerable models of complete theories. In: Infinitistic Methods. Proceedings of the Symposium on Foundations of Mathematics. Panstwowe Wydawnictvo Naukowe, pp. 303–321 (1961)
Woodrow R.E. (1978). Theories with a finite number of countable models. J. Symbolic Log. 43: 442–455
Woodrow R.E. (1976). A note on countable complete theories having three isomorphism types of countable models. J. Symbolic Log. 41: 672–680
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Tanović, P. Theories with constants and three countable models. Arch. Math. Logic 46, 517–527 (2007). https://doi.org/10.1007/s00153-007-0054-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-007-0054-2