A minimal Prikry-type forcing for singularizing a measurable cardinal

Recently, Gitik, Kanovei and the first author proved that for a classical Prikry forcing extension the family of the intermediate models can be parametrized by Pp!q{finite. By modifying the standard Prikry tree forcing we define a Prikry-type forcing which also singularizes a measurable cardinal but which is minimal, i.e. there are no intermediate models properly between the ground model and the generic extension. The proof relies on combining the rigidity of the tree structure with indiscernibility arguments resulting from the normality of the associated measures.

[1]  A. R. D. Mathias,et al.  On sequences generic in the sense of Prikry , 1973, Journal of the Australian Mathematical Society.

[2]  A. Karimi,et al.  Master‟s thesis , 2011 .

[3]  Kenneth Kunen,et al.  Boolean extensions and measurable cardinals , 1971 .

[4]  K. Prikry,et al.  Changing Measurable into Accessible Cardinals , 1970 .

[5]  William J. Mitchell,et al.  The Covering Lemma , 2010 .

[6]  Jaime I. Ihoda.  Δ 1 2 -sets of reals , 1988 .

[7]  I. G. BONNER CLAPPISON.  Editor , 1960, The Electric Power Engineering Handbook - Five Volume Set.

[8]  ScienceDirect.  Annals of mathematical logic , 1969, Journal of Symbolic Logic.

[9]  Gerald E. Sacks,et al.  FORCING WITH PERFECT CLOSED SETS , 1999 .

[10]  Saharon Shelah,et al.  Delta12-Sets of Reals , 1989, Ann. Pure Appl. Log..

[11]  A. J. Dodd,et al.  The covering lemma for L[U] , 1982, Ann. Math. Log..

[12]  Patrick Suppes,et al.  Axiomatic set theory , 1969 .

[13]  Moti Gitik,et al.  Prikry-Type Forcings , 2010 .

[14]  M. Foreman,et al.  Handbook of Set Theory , 2010 .

[15]  S. Shelah,et al.  Annals of Pure and Applied Logic , 1991 .

[16]  Intermediate models of Prikry generic extensions , 2010 .

[17]  Dock Bumpers,et al.  Volume 2 , 2005, Proceedings of the Ninth International Conference on Computer Supported Cooperative Work in Design, 2005..