An undecidable extension of Morley's theorem on the number of countable models

(with C. J. Eagle, C. Hamel, and F. D. Tall)

Submitted. PDF. arXiv. Bibtex.

We show that Morley’s theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of $\sigma$-projective equivalence relations in several models of set theory. Our methods include random and Cohen forcing, Woodin cardinals and Inner Model Theory.