English

$^*$Forcing

Logic 2016-09-06 v1

Abstract

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

Keywords

Cite

@article{arxiv.math/9209210,
  title  = {$^*$Forcing},
  author = {Garvin Melles},
  journal= {arXiv preprint arXiv:math/9209210},
  year   = {2016}
}