2 papers
math.LO2026
Forcing and classes of -dominating functions
Noam Greenberg, Gian Marco Osso
We study the question, what computational power is sufficient to perform constructions using either Laver or Hechler forcing. As a result, we obtain a separation between three rela…
math.GN2026
Topology, forcing, and graph colourings
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…