Abstract: 

The stable forking conjecture, posed by Hart, Kim and Pillay in 1996, says that forking in simple theories is determined by stable formulas. Recently, we have found a counterexample using ChatGPT 5.6, which finally resolves this conjecture. We discuss this counterexample: the theory of an infinite-dimensional module over the fraction division ring of the quantum algebra of the random graph, in the language with scalar multiplication by generators (similarly to the construction of Kasal (2010)).

Zoom：717 463 6082