Generic Saturation
Logic
2016-09-06 v1
Abstract
Assuming that ORD is -Erd\"os we show that if a class forcing amenable to (an -forcing) has a generic then it has one definable in a set-generic extension of . In fact we may choose such a generic to be {\it periodic} in the sense that it preserve the indiscernibility of a final segment of a periodic subclass of the Silver indiscernibles, and therefore to be {\it almost codable} in the sense that it is definable from a real which is generic for an -forcing (and which belongs to a set-generic extension of ).
Keywords
Cite
@article{arxiv.math/9609202,
title = {Generic Saturation},
author = {Sy D. Friedman},
journal= {arXiv preprint arXiv:math/9609202},
year = {2016}
}