ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a complete, superstable theory in a countable language with infinite models. Write I(T,ℵ0)I(T,\aleph_{0}) for the number of countable models of TT, and let U(T)U(T) denote the supremum of the Lascar ranks of complete types of TT.

Lascar-rank conjecture. If

U(T)≥ωω,U(T)\geq\omega^{\omega},

then

I(T,ℵ0)=2ℵ0.I(T,\aleph_{0})=2^{\aleph_{0}}.

This conjecture concerns the relationship between the Lascar rank of a superstable theory and the number of its countable models. The supplied text attributes it to an earlier work but gives no resolution status.

Record

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.