Does every simple first-order theory have stable forking
Let be a complete simple first-order theory in a language , and work in a monster model of . For disjoint tuples of variables , an -formula is stable if there are no sequences and such that
The question is whether every such has stable forking: for every pair of small sets and every complete type that forks over , must there be a stable formula and a tuple from such that and forks over ? Stable forking and imaginaries (arXiv:1508.02199) Kim and Pillay, Around stable forking (2001)
Background
Stable forking asks whether forking in a simple theory can always be witnessed by a formula whose behavior is stable, thus relating the forking calculus of simple theories to the more local stability theory of individual formulas. The issue was discussed by Hart, Kim, and Pillay at the Fields Institute in autumn 1996; Kim and Pillay’s 2001 paper clarified the conjecture and distinguished it from a stronger property. Kim and Pillay, Around stable forking (2001)
In strong stable forking, the same witnessing requirement applies when a type over forks over an arbitrary set , not necessarily one contained in . Kim and Pillay show that if a simple theory has strong stable forking, then every complete type is a nonforking extension of a complete type axiomatized by instances of stable formulas. This gives a structural consequence of the stronger property, rather than an additional hypothesis in the conjecture. Kim and Pillay, Around stable forking (2001)
References
Progress summary
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.