Finite-pattern definability conjecture for invariant types
Finite-pattern definability conjecture for invariant types
Let be a global -invariant type and let be a finite set of formulas.
Finite-pattern definability conjecture. There is a finite set of formulas such that, for every and , if
then
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
Sign in to submit a solution.
No solutions have been posted yet.