Papers
Topics
Authors
Recent
2000 character limit reached

Vaught's Conjecture for Monomorphic Theories

Published 17 Nov 2018 in math.LO | (1811.07210v2)

Abstract: A complete first order theory of a relational signature is called monomorphic iff all its models are monomorphic (i.e. have all the $n$-element substructures isomorphic, for each positive integer $n$). We show that a complete theory ${\mathcal T}$ having infinite models is monomorphic iff it has a countable monomorphic model and confirm the Vaught conjecture for monomorphic theories. More precisely, we prove that if ${\mathcal T}$ is a complete monomorphic theory having infinite models, then the number of its non-isomorphic countable models, $I({\mathcal T},\omega )$, is either equal to $1$ or to ${\mathfrak c}$. In addition, $I({\mathcal T},\omega)= 1$ iff some countable model of ${\mathcal T}$ is simply definable by an $\omega$-categorical linear order on its domain.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.