Skip to main content
SpringerLink
Log in

Complete theories with finitely many countable models. II

  • Published:
Algebra and Logic Aims and scope

Abstract

Previously, we obtained a syntactic characterization for the class of complete theories with finitely many pairwise non-isomorphic countable models [1]. The most essential part of that characterization extends to Ehrenfeucht theories (i.e., those having finitely many (but more than 1) pairwise non-isomorphic countable models). As the basic parameters defining a finite number of countable models, Rudin-Keisler quasiorders are treated as well as distribution functions defining the number of limit models for equivalence classes w.r.t. these quasiorders. Here, we argue to state that all possible parameters given in the characterization theorem in [1] are realizable. Also, we describe Rudin-Keisler quasiorders in arbitrary small theories. The construction of models of Ehrenfeucht theories with which we come up in the paper is based on using powerful digraphs which, along with powerful types in Ehrenfeucht theories, always locally exist in saturated models of these theories.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. V. Sudoplatov, “Complete theories with finitely many countable models. I,” Algebra Logika, 43, No. 1, 110–124 (2004).

    MathSciNet  Google Scholar 

  2. S. S. Goncharov and Yu. L. Ershov, Constructive Models, Sib. School Alg. Log. [in Russian], Nauch. Kniga, Novosibirsk (1996).

    Google Scholar 

  3. S. V. Sudoplatov, “Powerful digraphs,” to appear in Sib. Mat. Zh.

  4. Handbook of Mathematical Logic, Vol. 1, Model Theory, J. Barwise (ed.) [in Russian], Nauka, Moscow (1982).

    Google Scholar 

  5. S. Shelah, Classification Theory and the Number of Non-Isomorphic Models, 2nd ed., Stud. Log. Found. Math., Vol. 92, North-Holland, Amsterdam (1990).

    Google Scholar 

  6. F. O. Wagner, Simple Theories, Math. Appl., (Dordrecht), Vol. 503, Kluwer, Dordrecht (2000).

    Google Scholar 

  7. V. A. Emelichev, et al., Lectures on Graph Theory [in Russian], Nauka, Moscow (1990).

    Google Scholar 

  8. J. T. Baldwin and N. Shi, “Stable generic structures,” Ann. Pure App. Log,, 79, 1–35 (1996).

    Article  MathSciNet  Google Scholar 

  9. S. V. Sudoplatov, “Type reduction and powerful types,” Sib. Mat. Zh., 33, No. 1, 150–159 (1992).

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia

    S. V. Sudoplatov

Authors
  1. S. V. Sudoplatov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by RFBR grant Nos. 02-01-00258 and 05-01-00411.

__________

Translated from Algebra i Logika, Vol. 45, No. 3, pp. 314–353, May–June, 2006.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sudoplatov, S.V. Complete theories with finitely many countable models. II. Algebr Logic 45, 180–200 (2006). https://doi.org/10.1007/s10469-006-0016-5

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10469-006-0016-5

Keywords

Search

Navigation