Timeline for computing Morley rank using parameters from an arbitrary model
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 25, 2013 at 3:02 | review | Late answers | |||
| Jun 25, 2013 at 10:29 | |||||
| Dec 12, 2012 at 11:45 | comment | added | Dima Sustretov | Dear Tim, I do not get it how some kind of definability in families might be helpful. Let our definable set contain infinitely many mutually disjoint definable sets of rank $\alpha$. They might be defined all by different formulas $\psi_i(x, b_i)$. We need to prove that there exist infinitely many such formulas with parameters in a given model, probably by changing the parameters $b_i$. The trouble is not so much to control the rank but to ensure that no intersections occur when we change the parameters. | |
| Dec 11, 2012 at 14:55 | history | answered | tim | CC BY-SA 3.0 |