Finite-pattern definability conjecture for invariant types

Let p(x)p(x) be a global MM-invariant type and let Δ\Delta be a finite set of formulas.

Finite-pattern definability conjecture. There is a finite set Δ\Delta' of formulas such that, for every ϕ(x;y)p\phi(x;y)\in p and b,bUb,b'\in\mathcal U, if

tpΔ(b/M)=tpΔ(b/M),\operatorname{tp}_{\Delta'}(b/M)=\operatorname{tp}_{\Delta'}(b'/M),

then

pϕ(x;b)ϕ(x;b).p\vdash \phi(x;b)\leftrightarrow\phi(x;b').

The paper states that a positive answer to the invariant-type quotient conjecture would imply this property. Its status is not resolved in the supplied text.

Sources & referencesView supporting material

Primary source

Pierre Simon, “Dp-minimality: invariant types and dp-rank”, arXiv:1210.4479 (2014).

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.