Stationarily ordered types and the number of countable models

DOI10.1016/j.apal.2019.102765zbMath1475.03090arXiv1804.07231OpenAlexW2797996993WikidataQ126647755 ScholiaQ126647755MaRDI QIDQ2285849

Predrag Tanović, Slavko Moconja

Publication date: 9 January 2020

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

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

zbMATH Keywords

countable modelbinary theoryVaught's conjectureweak o-minimalityshuffling relation

Mathematics Subject Classification ID

Model theory of ordered structures; o-minimality (03C64) Quantifier elimination, model completeness, and related topics (03C10) Model theory of denumerable and separable structures (03C15)

Related Items (3)

Countable models of complete ordered theories ⋮ AROUND RUBIN’S “THEORIES OF LINEAR ORDER” ⋮ Does weak quasi-o-minimality behave better than weak o-minimality?

Cites Work

• Unnamed Item
• Vaught's conjecture for quite o-minimal theories
• Asymmetric regular types
• The complexity of isomorphism for complete theories of linear orders with unary predicates
• Witnessing dp-rank
• A proof of Vaught's conjecture for \(\omega\)-stable theories
• Theories of linear order
• Vaught's conjecture for weakly o-minimal theories of convexity rank 1
• On \(\aleph_0\)-categorical weakly o-minimal structures
• On dp-minimal ordered structures
• Generic stability, regularity, and quasiminimality
• Vaught's conjecture for o-minimal theories
• End extensions and numbers of countable models
• THE BOREL COMPLEXITY OF ISOMORPHISM FOR O-MINIMAL THEORIES
• AROUND RUBIN’S “THEORIES OF LINEAR ORDER”

This page was built for publication: Stationarily ordered types and the number of countable models