The subcompleteness of diagonal Prikry

DOI10.1007/S00153-019-00678-7MaRDI QIDQ2288331zbMATH OpenOpenAlexWikidataFDO

Authors Kaethe Minden

Publication date 17 January 2020

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1807.08782

zbMATH Keywords

large cardinalsiterated forcingsubcomplete forcinggeneralized Prikry forcing

Mathematics Subject Classification ID

Other aspects of forcing and Boolean-valued models (03E40) Large cardinals (03E55)

Abstract: Let $D$ be an infinite discrete set of measurable cardinals. It is shown that generalized Prikry forcing to add a countable sequence to each cardinal in $D$ is subcomplete. To do this it is shown that a simplified version of generalized Prikry forcing which adds a point below each cardinal in $D$, called generalized diagonal Prikry forcing, is subcomplete. Moreover, the generalized diagonal Prikry forcing associated to $D$ is subcomplete above $mu$, where $mu$ is any regular cardinal below the first limit point of $D$.

Recommendations

• The subcompleteness of Magidor forcing
• Prikry-forcing and some generalizations
• Closure properties of parametric subcompleteness
• Subcomplete forcing and \(\mathcal{L}\)-forcing
• A minimal Prikry-type forcing for singularizing a measurable cardinal

Cites work

• A characterization of generalized Příkrý sequences
• Subcomplete forcing and \(\mathcal{L}\)-forcing
• Subcomplete forcing, trees, and generic absoluteness
• The subcompleteness of Magidor forcing

Cited in

(1)

• The subcompleteness of Magidor forcing

This page was built for publication: The subcompleteness of diagonal Prikry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2288331)