Scattered sentences have few separable randomizations

DOI10.1007/s00153-020-00718-7zbMath1481.03013arXiv1704.04981OpenAlexW3003250513MaRDI QIDQ781518

Isaac Goldbring, David Marker, Uri Andrews, H. Jerome Keisler, Sherwood Hachtman

Publication date: 17 July 2020

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

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

zbMATH Keywords

Vaught's conjecturerandomizationsscattered sentences

Mathematics Subject Classification ID

Nonclassical models (Boolean-valued, sheaf, etc.) (03C90) Models of other mathematical theories (03C65) Model theory of denumerable and separable structures (03C15)

Cites Work

• Saturation and elementary equivalence of \(C^\ast\)-algebras
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• Three red herrings around Vaught’s conjecture
• SEPARABLE MODELS OF RANDOMIZATIONS
• Set Theory
• The number of countable models
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scattered sentences have few separable randomizations