Vaught's conjecture for monomorphic theories

DOI10.1016/J.APAL.2019.04.012zbMATH Open1459.03039arXiv1811.07210OpenAlexW2964148289WikidataQ123226251 ScholiaQ123226251MaRDI QIDQ2417963FDOQ2417963

Miloš S. Kurilić

Publication date: 31 May 2019

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

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 $mathcalT$ 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 $mathcalT$ is a complete monomorphic theory having infinite models, then the number of its non-isomorphic countable models, $I(mathcalT,omega)$, is either equal to $1$ or to $mathfrakc$. In addition, $I(mathcalT,omega)=1$ iff some countable model of $mathcalT$ is simply definable by an $omega$-categorical linear order on its domain.

Full work available at URL: https://arxiv.org/abs/1811.07210

zbMATH Keywords

Vaught's conjecturemonomorphic structuremonomorphic theory

Mathematics Subject Classification ID

Models with special properties (saturated, rigid, etc.) (03C50) Categoricity and completeness of theories (03C35) Total orders (06A05) Model theory of denumerable and separable structures (03C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theory of relations. Transl. from the French by P. Clote
• Definable Sets in Ordered Structures. I
• Vaught's conjecture for o-minimal theories
• A proof of Vaught's conjecture for \(\omega\)-stable theories
• Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
• The number of countable models
• Theories of linear order
• End extensions and numbers of countable models
• Application de la Notion de Relation Presque‐Enchainable au Denombrement des Restrictions Finies D'une Relation
• Possible Orderings of an Indiscernible Sequence
• Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes
• Relational structures having finitely many full-cardinality restrictions

Cited In (5)

• Vaught’s conjecture for weakly -minimal theories of finite convexity rank
• Vaught's conjecture for theories admitting finite monomorphic decompositions
• Computable Følner monotilings and a theorem of Brudno
• VAUGHT’S CONJECTURE FOR ALMOST CHAINABLE THEORIES
• Sharp Vaught's conjecture for some classes of partial orders

This page was built for publication: Vaught's conjecture for monomorphic theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2417963)