Skip to main content
SpringerLink
Log in

Countable Models of Complete Ordered Theories

  • MATHEMATICS
  • Published:
Doklady Mathematics Aims and scope Submit manuscript

Abstract

The article consists of observations regarding complete theories of countable signatures and their countable models. We provide a construction of a countable linearly ordered theory that has the same number of countable non-isomorphic models as the given countable, not necessarily linearly ordered, theory.

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. M. Morley, “The number of countable models,” J. Symb. Logic 35 (1), 14–18 (1970).

    Article  ADS  MathSciNet  Google Scholar 

  2. M. Rubin, “Theories of linear order,” Isr. J. Math. 17, 392–443 (1974).

    Article  MathSciNet  Google Scholar 

  3. L. Mayer, “Vaught’s conjecture for o-minimal theories,” J. Symb. Logic 53 (1), 146–159 (1988).

    Article  MathSciNet  Google Scholar 

  4. A. Alibek and B. S. Baizhanov, “Examples of countable models of a weakly o-minimal theory,” Int. J. Math. Phys. 3 (2), 1–8 (2012).

    Google Scholar 

  5. B. Sh. Kulpeshov and S. V. Sudoplatov, “Vaught’s conjecture for quite o-minimal theories,” Ann. Pure Appl. Logic 168 (1), 129–149 (2017).

    Article  MathSciNet  Google Scholar 

  6. A. Alibek, B. S. Baizhanov, B. Sh. Kulpeshov, and T. S. Zambarnaya, “Vaught’s conjecture for weakly o-minimal theories of convexity rank 1,” Ann. Pure Appl. Logic 169 (11), 1190–1209 (2018).

    Article  MathSciNet  Google Scholar 

  7. S. Moconja and P. Tanovic, “Stationarily ordered types and the number of countable models,” Ann. Pure Appl. Logic 171 (3), 102765 (2019).

  8. B. Sh. Kulpeshov, “Vaught’s conjecture for weakly o-minimal theories of finite convexity rank,” Izv. Math. 84 (2), 324–347 (2020).

    Article  MathSciNet  Google Scholar 

  9. N. K. Vereshchagin and A. Shen’, Lectures on Mathematical Logic and Theory of Algorithms, Part 2: Languages and Calculi (MTsNMO, Moscow, 2002) [in Russian].

Download references

Funding

This research is funded by the Science Committee of the Ministry of Science and Higher Education of the Republic of Kazakhstan (Grant no. AP09058169).

Author information

Authors and Affiliations

  1. Institute of Mathematics and Mathematical Modeling, Almaty, Kazakhstan

    T. S. Zambarnaya & B. S. Baizhanov

  2. Suleyman Demirel University, Kaskelen, Kazakhstan

    B. S. Baizhanov

Authors
  1. T. S. Zambarnaya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. S. Baizhanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to T. S. Zambarnaya.

Ethics declarations

The authors of this work declare that they have no conflicts of interest.

Additional information

Publisher’s Note.

Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zambarnaya, T.S., Baizhanov, B.S. Countable Models of Complete Ordered Theories. Dokl. Math. 108, 343–345 (2023). https://doi.org/10.1134/S106456242360077X

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S106456242360077X

Keywords:

Search

Navigation