Tuesday, March 8, 2016

3/8/2016

It looks like we found a proof that R is strongly Jonsson that avoids using the canonization theorems. This is good news, especially for extending the result to E_0. The way we started looking at these tree constructions to get the Mycielski result really does elucidate the inherent combinatorics problem that these constructions boil down to. Talking to my roommate yesterday we decided that combinatorics is to set theory as matrix computations are to algebra.

No comments:

Post a Comment