Shelah's definability-function cardinal conjecture

Let ττ1\tau \subseteq \tau_1, let Pτ1τP \in \tau_1 \setminus \tau, and let TT be a theory in τ1\tau_1. For a model MM, define

df(M)=P:(M,P) is a reduct of a model of T\operatorname{df}(M)=\left|\\{P:(M,P)\text{ is a reduct of a model of }T\\}\right|

and define

Df(λ)=supdf(M)+:M=λ.\operatorname{Df}(\lambda)=\sup\\{\operatorname{df}(M)^+:\\|M\\|=\lambda\\}.

Shelah's conjecture. If for some λτ1\lambda\geq|\tau_1|, Df(λ)>Ded(λ)\operatorname{Df}(\lambda)>\operatorname{Ded}(\lambda), then for every λ\lambda, Df(λ)=(2λ)+\operatorname{Df}(\lambda)=(2^\lambda)^+.

This concerns how failure of definability is reflected in the number of expansions of models; the supplied text gives no resolution status.

Sources & referencesView supporting material

Primary source

Saharon Shelah, “A collection of abstracts of Shelah's Papers”, arXiv:2209.01617 (2022).

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.