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

Abstract

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 equivalence relations obtained by countable intersections of projective sets in several models of set theory. Our methods include random and Cohen forcing, Woodin cardinals and Inner Model Theory.