English

Morley's theorem and Vaught's conjecture via Algebraic logic

Logic 2018-11-21 v2

Abstract

Vaught's Conjecture states that if TT is a complete first order theory in a countable language that has more than 0\aleph_0 pairwise non-isomorphic countably infinite models, then TT has 202^{\aleph_0} such models. Morley showed that if TT has more than 1\aleph_1 pairwise non-isomorphic countably infinite models, then it has 202^{\aleph_0} such models.\\ In this paper, we re-prove Morley's result and prove the corresponding statement for languages without equality, and for theories which are not necessarily complete. Our proof uses algebraic logic, namely the representation theory of cylindric and quasi-polyadic algebras. Also, as in Morley's proof, we use results from descriptive set theory. After all this, we show that our proof can be modified to talk about the number of models omitting a certain family of types. \end{abstract}

Keywords

Cite

@article{arxiv.1811.02472,
  title  = {Morley's theorem and Vaught's conjecture via Algebraic logic},
  author = {M. Assem and T. S. Ahmed and G. Sági and D. Sziráki},
  journal= {arXiv preprint arXiv:1811.02472},
  year   = {2018}
}

Comments

There is an error in the authors of the paper. G. Sagi and D. Szir\'aki are not co-authors

R2 v1 2026-06-23T05:06:36.326Z