The monotonicity conjecture for Lascar equivalence of countable tuples
The monotonicity conjecture for Lascar equivalence of countable tuples
Let and be countable tuples from a monster model, with containing . Let and be the corresponding Lascar-equivalence relations, and let and be their restrictions to the respective Kim--Pillay classes. Tuple monotonicity conjecture. One has
This is proposed as a generalization of the preceding upper-bound conjecture; no resolution is supplied in the paper.
Sources & referencesView supporting material
Primary source
Krzysztof Krupinski, Anand Pillay and Slawomir Solecki, “Borel equivalence relations and Lascar strong types”, arXiv:1204.3485 (2012).
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
Sign in to submit a solution.
No solutions have been posted yet.