
TL;DR
This paper develops axioms for Scott processes of relational structures, providing new proofs and results related to Vaught's Conjecture, including the existence of models with various Scott ranks in counterexamples.
Contribution
It introduces axioms for Scott processes and uses them to prove the existence of models with cofinal Scott ranks below _2 in counterexamples to Vaught's Conjecture.
Findings
Counterexamples to Vaught's Conjecture have models of cofinally many Scott ranks below _2
Existence of models with Scott rank _1 in counterexamples
Counterexamples can have models of Scott rank _1 for every limit ordinal above certain depth
Abstract
The Scott process of a relational structure is the sequence of sets of formulas given by the Scott analysis of . We present axioms for the class of Scott processes of structures in a relational vocabulary , and use them to give a proof of an unpublished theorem of Leo Harrington from the 1970's, showing that a counterexample to Vaught's Conjecture has models of cofinally many Scott ranks below . Our approach also gives a theorem of Harnik and Makkai, showing that if there exists a counterexample to Vaught's Conjecture, then there is a counterexample whose uncountable models have the same -theory, and which has a model of Scott rank . Moreover, we show that if is a sentence of giving rise to a counterexample to Vaught's Conjecture, then for every limit ordinal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Constraint Satisfaction and Optimization · Rough Sets and Fuzzy Logic
