Skip to content

*Forcing

Garvin Melles

math.LOarXiv:math/9209210

Abstract

Let M be a transitive model of ZFC and let B be a M-complete Boolean algebra in M. (In general a proper class.) We define a generalized notion of forcing with such Boolean algebras, *forcing. (A * forcing extension of M is a transitive set of the form M[ G] where G is an M-complete ultrafilter on B.) We prove that 1. If G is a *forcing complete ultrafilter on B, then M[ G] ZFC. 2. Let H M. If there is a least transitive model N such that H∈ M, OrdM=OrdN, and N ZFC, then we denote N by M[H]. We show that all models of ZFC of the form M[H] are *forcing extensions of M. As an immediate corollary we get that L[0\#] is a *forcing extension of L.

Create a lesson