The Lascar-rank conjecture for countable models of superstable theories
Statement
Let be a complete, superstable theory in a countable language with infinite models. Write for the number of countable models of , and let denote the supremum of the Lascar ranks of complete types of .
Lascar-rank conjecture. If
then
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.