Skip to main content
Article thumbnail
Location of Repository

Generalized iteration of forcing

By M. Groszek and T. Jecr

Abstract

ABSTRACT. Generalized iteration extends the usual notion of iterated forcing from iterating along an ordinal to iterating along any partially ordered set. We consider a class of forcings called perfect tree forcing. The class includes Axiom A forcings with a finite splitting property, such as Cohen, Laver, Mathias, Miller, Prikry-Silver, and Sacks forcings. If go is a perfect tree forcing, there is a decomposition ~ * [Jf such that ~ is countably closed, [Jf has the countable chain condition, and ~ * [Jf adds a go-generic set. Theorem. The mixed-support generalized iteration of perfect tree forcing decompositions along any well-founded partial order preserves CUI • Theorem. If ZFC is consistent, so is ZFC + 2 0J is arbitrarily large + whenever go is a perfect tree forcing and £g is a collection of CUI dense subsets of go, there is a £g-generic filter on go. O

Year: 1991
OAI identifier: oai:CiteSeerX.psu:10.1.1.353.2222
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.ams.org/journals/tr... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.