$^*$Forcing

Details $^*$Forcing $^*$Forcing

1992-09-25

arxiv.org/abs/math/9209210v1

Mathematics

Logic

Scientific paper

Let $M$ be a transitive model of $ZFC$ and let ${\bf 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[{\bf G}]$ where ${\bf G}$ is an $M$-complete ultrafilter on ${\bf B}.$) We prove that 1. If ${\bf G}$ is a $^*$forcing complete ultrafilter on ${\bf B},$ then $M[{\bf G}]\models ZFC.$ 2. Let $H\sub M.$ If there is a least transitive model $N$ such that $H\in M,$ $Ord^M=Ord^N,$ and $N\models 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.$

Affiliated with

Also associated with

No associations

Rating

$^*$Forcing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with $^*$Forcing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and $^*$Forcing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-687295