4 citations · 7 across the 8 of their papers we have counts for
1 paper · 2 filters
Noam Greenberg, Dominique Lecomte, Dan Turetsky +1
We introduce a family of forcing notions that are helpful in showing that certain graphs do not have countable colourings of (additive) Borel class alpha. We construct graphs that…