Scott processes

zbMATH Open1433.03093arXiv1407.1920MaRDI QIDQ5221579FDOQ5221579

Paul Larson

Publication date: 2 April 2020

Abstract: The Scott process of a relational structure $M$ is the sequence of sets of formulas given by the Scott analysis of $M$. We present axioms for the class of Scott processes of structures in a relational vocabulary $au$, 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 $omeg{a}_2$. 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 $mathcal{L}_{omeg{a}_1,omega}(au)$-theory, and which has a model of Scott rank $omeg{a}_1$. Moreover, we show that if $phi$ is a sentence of $mathcal{L}_{omeg{a}_1,omega}(au)$ giving rise to a counterexample to Vaught's Conjecture, then for every limit ordinal $alpha$ greater than the quantifier depth of $phi$ and below $omeg{a}_2$, $phi$ has a model of Scott rank $alpha$.

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

Recommendations

• An introduction to the Scott complexity of countable structures and a survey of recent results
• A note on counterexamples to the Vaught conjecture
• The Vaught conjecture: do uncountable models count?
• A computability theoretic equivalent to Vaught's conjecture
• Scott ranks of models of a theory

Mathematics Subject Classification ID

Model theory of denumerable and separable structures (03C15) Other infinitary logic (03C75)

Cited In (2)

• Title not available (Why is that?)
• AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS

This page was built for publication: Scott processes

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