ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let LL be a first-order language with countably many symbols, and let TT be a complete LL-theory having infinite models. For a cardinal α\alpha, let I(T,α)I(T,\alpha) denote the number of isomorphism classes of models of TT of cardinality α\alpha, i.e. the cardinality of the set of models of TT of cardinality α\alpha counted up to isomorphism.

Then, provably in ZFC\mathrm{ZFC} alone (in particular without assuming the continuum hypothesis 2ℵ0=ℵ12^{\aleph_0}=\aleph_1),

¬(ℵ0<I(T,ℵ0)<2ℵ0),\neg\bigl(\aleph_0 < I(T,\aleph_0) < 2^{\aleph_0}\bigr),

that is, I(T,ℵ0)I(T,\aleph_0) is either finite, or equal to ℵ0\aleph_0, or equal to 2ℵ02^{\aleph_0}.

Equivalently: for every countable complete first-order theory TT with infinite models, if TT has uncountably many pairwise non-isomorphic countable models, then it has exactly 2ℵ02^{\aleph_0} pairwise non-isomorphic countable models.

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.