Extensible definability conjecture for non-forking formulas
Extensible definability conjecture for non-forking formulas
Let be NIP and . Let be a formula non-forking over .
Extensible definability conjecture. There is such that the partial type
is consistent.
This is presented as the central conjecture of the paper and first appeared in earlier work. 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.