$^*$Forcing
Logic
2016-09-06 v1
Abstract
Let be a transitive model of and let be a -complete Boolean algebra in (In general a proper class.) We define a generalized notion of forcing with such Boolean algebras, forcing. (A forcing extension of is a transitive set of the form where is an -complete ultrafilter on ) We prove that 1. If is a forcing complete ultrafilter on then 2. Let If there is a least transitive model such that and then we denote by We show that all models of of the form are forcing extensions of As an immediate corollary we get that is a forcing extension of
Keywords
Cite
@article{arxiv.math/9209210,
title = {$^*$Forcing},
author = {Garvin Melles},
journal= {arXiv preprint arXiv:math/9209210},
year = {2016}
}