← All problems

Wikipedia model theory and formal languages item 14: Assume K is the class of models of a countable first order theory omitting countably many types…

50 years old · documented by

Let LL be a countable first-order language, let TT be a countable LL-theory, and let PP be a countable family of parameter-free partial types, each in a finite tuple of variables. Let KK consist of the models M⊨TM\models T that omit every p∈Pp\in P; that is, no tuple from MM realizes all formulas of any pp. The question is whether, for every such L,T,PL,T,P, the implication

(∃M∈K  ∣M∣=ℵω1)⟹(∃N∈K  ∣N∣=2ℵ0)\bigl(\exists M\in K\; |M|=\aleph_{\omega_1}\bigr) \quad\Longrightarrow\quad \bigl(\exists N\in K\; |N|=2^{\aleph_0}\bigr)

holds, with no stability or superstability hypothesis on TT. Hrushovski and Shelah (1991) Baldwin and Laskowski (2018)

Background

Omitting types asks whether a model can be built while avoiding specified collections of formulas, and has long been connected with the construction of models having controlled symmetries. The formulation here is closely related to the Hanf-number problem: how large a model must be before its existence guarantees models of a desired size. Countable omitted-type conditions can also be expressed by an Lω1,ωL_{\omega_1,\omega} sentence: for a type p(xˉ)p(\bar x), the omission condition says that no tuple satisfies the countable conjunction of its formulas. Thus transfer results for such sentences bear directly on this question. Hrushovski and Shelah (1991) Baldwin and Laskowski (2018)

Shelah’s 1999 work on Borel sets with large squares developed a splitting-rank method that also yields model-size transfers. Baldwin and Laskowski later placed this method in a Henkin-construction framework: configurations that split repeatedly can be used to build continuum-sized models with additional regularity, including an asymptotically similar family indexed by 2ω2^\omega. Their account also records a consistency result for the infinitary-sentence version of the transfer question. Shelah (1999), Borel sets with large squares Baldwin and Laskowski (2018)

References

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.