Scott processes
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 greater than the quantifier depth of and below , has a model of Scott rank .
Keywords
Cite
@article{arxiv.1407.1920,
title = {Scott processes},
author = {Paul B. Larson},
journal= {arXiv preprint arXiv:1407.1920},
year = {2014}
}