Location: HILL 705
Date & time: Monday, 23 October 2017 at 5:00PM - 6:00PM
Abstract: Say that consistently there are aleph_2 less than continuum graphs ! each of size aleph_1 which form a universal family. See work with Dzamonja  and . Here we use a forcing which is half way between CS, product, and CS iteration. We also discuss the method in related cases. This talk is based on earlier results from paper [F1340] on the archive: (http://shelah.logic.at/).