Papers
Topics
Authors
Recent
Search
2000 character limit reached

Scott processes

Published 8 Jul 2014 in math.LO | (1407.1920v1)

Abstract: The Scott process of a relational structure MM is the sequence of sets of formulas given by the Scott analysis of MM. We present axioms for the class of Scott processes of structures in a relational vocabulary τ\tau, 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 ω2\omega_{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 L<em>ω</em>1,ω(τ)\mathcal{L}<em>{\omega</em>{1}, \omega}(\tau)-theory, and which has a model of Scott rank ω1\omega_{1}. Moreover, we show that if ϕ\phi is a sentence of L<em>ω</em>1,ω(τ)\mathcal{L}<em>{\omega</em>{1}, \omega}(\tau) giving rise to a counterexample to Vaught's Conjecture, then for every limit ordinal α\alpha greater than the quantifier depth of ϕ\phi and below ω2\omega_{2}, ϕ\phi has a model of Scott rank α\alpha.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.