Why Y-c.c
classification
🧮 math.LO
keywords
propertiesanticliquesconditionconsequencesconsistencyforcingforcingsgraphs
read the original abstract
We outline a portfolio of novel iterable properties of c.c.c. and proper forcing notions and study its most important instantiations, Y-c.c. and Y-properness. These properties have interesting consequences for partition-type forcings and anticliques in open graphs. Using Neeman's side condition method it is possible to obtain PFA variations and prove consistency results for them.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.