Vaught conjecture
Statement
Let be a first-order language with countably many symbols, and let be a complete -theory having infinite models. For a cardinal , let denote the number of isomorphism classes of models of of cardinality , i.e. the cardinality of the set of models of of cardinality counted up to isomorphism.
Then, provably in alone (in particular without assuming the continuum hypothesis ),
that is, is either finite, or equal to , or equal to .
Equivalently: for every countable complete first-order theory with infinite models, if has uncountably many pairwise non-isomorphic countable models, then it has exactly pairwise non-isomorphic countable models.
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.