Applications of Fodor's Lemma to Vaught's Conjecture

A tree is said to have unique limits if no two distinct nodes on the same limit level have the same predecessors. If к is a regular cardinal, then a tree of height к is narrow if it is <к branching, has unique limits, and does not embed 2<w. A set of nodes is stationary if the set of heights is stationary. We prove the following extension of Fodor's theorem: Theorem. If T is narrow and S is a stationary set of nodes, then S has a stationary subset along one branch. If M is a countable model, then say that M is isolated at α if the α-theory of M has only countably many countable models. For φ ϵ Lω1ω let Modφ be the collection of isomorphism types of countable models of φ. Theorem. If φ is a counterexample to Vaught's conjecture and for each M ϵ Modφ, AM is a thin set of countable ordinals at which M is isolated, then ∪MϵModφ, AM is thin. We use this theorem to prove several new consequences of the existence of a counterexample to Vaught's conjecture, and to prove extensions of some of the known consequences. For example we show: Theorem. If φ is a counterexample, then there is some α < ω1 such that every nontrivial complete α-theory extending φ is a counterexample. Theorem. If φ is a counterexample, then there is an M ϵ Modφ such that for every N ϵ Modφ if o(N) = o(M), then the o(N)-theory of N is a counterexample.

[1]  John S. Schlipf.  Ordinal Spectra of First-Order Theories , 1977, J. Symb. Log..

[2]  Saturated structures, unions of chains, and preservation theorems , 1980 .

[3]  Alan Adamson,et al.  Admissible sets and the saturation of structures , 1978 .

[4]  Gerald E. Sacks,et al.  On the Number of Countable Models , 1983 .

[5]  Sy D. Friedman,et al.  Steel forcing and barwise compactness , 1982, Ann. Math. Log..

[6]  J. Ressayre.  Models with compactness properties relative to an admissible language , 1977 .

[7]  Sy-David Friedman,et al.  Some recent developments in higher recursion theory , 1983, Journal of Symbolic Logic.

[8]  Saharon Shelah,et al.  A proof of vaught’s conjecture forω-stable theories , 1984 .

[9]  H. Keisler.  Model theory for infinitary logic , 1971 .

[10]  Michael Makkai,et al.  An example concerning Scott heights , 1981, Journal of Symbolic Logic.

[11]  M. Makkai.  Admissible Sets and Infinitary Logic , 1977 .

[12]  John S. Schlipf,et al.  A guide to the identification of admissible sets above structures , 1977 .

[13]  Mark E. Nadel,et al.  The Pure Part of $mathrm{HYP}(mathscr{M}$) , 1977 .

[14]  M. Nadel,et al.  Some Lowenheim-Skolem results for admissible sets , 1972 .

[15]  Victor Harnik,et al.  Applications of Vaught Sentences and the Covering Theorem , 1976, J. Symb. Log..

[16]  John R. Steel,et al.  On Vaught's conjecture , 1978 .

[17]  Jon Barwise,et al.  Admissible sets and structures , 1975 .

[18]  Michael D. Morley.  The Number of Countable Models , 1970, J. Symb. Log..

[19]  M. Nadel,et al.  Scott sentences and admissible sets , 1974 .

[20]  M. Makkai,et al.  An “admissible” generalization of a theorem on countable ∑11 sets of reals with applications , 1977 .

[21]  Victor Harnik,et al.  A tree argument in infinitary model theory , 1977 .